About the Execution of LTSMin+red for BugTracking-PT-q8m004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16030.140 | 454820.00 | 613441.00 | 169.00 | ?FT??FT?FFFTF?FF | normal |
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-171620399400393.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-q8m004, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399400393
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K 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 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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-q8m004-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q8m004-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717223944385
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:39:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:39:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:39:06] [INFO ] Load time of PNML (sax parser for PT used): 886 ms
[2024-06-01 06:39:06] [INFO ] Transformed 754 places.
[2024-06-01 06:39:06] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:39:06] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1126 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Deduced a syphon composed of 474 places in 86 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 94 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-06-01 06:39:07] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-06-01 06:39:07] [INFO ] Computed 8 invariants in 110 ms
[2024-06-01 06:39:08] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2024-06-01 06:39:08] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:39:08] [INFO ] Invariant cache hit.
[2024-06-01 06:39:09] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-06-01 06:39:10] [INFO ] Implicit Places using invariants and state equation in 2212 ms returned []
Implicit Place search using SMT with State Equation took 3252 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-06-01 06:39:10] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:39:10] [INFO ] Invariant cache hit.
[2024-06-01 06:39:10] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-06-01 06:40:10] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 11 ms to minimize.
[2024-06-01 06:40:10] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:40:10] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 1 ms to minimize.
[2024-06-01 06:40:18] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 12 constraints, problems are : Problem set: 14 solved, 3855 unsolved in 30133 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/2672 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 14 solved, 3855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 3855 unsolved
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 4/12 constraints. Problems are: Problem set: 45 solved, 3824 unsolved
[2024-06-01 06:40:52] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
Problem TDEAD2716 is UNSAT
Problem TDEAD2728 is UNSAT
[2024-06-01 06:40:52] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
[2024-06-01 06:40:53] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
Problem TDEAD2741 is UNSAT
[2024-06-01 06:40:53] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
SMT process timed out in 102476ms, After SMT, problems are : Problem set: 45 solved, 3824 unsolved
Search for dead transitions found 56 dead transitions in 102540ms
Found 56 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 56 transitions
Dead transitions reduction (with SMT) removed 56 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3815/3904 transitions.
Reduce places removed 13 places and 433 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 264 transition count 3382
Reduce places removed 7 places and 210 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 20 place count 257 transition count 3172
Reduce places removed 6 places and 168 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 26 place count 251 transition count 3004
Reduce places removed 3 places and 81 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 29 place count 248 transition count 2923
Deduced a syphon composed of 1 places in 8 ms
Applied a total of 29 rules in 30 ms. Remains 248 /277 variables (removed 29) and now considering 2923/3815 (removed 892) transitions.
[2024-06-01 06:40:53] [INFO ] Flow matrix only has 2803 transitions (discarded 120 similar events)
// Phase 1: matrix 2803 rows 248 cols
[2024-06-01 06:40:53] [INFO ] Computed 9 invariants in 24 ms
[2024-06-01 06:40:53] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-06-01 06:40:53] [INFO ] Flow matrix only has 2803 transitions (discarded 120 similar events)
[2024-06-01 06:40:53] [INFO ] Invariant cache hit.
[2024-06-01 06:40:54] [INFO ] State equation strengthened by 234 read => feed constraints.
[2024-06-01 06:40:55] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 2070 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 248/280 places, 2923/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108043 ms. Remains : 248/280 places, 2923/3904 transitions.
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Support contains 23 out of 247 places after structural reductions.
[2024-06-01 06:40:55] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 06:40:55] [INFO ] Flatten gal took : 237 ms
[2024-06-01 06:40:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BugTracking-PT-q8m004-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:40:55] [INFO ] Flatten gal took : 164 ms
[2024-06-01 06:40:56] [INFO ] Input system was already deterministic with 2923 transitions.
Support contains 9 out of 247 places (down from 23) after GAL structural reductions.
FORMULA BugTracking-PT-q8m004-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (438 resets) in 2060 ms. (19 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (119 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (96 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (99 resets) in 223 ms. (178 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (118 resets) in 392 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (106 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
[2024-06-01 06:40:57] [INFO ] Flow matrix only has 2803 transitions (discarded 120 similar events)
// Phase 1: matrix 2803 rows 247 cols
[2024-06-01 06:40:57] [INFO ] Computed 8 invariants in 11 ms
[2024-06-01 06:40:57] [INFO ] State equation strengthened by 234 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 49/55 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1250/1305 variables, 55/57 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1305 variables, 2/59 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1305 variables, 0/59 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 189/1494 variables, 54/113 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1494 variables, 96/209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1494 variables, 0/209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1495 variables, 1/210 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1495 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1495 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1382/2877 variables, 37/248 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2877 variables, 101/349 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2877 variables, 0/349 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 7/2884 variables, 2/351 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2884 variables, 0/351 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/3046 variables, 97/448 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3046 variables, 3/451 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3046 variables, 35/486 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3046 variables, 0/486 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 4/3050 variables, 3/489 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3050 variables, 0/489 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/3050 variables, 0/489 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3050/3050 variables, and 489 constraints, problems are : Problem set: 3 solved, 2 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 247/247 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1250/1305 variables, 55/57 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1305 variables, 2/59 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1305 variables, 0/59 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 189/1494 variables, 54/113 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1494 variables, 96/209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1494 variables, 2/211 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1494 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1495 variables, 1/212 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1495 variables, 1/213 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1495 variables, 0/213 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1382/2877 variables, 37/250 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2877 variables, 101/351 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2877 variables, 0/351 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 7/2884 variables, 2/353 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2884 variables, 0/353 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 162/3046 variables, 97/450 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3046 variables, 3/453 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3046 variables, 35/488 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-01 06:40:59] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2024-06-01 06:40:59] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 2 ms to minimize.
[2024-06-01 06:41:00] [INFO ] Deduced a trap composed of 59 places in 361 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3046 variables, 3/491 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3046 variables, 0/491 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 4/3050 variables, 3/494 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-01 06:41:00] [INFO ] Deduced a trap composed of 87 places in 347 ms of which 2 ms to minimize.
[2024-06-01 06:41:01] [INFO ] Deduced a trap composed of 83 places in 313 ms of which 2 ms to minimize.
[2024-06-01 06:41:01] [INFO ] Deduced a trap composed of 88 places in 286 ms of which 2 ms to minimize.
[2024-06-01 06:41:01] [INFO ] Deduced a trap composed of 84 places in 281 ms of which 2 ms to minimize.
[2024-06-01 06:41:02] [INFO ] Deduced a trap composed of 83 places in 257 ms of which 2 ms to minimize.
[2024-06-01 06:41:02] [INFO ] Deduced a trap composed of 82 places in 316 ms of which 2 ms to minimize.
[2024-06-01 06:41:02] [INFO ] Deduced a trap composed of 83 places in 303 ms of which 1 ms to minimize.
[2024-06-01 06:41:03] [INFO ] Deduced a trap composed of 75 places in 326 ms of which 2 ms to minimize.
SMT process timed out in 6060ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 2923/2923 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 246 transition count 2900
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 246 transition count 2900
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 244 transition count 2904
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 244 transition count 2898
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 238 transition count 2898
Applied a total of 18 rules in 213 ms. Remains 238 /247 variables (removed 9) and now considering 2898/2923 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 238/247 places, 2898/2923 transitions.
RANDOM walk for 40001 steps (11 resets) in 490 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 144546 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 144546 steps, saw 60147 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
[2024-06-01 06:41:06] [INFO ] Flow matrix only has 2774 transitions (discarded 124 similar events)
// Phase 1: matrix 2774 rows 238 cols
[2024-06-01 06:41:06] [INFO ] Computed 8 invariants in 24 ms
[2024-06-01 06:41:06] [INFO ] State equation strengthened by 235 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) 51/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1229/1283 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1283 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1283 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 185/1468 variables, 53/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1468 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1468 variables, 97/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1468 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1381/2849 variables, 36/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2849 variables, 101/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2849 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/2852 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2852 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2852 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 158/3010 variables, 92/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3010 variables, 3/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3010 variables, 35/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3010 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3012 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3012 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/3012 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3012/3012 variables, and 481 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1076 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, ReadFeed: 235/235 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) 51/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1229/1283 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1283 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1283 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 185/1468 variables, 53/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1468 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1468 variables, 97/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1468 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1468 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1381/2849 variables, 36/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2849 variables, 101/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2849 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/2852 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2852 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2852 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 158/3010 variables, 92/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3010 variables, 3/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3010 variables, 35/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:41:09] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2024-06-01 06:41:09] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3010 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3010 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3012 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:41:10] [INFO ] Deduced a trap composed of 70 places in 435 ms of which 2 ms to minimize.
[2024-06-01 06:41:10] [INFO ] Deduced a trap composed of 74 places in 387 ms of which 2 ms to minimize.
[2024-06-01 06:41:11] [INFO ] Deduced a trap composed of 40 places in 370 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/3012 variables, 3/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3012 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/3012 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3012/3012 variables, and 488 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3602 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 4722ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 280 ms.
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 2898/2898 transitions.
Applied a total of 0 rules in 49 ms. Remains 238 /238 variables (removed 0) and now considering 2898/2898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 238/238 places, 2898/2898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 2898/2898 transitions.
Applied a total of 0 rules in 47 ms. Remains 238 /238 variables (removed 0) and now considering 2898/2898 (removed 0) transitions.
[2024-06-01 06:41:11] [INFO ] Flow matrix only has 2774 transitions (discarded 124 similar events)
[2024-06-01 06:41:11] [INFO ] Invariant cache hit.
[2024-06-01 06:41:12] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-06-01 06:41:12] [INFO ] Flow matrix only has 2774 transitions (discarded 124 similar events)
[2024-06-01 06:41:12] [INFO ] Invariant cache hit.
[2024-06-01 06:41:12] [INFO ] State equation strengthened by 235 read => feed constraints.
[2024-06-01 06:41:13] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
[2024-06-01 06:41:13] [INFO ] Redundant transitions in 176 ms returned []
Running 2897 sub problems to find dead transitions.
[2024-06-01 06:41:13] [INFO ] Flow matrix only has 2774 transitions (discarded 124 similar events)
[2024-06-01 06:41:13] [INFO ] Invariant cache hit.
[2024-06-01 06:41:13] [INFO ] State equation strengthened by 235 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
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 TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 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 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 TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
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 TDEAD1363 is UNSAT
Problem TDEAD1364 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 TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 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 TDEAD1383 is UNSAT
Problem TDEAD1384 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 TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 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 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 TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1788 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
[2024-06-01 06:42:07] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2165 is UNSAT
Problem TDEAD2166 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2183 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2237 is UNSAT
Problem TDEAD2238 is UNSAT
Problem TDEAD2239 is UNSAT
Problem TDEAD2240 is UNSAT
Problem TDEAD2241 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2252 is UNSAT
Problem TDEAD2253 is UNSAT
Problem TDEAD2255 is UNSAT
Problem TDEAD2256 is UNSAT
Problem TDEAD2257 is UNSAT
Problem TDEAD2263 is UNSAT
Problem TDEAD2264 is UNSAT
Problem TDEAD2265 is UNSAT
Problem TDEAD2266 is UNSAT
Problem TDEAD2267 is UNSAT
Problem TDEAD2268 is UNSAT
Problem TDEAD2269 is UNSAT
Problem TDEAD2270 is UNSAT
Problem TDEAD2271 is UNSAT
Problem TDEAD2272 is UNSAT
Problem TDEAD2282 is UNSAT
Problem TDEAD2283 is UNSAT
Problem TDEAD2285 is UNSAT
Problem TDEAD2286 is UNSAT
Problem TDEAD2287 is UNSAT
Problem TDEAD2293 is UNSAT
Problem TDEAD2294 is UNSAT
Problem TDEAD2295 is UNSAT
Problem TDEAD2296 is UNSAT
Problem TDEAD2297 is UNSAT
Problem TDEAD2298 is UNSAT
Problem TDEAD2299 is UNSAT
Problem TDEAD2300 is UNSAT
Problem TDEAD2301 is UNSAT
Problem TDEAD2302 is UNSAT
[2024-06-01 06:42:11] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
Problem TDEAD2874 is UNSAT
[2024-06-01 06:42:11] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
Problem TDEAD2884 is UNSAT
Problem TDEAD2895 is UNSAT
Problem TDEAD2896 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 6/14 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/3012 variables, and 14 constraints, problems are : Problem set: 736 solved, 2161 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/238 constraints, ReadFeed: 0/235 constraints, PredecessorRefiner: 2897/2897 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 736 solved, 2161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 7/7 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 6/13 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/13 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
At refinement iteration 3 (OVERLAPS) 13/238 variables, 1/14 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/14 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
At refinement iteration 5 (OVERLAPS) 2774/3012 variables, 238/252 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3012 variables, 235/487 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3012/3012 variables, and 2648 constraints, problems are : Problem set: 736 solved, 2161 unsolved in 34438 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 2161/2897 constraints, Known Traps: 6/6 constraints]
After SMT, in 98904ms problems are : Problem set: 736 solved, 2161 unsolved
Search for dead transitions found 736 dead transitions in 98938ms
Found 736 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 736 transitions
Dead transitions reduction (with SMT) removed 736 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 238/238 places, 2162/2898 transitions.
Graph (complete) has 2750 edges and 238 vertex of which 225 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.3 ms
Discarding 13 places :
Also discarding 0 output transitions
Reduce places removed 19 places and 453 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 206 transition count 1709
Reduce places removed 14 places and 253 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 34 place count 192 transition count 1456
Reduce places removed 9 places and 116 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 43 place count 183 transition count 1340
Reduce places removed 5 places and 45 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 48 place count 178 transition count 1295
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 50 place count 176 transition count 1243
Reduce places removed 1 places and 19 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 51 place count 175 transition count 1224
Reduce places removed 1 places and 7 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 52 place count 174 transition count 1217
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 73 place count 153 transition count 1053
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 7 with 21 rules applied. Total rules applied 94 place count 153 transition count 1053
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 105 place count 142 transition count 987
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 7 with 11 rules applied. Total rules applied 116 place count 142 transition count 987
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 116 rules in 53 ms. Remains 142 /238 variables (removed 96) and now considering 987/2162 (removed 1175) transitions.
[2024-06-01 06:42:52] [INFO ] Flow matrix only has 873 transitions (discarded 114 similar events)
// Phase 1: matrix 873 rows 142 cols
[2024-06-01 06:42:52] [INFO ] Computed 8 invariants in 6 ms
[2024-06-01 06:42:52] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 06:42:52] [INFO ] Flow matrix only has 873 transitions (discarded 114 similar events)
[2024-06-01 06:42:52] [INFO ] Invariant cache hit.
[2024-06-01 06:42:52] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-06-01 06:42:53] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 142/238 places, 987/2898 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 101391 ms. Remains : 142/238 places, 987/2898 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2024-06-01 06:42:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 06:42:53] [INFO ] Flatten gal took : 128 ms
FORMULA BugTracking-PT-q8m004-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:42:53] [INFO ] Flatten gal took : 124 ms
[2024-06-01 06:42:53] [INFO ] Input system was already deterministic with 2923 transitions.
Computed a total of 5 stabilizing places and 101 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 247/247 places, 2923/2923 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 246 transition count 2900
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 246 transition count 2900
Applied a total of 2 rules in 111 ms. Remains 246 /247 variables (removed 1) and now considering 2900/2923 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 112 ms. Remains : 246/247 places, 2900/2923 transitions.
[2024-06-01 06:42:54] [INFO ] Flatten gal took : 109 ms
[2024-06-01 06:42:54] [INFO ] Flatten gal took : 122 ms
[2024-06-01 06:42:54] [INFO ] Input system was already deterministic with 2900 transitions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 2923/2923 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 246 transition count 2900
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 246 transition count 2900
Applied a total of 2 rules in 16 ms. Remains 246 /247 variables (removed 1) and now considering 2900/2923 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 246/247 places, 2900/2923 transitions.
[2024-06-01 06:42:54] [INFO ] Flatten gal took : 119 ms
[2024-06-01 06:42:54] [INFO ] Flatten gal took : 122 ms
[2024-06-01 06:42:54] [INFO ] Input system was already deterministic with 2900 transitions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 2923/2923 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 246 transition count 2900
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 246 transition count 2900
Applied a total of 2 rules in 19 ms. Remains 246 /247 variables (removed 1) and now considering 2900/2923 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 246/247 places, 2900/2923 transitions.
[2024-06-01 06:42:55] [INFO ] Flatten gal took : 122 ms
[2024-06-01 06:42:55] [INFO ] Flatten gal took : 138 ms
[2024-06-01 06:42:55] [INFO ] Input system was already deterministic with 2900 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 247/247 places, 2923/2923 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 246 transition count 2900
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 246 transition count 2900
Applied a total of 2 rules in 117 ms. Remains 246 /247 variables (removed 1) and now considering 2900/2923 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 117 ms. Remains : 246/247 places, 2900/2923 transitions.
[2024-06-01 06:42:55] [INFO ] Flatten gal took : 96 ms
[2024-06-01 06:42:55] [INFO ] Flatten gal took : 108 ms
[2024-06-01 06:42:56] [INFO ] Input system was already deterministic with 2900 transitions.
RANDOM walk for 40003 steps (447 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (125 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 140527 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 1
Probabilistic random walk after 140527 steps, saw 80866 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
[2024-06-01 06:42:59] [INFO ] Flow matrix only has 2782 transitions (discarded 118 similar events)
// Phase 1: matrix 2782 rows 246 cols
[2024-06-01 06:42:59] [INFO ] Computed 8 invariants in 18 ms
[2024-06-01 06:42:59] [INFO ] State equation strengthened by 234 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1295/1320 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1320 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1320 variables, 76/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1320 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/1325 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 798/2123 variables, 102/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2123 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2123 variables, 45/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2123 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 814/2937 variables, 50/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2937 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2937 variables, 93/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2937 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/2942 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2942 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 86/3028 variables, 66/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3028 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3028 variables, 19/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3028 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/3028 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3028/3028 variables, and 488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 246/246 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1295/1320 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1320 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1320 variables, 76/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1320 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/1325 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 798/2123 variables, 102/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2123 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2123 variables, 45/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2123 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2123 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 814/2937 variables, 50/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2937 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2937 variables, 93/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:43:01] [INFO ] Deduced a trap composed of 58 places in 250 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2937 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2937 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/2942 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2942 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 86/3028 variables, 66/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3028 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3028 variables, 19/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:43:01] [INFO ] Deduced a trap composed of 81 places in 351 ms of which 2 ms to minimize.
[2024-06-01 06:43:02] [INFO ] Deduced a trap composed of 83 places in 326 ms of which 2 ms to minimize.
[2024-06-01 06:43:02] [INFO ] Deduced a trap composed of 84 places in 361 ms of which 2 ms to minimize.
[2024-06-01 06:43:02] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 2 ms to minimize.
[2024-06-01 06:43:03] [INFO ] Deduced a trap composed of 43 places in 272 ms of which 2 ms to minimize.
[2024-06-01 06:43:03] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/3028 variables, 6/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3028 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/3028 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3028/3028 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3324 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 246/246 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 4236ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 2900/2900 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 244 transition count 2904
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 244 transition count 2898
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 238 transition count 2898
Applied a total of 16 rules in 131 ms. Remains 238 /246 variables (removed 8) and now considering 2898/2900 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 238/246 places, 2898/2900 transitions.
RANDOM walk for 4000007 steps (11 resets) in 21413 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 8770 ms. (456 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1354775 steps, run timeout after 24001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 1354775 steps, saw 767745 distinct states, run finished after 24001 ms. (steps per millisecond=56 ) properties seen :0
[2024-06-01 06:43:36] [INFO ] Flow matrix only has 2774 transitions (discarded 124 similar events)
// Phase 1: matrix 2774 rows 238 cols
[2024-06-01 06:43:36] [INFO ] Computed 8 invariants in 21 ms
[2024-06-01 06:43:36] [INFO ] State equation strengthened by 235 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1305/1330 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1330 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1330 variables, 86/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1330 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/1334 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1334 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 903/2237 variables, 109/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2237 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2237 variables, 51/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2237 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 705/2942 variables, 51/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2942 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2942 variables, 78/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2942 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/2943 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2943 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2943 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 69/3012 variables, 49/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3012 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3012 variables, 19/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3012 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/3012 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3012/3012 variables, and 481 constraints, problems are : Problem set: 0 solved, 1 unsolved in 874 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1305/1330 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1330 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1330 variables, 86/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1330 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/1334 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1334 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 903/2237 variables, 109/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2237 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2237 variables, 51/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2237 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2237 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 705/2942 variables, 51/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2942 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2942 variables, 78/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:43:38] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2942 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2942 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/2943 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2943 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2943 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 69/3012 variables, 49/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3012 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3012 variables, 19/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:43:38] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/3012 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3012 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/3012 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3012/3012 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1573 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2485ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 2898/2898 transitions.
Applied a total of 0 rules in 52 ms. Remains 238 /238 variables (removed 0) and now considering 2898/2898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 238/238 places, 2898/2898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 2898/2898 transitions.
Applied a total of 0 rules in 44 ms. Remains 238 /238 variables (removed 0) and now considering 2898/2898 (removed 0) transitions.
[2024-06-01 06:43:38] [INFO ] Flow matrix only has 2774 transitions (discarded 124 similar events)
[2024-06-01 06:43:38] [INFO ] Invariant cache hit.
[2024-06-01 06:43:39] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-06-01 06:43:39] [INFO ] Flow matrix only has 2774 transitions (discarded 124 similar events)
[2024-06-01 06:43:39] [INFO ] Invariant cache hit.
[2024-06-01 06:43:39] [INFO ] State equation strengthened by 235 read => feed constraints.
[2024-06-01 06:43:40] [INFO ] Implicit Places using invariants and state equation in 1345 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
[2024-06-01 06:43:40] [INFO ] Redundant transitions in 91 ms returned []
Running 2897 sub problems to find dead transitions.
[2024-06-01 06:43:40] [INFO ] Flow matrix only has 2774 transitions (discarded 124 similar events)
[2024-06-01 06:43:40] [INFO ] Invariant cache hit.
[2024-06-01 06:43:40] [INFO ] State equation strengthened by 235 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
[2024-06-01 06:44:32] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
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 TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 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 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 TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
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 TDEAD1363 is UNSAT
Problem TDEAD1364 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 TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 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 TDEAD1383 is UNSAT
Problem TDEAD1384 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 TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
[2024-06-01 06:44:33] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
[2024-06-01 06:44:33] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 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 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 TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1788 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
[2024-06-01 06:44:36] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2165 is UNSAT
Problem TDEAD2166 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2183 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2237 is UNSAT
Problem TDEAD2238 is UNSAT
Problem TDEAD2239 is UNSAT
Problem TDEAD2240 is UNSAT
Problem TDEAD2241 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2252 is UNSAT
Problem TDEAD2253 is UNSAT
Problem TDEAD2255 is UNSAT
Problem TDEAD2256 is UNSAT
Problem TDEAD2257 is UNSAT
Problem TDEAD2263 is UNSAT
Problem TDEAD2264 is UNSAT
Problem TDEAD2265 is UNSAT
Problem TDEAD2266 is UNSAT
Problem TDEAD2267 is UNSAT
Problem TDEAD2268 is UNSAT
Problem TDEAD2269 is UNSAT
Problem TDEAD2270 is UNSAT
Problem TDEAD2271 is UNSAT
Problem TDEAD2272 is UNSAT
Problem TDEAD2282 is UNSAT
Problem TDEAD2283 is UNSAT
Problem TDEAD2285 is UNSAT
Problem TDEAD2286 is UNSAT
Problem TDEAD2287 is UNSAT
Problem TDEAD2293 is UNSAT
Problem TDEAD2294 is UNSAT
Problem TDEAD2295 is UNSAT
Problem TDEAD2296 is UNSAT
Problem TDEAD2297 is UNSAT
Problem TDEAD2298 is UNSAT
Problem TDEAD2299 is UNSAT
Problem TDEAD2300 is UNSAT
Problem TDEAD2301 is UNSAT
Problem TDEAD2302 is UNSAT
[2024-06-01 06:44:40] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
Problem TDEAD2874 is UNSAT
[2024-06-01 06:44:40] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
Problem TDEAD2884 is UNSAT
Problem TDEAD2895 is UNSAT
Problem TDEAD2896 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 6/14 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/3012 variables, and 14 constraints, problems are : Problem set: 736 solved, 2161 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/238 constraints, ReadFeed: 0/235 constraints, PredecessorRefiner: 2897/2897 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 736 solved, 2161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 7/7 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 6/13 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/13 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
At refinement iteration 3 (OVERLAPS) 13/238 variables, 1/14 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/14 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
At refinement iteration 5 (OVERLAPS) 2774/3012 variables, 238/252 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3012 variables, 235/487 constraints. Problems are: Problem set: 736 solved, 2161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3012/3012 variables, and 2648 constraints, problems are : Problem set: 736 solved, 2161 unsolved in 34945 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 2161/2897 constraints, Known Traps: 6/6 constraints]
After SMT, in 97196ms problems are : Problem set: 736 solved, 2161 unsolved
Search for dead transitions found 736 dead transitions in 97225ms
Found 736 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 736 transitions
Dead transitions reduction (with SMT) removed 736 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 238/238 places, 2162/2898 transitions.
Graph (complete) has 2750 edges and 238 vertex of which 225 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Reduce places removed 19 places and 453 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 206 transition count 1709
Reduce places removed 14 places and 253 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 34 place count 192 transition count 1456
Reduce places removed 9 places and 116 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 43 place count 183 transition count 1340
Reduce places removed 6 places and 45 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 49 place count 177 transition count 1295
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 51 place count 175 transition count 1243
Reduce places removed 1 places and 19 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 52 place count 174 transition count 1224
Reduce places removed 1 places and 7 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 53 place count 173 transition count 1217
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 74 place count 152 transition count 1053
Iterating global reduction 7 with 21 rules applied. Total rules applied 95 place count 152 transition count 1053
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 106 place count 141 transition count 987
Iterating global reduction 7 with 11 rules applied. Total rules applied 117 place count 141 transition count 987
Applied a total of 117 rules in 38 ms. Remains 141 /238 variables (removed 97) and now considering 987/2162 (removed 1175) transitions.
[2024-06-01 06:45:18] [INFO ] Flow matrix only has 873 transitions (discarded 114 similar events)
// Phase 1: matrix 873 rows 141 cols
[2024-06-01 06:45:18] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 06:45:18] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 06:45:18] [INFO ] Flow matrix only has 873 transitions (discarded 114 similar events)
[2024-06-01 06:45:18] [INFO ] Invariant cache hit.
[2024-06-01 06:45:18] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-06-01 06:45:18] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 141/238 places, 987/2898 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 99781 ms. Remains : 141/238 places, 987/2898 transitions.
RANDOM walk for 4000000 steps (8 resets) in 9905 ms. (403 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (13 resets) in 4727 ms. (846 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1369898 steps, run timeout after 9001 ms. (steps per millisecond=152 ) properties seen :0 out of 1
Probabilistic random walk after 1369898 steps, saw 771702 distinct states, run finished after 9001 ms. (steps per millisecond=152 ) properties seen :0
[2024-06-01 06:45:31] [INFO ] Flow matrix only has 873 transitions (discarded 114 similar events)
[2024-06-01 06:45:31] [INFO ] Invariant cache hit.
[2024-06-01 06:45:31] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 337/352 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 35/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/356 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 362/718 variables, 57/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/718 variables, 31/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/718 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 260/978 variables, 41/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/978 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/978 variables, 27/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/978 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/980 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 34/1014 variables, 25/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1014 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1014 variables, 10/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1014 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1014 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 252 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 337/352 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 35/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/356 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 362/718 variables, 57/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/718 variables, 31/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/718 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/718 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 260/978 variables, 41/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/978 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/978 variables, 27/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:45:32] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2024-06-01 06:45:32] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/978 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/978 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/980 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 34/1014 variables, 25/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1014 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1014 variables, 10/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:45:32] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
[2024-06-01 06:45:32] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1014 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1014 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1014 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1307ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 987/987 transitions.
Applied a total of 0 rules in 12 ms. Remains 141 /141 variables (removed 0) and now considering 987/987 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 141/141 places, 987/987 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 987/987 transitions.
Applied a total of 0 rules in 11 ms. Remains 141 /141 variables (removed 0) and now considering 987/987 (removed 0) transitions.
[2024-06-01 06:45:33] [INFO ] Flow matrix only has 873 transitions (discarded 114 similar events)
[2024-06-01 06:45:33] [INFO ] Invariant cache hit.
[2024-06-01 06:45:33] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-06-01 06:45:33] [INFO ] Flow matrix only has 873 transitions (discarded 114 similar events)
[2024-06-01 06:45:33] [INFO ] Invariant cache hit.
[2024-06-01 06:45:33] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-06-01 06:45:33] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2024-06-01 06:45:33] [INFO ] Redundant transitions in 9 ms returned []
Running 986 sub problems to find dead transitions.
[2024-06-01 06:45:33] [INFO ] Flow matrix only has 873 transitions (discarded 114 similar events)
[2024-06-01 06:45:33] [INFO ] Invariant cache hit.
[2024-06-01 06:45:33] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 986 unsolved
[2024-06-01 06:45:39] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
Problem TDEAD980 is UNSAT
Problem TDEAD986 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 984 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 984 unsolved
At refinement iteration 3 (OVERLAPS) 873/1014 variables, 141/149 constraints. Problems are: Problem set: 2 solved, 984 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1014 variables, 104/253 constraints. Problems are: Problem set: 2 solved, 984 unsolved
[2024-06-01 06:45:59] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:45:59] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 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 TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 2/255 constraints. Problems are: Problem set: 130 solved, 856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 255 constraints, problems are : Problem set: 130 solved, 856 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 986/986 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 130 solved, 856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 7/7 constraints. Problems are: Problem set: 130 solved, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 3/10 constraints. Problems are: Problem set: 130 solved, 856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/10 constraints. Problems are: Problem set: 130 solved, 856 unsolved
At refinement iteration 3 (OVERLAPS) 873/1014 variables, 141/151 constraints. Problems are: Problem set: 130 solved, 856 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1014 variables, 104/255 constraints. Problems are: Problem set: 130 solved, 856 unsolved
Problem TDEAD433 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
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 TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 856/1111 constraints. Problems are: Problem set: 244 solved, 742 unsolved
[2024-06-01 06:46:32] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 1112 constraints, problems are : Problem set: 244 solved, 742 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 856/986 constraints, Known Traps: 4/4 constraints]
After SMT, in 63328ms problems are : Problem set: 244 solved, 742 unsolved
Search for dead transitions found 244 dead transitions in 63340ms
Found 244 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 244 transitions
Dead transitions reduction (with SMT) removed 244 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 141/141 places, 743/987 transitions.
Graph (complete) has 1046 edges and 141 vertex of which 136 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 20 places and 260 transitions.
Graph (complete) has 716 edges and 116 vertex of which 1 are kept as prefixes of interest. Removing 115 places using SCC suffix rule.0 ms
Discarding 115 places :
Also discarding 483 output transitions
Drop transitions (Output transitions of discarded places.) removed 483 transitions
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 1 transition count 0
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 22 rules in 4 ms. Remains 1 /141 variables (removed 140) and now considering 0/743 (removed 743) transitions.
[2024-06-01 06:46:37] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 06:46:37] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 06:46:37] [INFO ] Invariant cache hit.
[2024-06-01 06:46:37] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/141 places, 0/987 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64155 ms. Remains : 1/141 places, 0/987 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q8m004-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 2923/2923 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 246 transition count 2900
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 246 transition count 2900
Applied a total of 2 rules in 24 ms. Remains 246 /247 variables (removed 1) and now considering 2900/2923 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 246/247 places, 2900/2923 transitions.
[2024-06-01 06:46:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 06:46:37] [INFO ] Flatten gal took : 131 ms
FORMULA BugTracking-PT-q8m004-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:46:37] [INFO ] Flatten gal took : 147 ms
[2024-06-01 06:46:37] [INFO ] Input system was already deterministic with 2900 transitions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 2923/2923 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 246 transition count 2900
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 246 transition count 2900
Applied a total of 2 rules in 16 ms. Remains 246 /247 variables (removed 1) and now considering 2900/2923 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 246/247 places, 2900/2923 transitions.
[2024-06-01 06:46:37] [INFO ] Flatten gal took : 94 ms
[2024-06-01 06:46:37] [INFO ] Flatten gal took : 102 ms
[2024-06-01 06:46:38] [INFO ] Input system was already deterministic with 2900 transitions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 2923/2923 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 246 transition count 2900
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 246 transition count 2900
Applied a total of 2 rules in 14 ms. Remains 246 /247 variables (removed 1) and now considering 2900/2923 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 246/247 places, 2900/2923 transitions.
[2024-06-01 06:46:38] [INFO ] Flatten gal took : 96 ms
[2024-06-01 06:46:38] [INFO ] Flatten gal took : 107 ms
[2024-06-01 06:46:38] [INFO ] Input system was already deterministic with 2900 transitions.
[2024-06-01 06:46:38] [INFO ] Flatten gal took : 102 ms
[2024-06-01 06:46:38] [INFO ] Flatten gal took : 104 ms
[2024-06-01 06:46:38] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 06:46:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 247 places, 2923 transitions and 14324 arcs took 54 ms.
Total runtime 453024 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : BugTracking-PT-q8m004-CTLCardinality-2024-00
Could not compute solution for formula : BugTracking-PT-q8m004-CTLCardinality-2024-03
Could not compute solution for formula : BugTracking-PT-q8m004-CTLCardinality-2024-04
Could not compute solution for formula : BugTracking-PT-q8m004-CTLCardinality-2024-07
Could not compute solution for formula : BugTracking-PT-q8m004-CTLCardinality-2023-13
BK_STOP 1717224399205
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BugTracking-PT-q8m004-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/836/ctl_0_
ctl formula name BugTracking-PT-q8m004-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/836/ctl_1_
ctl formula name BugTracking-PT-q8m004-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/836/ctl_2_
ctl formula name BugTracking-PT-q8m004-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/836/ctl_3_
ctl formula name BugTracking-PT-q8m004-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/836/ctl_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m004"
export BK_EXAMINATION="CTLCardinality"
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-q8m004, examination is CTLCardinality"
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-171620399400393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m004.tgz
mv BugTracking-PT-q8m004 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;