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-171620399500438.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-q8m128, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399500438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K 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 50K 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.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 01:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 01:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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-q8m128-ReachabilityCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-12
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-13
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-14
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717224647301

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-q8m128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:50:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:50:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:50:49] [INFO ] Load time of PNML (sax parser for PT used): 838 ms
[2024-06-01 06:50:49] [INFO ] Transformed 754 places.
[2024-06-01 06:50:49] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:50:49] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1066 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 132 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (22 resets) in 1609 ms. (24 steps per ms) remains 5/6 properties
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 405 ms. (98 steps per ms) remains 5/5 properties
[2024-06-01 06:50:51] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-06-01 06:50:51] [INFO ] Computed 10 invariants in 37 ms
[2024-06-01 06:50:51] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem BugTracking-PT-q8m128-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 105/124 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3536/3660 variables, 124/130 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3660 variables, 225/355 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3660 variables, 0/355 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 345/4005 variables, 153/508 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4005 variables, 3/511 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4005 variables, 77/588 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4005 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/4008 variables, 1/589 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4008 variables, 1/590 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4008 variables, 0/590 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/4009 variables, 2/592 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4009 variables, 1/593 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4009/4009 variables, and 593 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2798 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/116 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3442/3558 variables, 116/121 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3558 variables, 136/257 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 06:50:55] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 15 ms to minimize.
[2024-06-01 06:50:55] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 2 ms to minimize.
[2024-06-01 06:50:56] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/3558 variables, 3/260 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3558 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 446/4004 variables, 160/420 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4004 variables, 3/423 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4004 variables, 166/589 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4004 variables, 3/592 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 06:50:57] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4004 variables, 1/593 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4004 variables, 1/594 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4004 variables, 0/594 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 4/4008 variables, 2/596 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4008 variables, 2/598 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4008/4009 variables, and 598 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 278/280 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 8057ms problems are : Problem set: 1 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.27 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 4 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 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 275 transition count 3873
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 15 place count 271 transition count 3873
Applied a total of 15 rules in 524 ms. Remains 271 /280 variables (removed 9) and now considering 3873/3904 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 556 ms. Remains : 271/280 places, 3873/3904 transitions.
RANDOM walk for 40000 steps (13 resets) in 656 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 113152 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 4
Probabilistic random walk after 113152 steps, saw 55081 distinct states, run finished after 3008 ms. (steps per millisecond=37 ) properties seen :0
[2024-06-01 06:51:03] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
// Phase 1: matrix 3701 rows 271 cols
[2024-06-01 06:51:03] [INFO ] Computed 8 invariants in 17 ms
[2024-06-01 06:51:03] [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) 86/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2827/2931 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2931 variables, 63/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2931 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1018/3949 variables, 144/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3949 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3949 variables, 220/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3949 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/3950 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3950 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3950 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 22/3972 variables, 22/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3972 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/3972 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3972/3972 variables, and 562 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2170 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 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) 86/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2827/2931 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2931 variables, 63/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2931 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1018/3949 variables, 144/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3949 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3949 variables, 220/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3949 variables, 3/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:51:07] [INFO ] Deduced a trap composed of 6 places in 484 ms of which 2 ms to minimize.
[2024-06-01 06:51:08] [INFO ] Deduced a trap composed of 11 places in 456 ms of which 2 ms to minimize.
[2024-06-01 06:51:08] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 1 ms to minimize.
[2024-06-01 06:51:08] [INFO ] Deduced a trap composed of 41 places in 352 ms of which 3 ms to minimize.
[2024-06-01 06:51:09] [INFO ] Deduced a trap composed of 11 places in 548 ms of which 7 ms to minimize.
[2024-06-01 06:51:09] [INFO ] Deduced a trap composed of 45 places in 395 ms of which 2 ms to minimize.
[2024-06-01 06:51:10] [INFO ] Deduced a trap composed of 15 places in 439 ms of which 2 ms to minimize.
[2024-06-01 06:51:10] [INFO ] Deduced a trap composed of 33 places in 357 ms of which 1 ms to minimize.
[2024-06-01 06:51:11] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2024-06-01 06:51:11] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2024-06-01 06:51:11] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 0 ms to minimize.
[2024-06-01 06:51:11] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3949 variables, 12/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3949 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/3950 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3950 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3950 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 22/3972 variables, 22/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3972 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/3972 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3972/3972 variables, and 577 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8583 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 10859ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3609 ms.
Support contains 18 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 3873/3873 transitions.
Applied a total of 0 rules in 66 ms. Remains 271 /271 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 271/271 places, 3873/3873 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 3873/3873 transitions.
Applied a total of 0 rules in 61 ms. Remains 271 /271 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
[2024-06-01 06:51:17] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-06-01 06:51:17] [INFO ] Invariant cache hit.
[2024-06-01 06:51:18] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-06-01 06:51:18] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-06-01 06:51:18] [INFO ] Invariant cache hit.
[2024-06-01 06:51:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-06-01 06:51:20] [INFO ] Implicit Places using invariants and state equation in 2349 ms returned []
Implicit Place search using SMT with State Equation took 2781 ms to find 0 implicit places.
[2024-06-01 06:51:20] [INFO ] Redundant transitions in 222 ms returned []
Running 3871 sub problems to find dead transitions.
[2024-06-01 06:51:20] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-06-01 06:51:20] [INFO ] Invariant cache hit.
[2024-06-01 06:51:20] [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:52:33] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
Problem TDEAD782 is UNSAT
[2024-06-01 06:52:33] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/3972 variables, and 10 constraints, problems are : Problem set: 10 solved, 3861 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/271 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3871/2668 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 3861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 10 solved, 3861 unsolved
Problem TDEAD3799 is UNSAT
Problem TDEAD3805 is UNSAT
Problem TDEAD3811 is UNSAT
Problem TDEAD3817 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 2/10 constraints. Problems are: Problem set: 14 solved, 3857 unsolved
[2024-06-01 06:53:01] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
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
[2024-06-01 06:53:01] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
Problem TDEAD2691 is UNSAT
[2024-06-01 06:53:01] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
Problem TDEAD2695 is UNSAT
[2024-06-01 06:53:01] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
Problem TDEAD2696 is UNSAT
Problem TDEAD2697 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2716 is UNSAT
Problem TDEAD2717 is UNSAT
[2024-06-01 06:53:01] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/3972 variables, and 15 constraints, problems are : Problem set: 58 solved, 3813 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/271 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2668 constraints, Known Traps: 7/7 constraints]
After SMT, in 107555ms problems are : Problem set: 58 solved, 3813 unsolved
Search for dead transitions found 58 dead transitions in 107632ms
Found 58 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 58 transitions
Dead transitions reduction (with SMT) removed 58 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 271/271 places, 3815/3873 transitions.
Reduce places removed 15 places and 525 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 256 transition count 3290
Reduce places removed 9 places and 280 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 24 place count 247 transition count 3010
Reduce places removed 12 places and 338 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 36 place count 235 transition count 2672
Reduce places removed 7 places and 185 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 43 place count 228 transition count 2487
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 44 place count 227 transition count 2467
Deduced a syphon composed of 3 places in 2 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 227 transition count 2467
Deduced a syphon composed of 3 places in 3 ms
Applied a total of 45 rules in 71 ms. Remains 227 /271 variables (removed 44) and now considering 2467/3815 (removed 1348) transitions.
[2024-06-01 06:53:08] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
// Phase 1: matrix 2356 rows 227 cols
[2024-06-01 06:53:08] [INFO ] Computed 11 invariants in 18 ms
[2024-06-01 06:53:09] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-06-01 06:53:09] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-06-01 06:53:09] [INFO ] Invariant cache hit.
[2024-06-01 06:53:09] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-06-01 06:53:10] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 227/271 places, 2467/3873 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 112419 ms. Remains : 227/271 places, 2467/3873 transitions.
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40018 steps (38 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 116044 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 3
Probabilistic random walk after 116044 steps, saw 56498 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2024-06-01 06:53:13] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
// Phase 1: matrix 2356 rows 224 cols
[2024-06-01 06:53:13] [INFO ] Computed 8 invariants in 9 ms
[2024-06-01 06:53:13] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1116/1171 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1171 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1171 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 695/1866 variables, 86/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1866 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1866 variables, 130/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1866 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1867 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1867 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1867 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 679/2546 variables, 50/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2546 variables, 77/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2546 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 34/2580 variables, 32/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2580 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2580 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/2580 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2580/2580 variables, and 443 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1200 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 224/224 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1116/1171 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1171 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1171 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 695/1866 variables, 86/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1866 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1866 variables, 130/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1866 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:53:15] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1866 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1866 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/1867 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1867 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1867 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 679/2546 variables, 50/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2546 variables, 77/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2546 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 34/2580 variables, 32/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2580 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2580 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/2580 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2580/2580 variables, and 447 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1850 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 224/224 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3085ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6459 ms.
Support contains 7 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 2467/2467 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 224 transition count 2465
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 222 transition count 2465
Applied a total of 4 rules in 80 ms. Remains 222 /224 variables (removed 2) and now considering 2465/2467 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 222/224 places, 2465/2467 transitions.
RANDOM walk for 40260 steps (8 resets) in 49 ms. (805 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 157244 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 3
Probabilistic random walk after 157244 steps, saw 72031 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 06:53:26] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
// Phase 1: matrix 2354 rows 222 cols
[2024-06-01 06:53:26] [INFO ] Computed 8 invariants in 9 ms
[2024-06-01 06:53:26] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1116/1171 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1171 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1171 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 692/1863 variables, 85/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1863 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1863 variables, 130/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1863 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1864 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1864 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 678/2542 variables, 49/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2542 variables, 77/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2542 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 34/2576 variables, 32/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2576 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2576 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/2576 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2576/2576 variables, and 441 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1311 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 222/222 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1116/1171 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1171 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1171 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 692/1863 variables, 85/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1863 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1863 variables, 130/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1863 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:53:28] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
[2024-06-01 06:53:28] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 1 ms to minimize.
[2024-06-01 06:53:28] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2024-06-01 06:53:28] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1863 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1863 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/1864 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 678/2542 variables, 49/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2542 variables, 77/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2542 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 34/2576 variables, 32/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2576 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:53:29] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2024-06-01 06:53:29] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2576 variables, 2/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2576 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/2576 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2576/2576 variables, and 450 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2868 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 222/222 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 4213ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3490 ms.
Support contains 7 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 2465/2465 transitions.
Applied a total of 0 rules in 28 ms. Remains 222 /222 variables (removed 0) and now considering 2465/2465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 222/222 places, 2465/2465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 2465/2465 transitions.
Applied a total of 0 rules in 28 ms. Remains 222 /222 variables (removed 0) and now considering 2465/2465 (removed 0) transitions.
[2024-06-01 06:53:33] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
[2024-06-01 06:53:33] [INFO ] Invariant cache hit.
[2024-06-01 06:53:34] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-06-01 06:53:34] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
[2024-06-01 06:53:34] [INFO ] Invariant cache hit.
[2024-06-01 06:53:34] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-06-01 06:53:35] [INFO ] Implicit Places using invariants and state equation in 1149 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
[2024-06-01 06:53:35] [INFO ] Redundant transitions in 66 ms returned []
Running 2464 sub problems to find dead transitions.
[2024-06-01 06:53:35] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
[2024-06-01 06:53:35] [INFO ] Invariant cache hit.
[2024-06-01 06:53:35] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2464 unsolved
[2024-06-01 06:54:09] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
[2024-06-01 06:54:09] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1341 is UNSAT
[2024-06-01 06:54:10] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 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 TDEAD1568 is UNSAT
Problem TDEAD1569 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 TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 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 TDEAD1588 is UNSAT
Problem TDEAD1589 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 TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 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 TDEAD1608 is UNSAT
Problem TDEAD1609 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 TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 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 TDEAD1628 is UNSAT
Problem TDEAD1629 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
[2024-06-01 06:54:13] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 4 ms to minimize.
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 TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 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 TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 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
[2024-06-01 06:54:13] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
Problem TDEAD1940 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 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 TDEAD1972 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1976 is UNSAT
Problem TDEAD1977 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1985 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1989 is UNSAT
Problem TDEAD1990 is UNSAT
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
Problem TDEAD2056 is UNSAT
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 8/16 constraints. Problems are: Problem set: 674 solved, 1790 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 222/2576 variables, and 16 constraints, problems are : Problem set: 674 solved, 1790 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/222 constraints, ReadFeed: 0/211 constraints, PredecessorRefiner: 2464/2464 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 674 solved, 1790 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 6/6 constraints. Problems are: Problem set: 674 solved, 1790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 4/10 constraints. Problems are: Problem set: 674 solved, 1790 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/10 constraints. Problems are: Problem set: 674 solved, 1790 unsolved
At refinement iteration 3 (OVERLAPS) 13/222 variables, 2/12 constraints. Problems are: Problem set: 674 solved, 1790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 4/16 constraints. Problems are: Problem set: 674 solved, 1790 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/16 constraints. Problems are: Problem set: 674 solved, 1790 unsolved
At refinement iteration 6 (OVERLAPS) 2354/2576 variables, 222/238 constraints. Problems are: Problem set: 674 solved, 1790 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2576 variables, 211/449 constraints. Problems are: Problem set: 674 solved, 1790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2576/2576 variables, and 2239 constraints, problems are : Problem set: 674 solved, 1790 unsolved in 32235 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 222/222 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1790/2464 constraints, Known Traps: 8/8 constraints]
After SMT, in 82458ms problems are : Problem set: 674 solved, 1790 unsolved
Search for dead transitions found 674 dead transitions in 82488ms
Found 674 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 674 transitions
Dead transitions reduction (with SMT) removed 674 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 222/222 places, 1791/2465 transitions.
Graph (complete) has 2343 edges and 222 vertex of which 211 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 365 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 197 transition count 1426
Reduce places removed 12 places and 204 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 27 place count 185 transition count 1222
Reduce places removed 10 places and 105 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 37 place count 175 transition count 1117
Reduce places removed 6 places and 33 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 43 place count 169 transition count 1084
Reduce places removed 2 places and 46 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 45 place count 167 transition count 1038
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 46 place count 166 transition count 1022
Reduce places removed 1 places and 7 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 47 place count 165 transition count 1015
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 65 place count 147 transition count 868
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 2 places and 32 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 85 place count 145 transition count 836
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 93 place count 137 transition count 788
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 101 place count 137 transition count 788
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 101 rules in 42 ms. Remains 137 /222 variables (removed 85) and now considering 788/1791 (removed 1003) transitions.
[2024-06-01 06:54:57] [INFO ] Flow matrix only has 702 transitions (discarded 86 similar events)
// Phase 1: matrix 702 rows 137 cols
[2024-06-01 06:54:57] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 06:54:58] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 06:54:58] [INFO ] Flow matrix only has 702 transitions (discarded 86 similar events)
[2024-06-01 06:54:58] [INFO ] Invariant cache hit.
[2024-06-01 06:54:58] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-01 06:54:58] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 137/222 places, 788/2465 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 84580 ms. Remains : 137/222 places, 788/2465 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40368 steps (8 resets) in 45 ms. (877 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 311482 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 311482 steps, saw 172403 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2024-06-01 06:55:01] [INFO ] Flow matrix only has 702 transitions (discarded 86 similar events)
// Phase 1: matrix 702 rows 135 cols
[2024-06-01 06:55:01] [INFO ] Computed 6 invariants in 5 ms
[2024-06-01 06:55:01] [INFO ] State equation strengthened by 98 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/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) 221/245 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/249 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 413/662 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 42/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/662 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 156/818 variables, 43/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/818 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/818 variables, 28/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/818 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/819 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/819 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/819 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 18/837 variables, 18/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/837 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/837 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/837 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 837/837 variables, and 239 constraints, problems are : Problem set: 0 solved, 2 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 135/135 constraints, ReadFeed: 98/98 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/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) 221/245 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/249 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 413/662 variables, 44/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/662 variables, 42/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 156/818 variables, 43/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/818 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/818 variables, 28/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/818 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/819 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/819 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/819 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/837 variables, 18/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/837 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:55:02] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/837 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/837 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/837 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 837/837 variables, and 242 constraints, problems are : Problem set: 0 solved, 2 unsolved in 493 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 135/135 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 774ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 215 ms.
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 788/788 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 786
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 133 transition count 780
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 133 transition count 780
Applied a total of 4 rules in 17 ms. Remains 133 /135 variables (removed 2) and now considering 780/788 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 133/135 places, 780/788 transitions.
RANDOM walk for 40288 steps (8 resets) in 39 ms. (1007 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 353007 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 2
Probabilistic random walk after 353007 steps, saw 199459 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2024-06-01 06:55:05] [INFO ] Flow matrix only has 692 transitions (discarded 88 similar events)
// Phase 1: matrix 692 rows 133 cols
[2024-06-01 06:55:05] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 06:55:05] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/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) 213/237 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/241 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 409/650 variables, 42/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 40/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 156/806 variables, 43/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/806 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/806 variables, 28/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/806 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/807 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/807 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/807 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 18/825 variables, 18/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/825 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/825 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/825 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 825/825 variables, and 235 constraints, problems are : Problem set: 0 solved, 2 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 133/133 constraints, ReadFeed: 96/96 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/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) 213/237 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/241 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 409/650 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/650 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 156/806 variables, 43/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/806 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/806 variables, 28/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/806 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/807 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/807 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/807 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/825 variables, 18/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/825 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:55:06] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/825 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/825 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/825 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 825/825 variables, and 238 constraints, problems are : Problem set: 0 solved, 2 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 133/133 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 606ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 108 ms.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 780/780 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 780/780 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 133/133 places, 780/780 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 780/780 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 780/780 (removed 0) transitions.
[2024-06-01 06:55:06] [INFO ] Flow matrix only has 692 transitions (discarded 88 similar events)
[2024-06-01 06:55:06] [INFO ] Invariant cache hit.
[2024-06-01 06:55:06] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 06:55:06] [INFO ] Flow matrix only has 692 transitions (discarded 88 similar events)
[2024-06-01 06:55:06] [INFO ] Invariant cache hit.
[2024-06-01 06:55:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 06:55:06] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-06-01 06:55:06] [INFO ] Redundant transitions in 19 ms returned []
Running 779 sub problems to find dead transitions.
[2024-06-01 06:55:06] [INFO ] Flow matrix only has 692 transitions (discarded 88 similar events)
[2024-06-01 06:55:06] [INFO ] Invariant cache hit.
[2024-06-01 06:55:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (OVERLAPS) 692/823 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/823 variables, 96/233 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 5 (OVERLAPS) 2/825 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/825 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 825/825 variables, and 235 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 133/133 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (OVERLAPS) 692/823 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/823 variables, 96/233 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Problem TDEAD301 is UNSAT
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 TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 586/819 constraints. Problems are: Problem set: 82 solved, 697 unsolved
[2024-06-01 06:55:48] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:55:50] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 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 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 TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
[2024-06-01 06:55:54] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
Problem TDEAD321 is UNSAT
[2024-06-01 06:55:54] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD396 is UNSAT
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD585 is UNSAT
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD647 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 10/829 constraints. Problems are: Problem set: 172 solved, 607 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/825 variables, and 829 constraints, problems are : Problem set: 172 solved, 607 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 131/133 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 586/779 constraints, Known Traps: 10/10 constraints]
After SMT, in 61723ms problems are : Problem set: 172 solved, 607 unsolved
Search for dead transitions found 172 dead transitions in 61731ms
Found 172 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 172 transitions
Dead transitions reduction (with SMT) removed 172 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/133 places, 608/780 transitions.
Graph (complete) has 889 edges and 133 vertex of which 130 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 18 places and 187 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 112 transition count 421
Reduce places removed 4 places and 41 transitions.
Graph (complete) has 597 edges and 108 vertex of which 3 are kept as prefixes of interest. Removing 105 places using SCC suffix rule.0 ms
Discarding 105 places :
Also discarding 380 output transitions
Drop transitions (Output transitions of discarded places.) removed 380 transitions
Iterating post reduction 1 with 5 rules applied. Total rules applied 24 place count 3 transition count 0
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 24 rules in 3 ms. Remains 3 /133 variables (removed 130) and now considering 0/608 (removed 608) transitions.
[2024-06-01 06:56:08] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:56:08] [INFO ] Implicit Places using invariants in 11 ms returned []
[2024-06-01 06:56:08] [INFO ] Invariant cache hit.
[2024-06-01 06:56:08] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 3/133 places, 0/780 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62274 ms. Remains : 3/133 places, 0/780 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 320044 ms.
ITS solved all properties within timeout

BK_STOP 1717224968785

--------------------
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

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-q8m128"
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-q8m128, 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-171620399500438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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