About the Execution of LTSMin+red for Anderson-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1377.168 | 1568081.00 | 3046704.00 | 3313.40 | FFTF?FTF???FFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r464-smll-171620118400356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Anderson-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400356
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 927K 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 Anderson-PT-09-LTLFireability-00
FORMULA_NAME Anderson-PT-09-LTLFireability-01
FORMULA_NAME Anderson-PT-09-LTLFireability-02
FORMULA_NAME Anderson-PT-09-LTLFireability-03
FORMULA_NAME Anderson-PT-09-LTLFireability-04
FORMULA_NAME Anderson-PT-09-LTLFireability-05
FORMULA_NAME Anderson-PT-09-LTLFireability-06
FORMULA_NAME Anderson-PT-09-LTLFireability-07
FORMULA_NAME Anderson-PT-09-LTLFireability-08
FORMULA_NAME Anderson-PT-09-LTLFireability-09
FORMULA_NAME Anderson-PT-09-LTLFireability-10
FORMULA_NAME Anderson-PT-09-LTLFireability-11
FORMULA_NAME Anderson-PT-09-LTLFireability-12
FORMULA_NAME Anderson-PT-09-LTLFireability-13
FORMULA_NAME Anderson-PT-09-LTLFireability-14
FORMULA_NAME Anderson-PT-09-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717257670970
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:01:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:01:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:01:14] [INFO ] Load time of PNML (sax parser for PT used): 391 ms
[2024-06-01 16:01:14] [INFO ] Transformed 505 places.
[2024-06-01 16:01:14] [INFO ] Transformed 1845 transitions.
[2024-06-01 16:01:14] [INFO ] Found NUPN structural information;
[2024-06-01 16:01:14] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 734 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Anderson-PT-09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 125 places :
Symmetric choice reduction at 0 with 125 rule applications. Total rules 125 place count 380 transition count 840
Iterating global reduction 0 with 125 rules applied. Total rules applied 250 place count 380 transition count 840
Applied a total of 250 rules in 175 ms. Remains 380 /505 variables (removed 125) and now considering 840/1845 (removed 1005) transitions.
// Phase 1: matrix 840 rows 380 cols
[2024-06-01 16:01:14] [INFO ] Computed 21 invariants in 83 ms
[2024-06-01 16:01:15] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2024-06-01 16:01:15] [INFO ] Invariant cache hit.
[2024-06-01 16:01:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:01:19] [INFO ] Implicit Places using invariants and state equation in 3427 ms returned []
Implicit Place search using SMT with State Equation took 4551 ms to find 0 implicit places.
Running 831 sub problems to find dead transitions.
[2024-06-01 16:01:19] [INFO ] Invariant cache hit.
[2024-06-01 16:01:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 831 unsolved
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 84 places in 661 ms of which 68 ms to minimize.
[2024-06-01 16:01:34] [INFO ] Deduced a trap composed of 129 places in 614 ms of which 8 ms to minimize.
[2024-06-01 16:01:34] [INFO ] Deduced a trap composed of 155 places in 451 ms of which 7 ms to minimize.
[2024-06-01 16:01:35] [INFO ] Deduced a trap composed of 87 places in 445 ms of which 5 ms to minimize.
[2024-06-01 16:01:35] [INFO ] Deduced a trap composed of 223 places in 332 ms of which 5 ms to minimize.
[2024-06-01 16:01:36] [INFO ] Deduced a trap composed of 145 places in 359 ms of which 6 ms to minimize.
[2024-06-01 16:01:36] [INFO ] Deduced a trap composed of 161 places in 450 ms of which 5 ms to minimize.
[2024-06-01 16:01:37] [INFO ] Deduced a trap composed of 92 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:01:37] [INFO ] Deduced a trap composed of 126 places in 429 ms of which 4 ms to minimize.
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 93 places in 467 ms of which 9 ms to minimize.
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 124 places in 496 ms of which 7 ms to minimize.
[2024-06-01 16:01:39] [INFO ] Deduced a trap composed of 86 places in 400 ms of which 5 ms to minimize.
[2024-06-01 16:01:39] [INFO ] Deduced a trap composed of 222 places in 538 ms of which 6 ms to minimize.
[2024-06-01 16:01:40] [INFO ] Deduced a trap composed of 167 places in 502 ms of which 6 ms to minimize.
[2024-06-01 16:01:40] [INFO ] Deduced a trap composed of 62 places in 533 ms of which 7 ms to minimize.
[2024-06-01 16:01:41] [INFO ] Deduced a trap composed of 162 places in 526 ms of which 6 ms to minimize.
[2024-06-01 16:01:41] [INFO ] Deduced a trap composed of 197 places in 455 ms of which 6 ms to minimize.
[2024-06-01 16:01:42] [INFO ] Deduced a trap composed of 142 places in 523 ms of which 6 ms to minimize.
[2024-06-01 16:01:43] [INFO ] Deduced a trap composed of 118 places in 508 ms of which 6 ms to minimize.
[2024-06-01 16:01:43] [INFO ] Deduced a trap composed of 111 places in 490 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 831 unsolved
[2024-06-01 16:01:45] [INFO ] Deduced a trap composed of 84 places in 486 ms of which 6 ms to minimize.
[2024-06-01 16:01:46] [INFO ] Deduced a trap composed of 177 places in 491 ms of which 6 ms to minimize.
[2024-06-01 16:01:46] [INFO ] Deduced a trap composed of 77 places in 495 ms of which 6 ms to minimize.
[2024-06-01 16:01:47] [INFO ] Deduced a trap composed of 140 places in 538 ms of which 7 ms to minimize.
[2024-06-01 16:01:47] [INFO ] Deduced a trap composed of 74 places in 548 ms of which 6 ms to minimize.
[2024-06-01 16:01:48] [INFO ] Deduced a trap composed of 135 places in 502 ms of which 7 ms to minimize.
[2024-06-01 16:01:49] [INFO ] Deduced a trap composed of 75 places in 504 ms of which 6 ms to minimize.
[2024-06-01 16:01:49] [INFO ] Deduced a trap composed of 176 places in 510 ms of which 6 ms to minimize.
[2024-06-01 16:01:50] [INFO ] Deduced a trap composed of 169 places in 502 ms of which 6 ms to minimize.
[2024-06-01 16:01:51] [INFO ] Deduced a trap composed of 147 places in 517 ms of which 6 ms to minimize.
[2024-06-01 16:01:51] [INFO ] Deduced a trap composed of 160 places in 450 ms of which 6 ms to minimize.
SMT process timed out in 32055ms, After SMT, problems are : Problem set: 0 solved, 831 unsolved
Search for dead transitions found 0 dead transitions in 32149ms
Starting structural reductions in LTL mode, iteration 1 : 380/505 places, 840/1845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36938 ms. Remains : 380/505 places, 840/1845 transitions.
Support contains 48 out of 380 places after structural reductions.
[2024-06-01 16:01:52] [INFO ] Flatten gal took : 202 ms
[2024-06-01 16:01:52] [INFO ] Flatten gal took : 128 ms
[2024-06-01 16:01:52] [INFO ] Input system was already deterministic with 840 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (8 resets) in 2925 ms. (13 steps per ms) remains 12/28 properties
BEST_FIRST walk for 40002 steps (8 resets) in 244 ms. (163 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
[2024-06-01 16:01:53] [INFO ] Invariant cache hit.
[2024-06-01 16:01:53] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 236/248 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 118/366 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 14/380 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 16:01:54] [INFO ] Deduced a trap composed of 152 places in 492 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 16:01:55] [INFO ] Deduced a trap composed of 191 places in 520 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 840/1220 variables, 380/403 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1220 variables, 72/475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1220 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1220 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 475 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2864 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 380/380 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 236/248 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 118/366 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 14/380 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 840/1220 variables, 380/403 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1220 variables, 72/475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1220 variables, 5/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1220 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1220 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 480 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3773 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 380/380 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 6705ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 4249 ms.
Support contains 12 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 380 transition count 769
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 309 transition count 769
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 156 place count 295 transition count 563
Iterating global reduction 0 with 14 rules applied. Total rules applied 170 place count 295 transition count 563
Applied a total of 170 rules in 107 ms. Remains 295 /380 variables (removed 85) and now considering 563/840 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 295/380 places, 563/840 transitions.
RANDOM walk for 40000 steps (8 resets) in 291 ms. (136 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 280 ms. (142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
// Phase 1: matrix 563 rows 295 cols
[2024-06-01 16:02:05] [INFO ] Computed 21 invariants in 13 ms
[2024-06-01 16:02:05] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 271/281 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/286 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 9/295 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 563/858 variables, 295/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/858 variables, 72/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/858 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/858 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 858/858 variables, and 388 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 295/295 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 271/281 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/286 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 9/295 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:02:06] [INFO ] Deduced a trap composed of 188 places in 330 ms of which 5 ms to minimize.
[2024-06-01 16:02:07] [INFO ] Deduced a trap composed of 140 places in 328 ms of which 6 ms to minimize.
[2024-06-01 16:02:07] [INFO ] Deduced a trap composed of 96 places in 410 ms of which 5 ms to minimize.
[2024-06-01 16:02:08] [INFO ] Deduced a trap composed of 180 places in 410 ms of which 6 ms to minimize.
[2024-06-01 16:02:08] [INFO ] Deduced a trap composed of 181 places in 419 ms of which 6 ms to minimize.
[2024-06-01 16:02:08] [INFO ] Deduced a trap composed of 102 places in 367 ms of which 7 ms to minimize.
[2024-06-01 16:02:09] [INFO ] Deduced a trap composed of 121 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:02:09] [INFO ] Deduced a trap composed of 130 places in 333 ms of which 6 ms to minimize.
[2024-06-01 16:02:09] [INFO ] Deduced a trap composed of 91 places in 362 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 563/858 variables, 295/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/858 variables, 72/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/858 variables, 4/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/858 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/858 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 858/858 variables, and 401 constraints, problems are : Problem set: 0 solved, 4 unsolved in 30993 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 295/295 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 32076ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1476 ms.
Support contains 10 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 563/563 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 294 transition count 546
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 294 transition count 546
Applied a total of 2 rules in 42 ms. Remains 294 /295 variables (removed 1) and now considering 546/563 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 294/295 places, 546/563 transitions.
RANDOM walk for 40000 steps (8 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
// Phase 1: matrix 546 rows 294 cols
[2024-06-01 16:02:39] [INFO ] Computed 21 invariants in 10 ms
[2024-06-01 16:02:39] [INFO ] State equation strengthened by 72 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 273/279 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/285 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/294 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 546/840 variables, 294/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 72/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/840 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 387 constraints, problems are : Problem set: 0 solved, 2 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 294/294 constraints, ReadFeed: 72/72 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 273/279 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/285 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/294 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 58 places in 243 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 79 places in 330 ms of which 5 ms to minimize.
[2024-06-01 16:02:41] [INFO ] Deduced a trap composed of 111 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:02:41] [INFO ] Deduced a trap composed of 182 places in 403 ms of which 5 ms to minimize.
[2024-06-01 16:02:41] [INFO ] Deduced a trap composed of 153 places in 368 ms of which 5 ms to minimize.
[2024-06-01 16:02:42] [INFO ] Deduced a trap composed of 149 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:02:42] [INFO ] Deduced a trap composed of 92 places in 321 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:02:42] [INFO ] Deduced a trap composed of 117 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 128 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 105 places in 327 ms of which 4 ms to minimize.
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 69 places in 398 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 546/840 variables, 294/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/840 variables, 72/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/840 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/840 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/840 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 24603 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 294/294 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 25202ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 494 ms.
Support contains 6 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 546/546 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 292 transition count 512
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 292 transition count 512
Applied a total of 4 rules in 48 ms. Remains 292 /294 variables (removed 2) and now considering 512/546 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 292/294 places, 512/546 transitions.
RANDOM walk for 40000 steps (8 resets) in 262 ms. (152 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 752512 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :1 out of 2
Probabilistic random walk after 752512 steps, saw 529913 distinct states, run finished after 3017 ms. (steps per millisecond=249 ) properties seen :1
// Phase 1: matrix 512 rows 292 cols
[2024-06-01 16:03:08] [INFO ] Computed 21 invariants in 6 ms
[2024-06-01 16:03:08] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 263/265 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/282 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/292 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 512/804 variables, 292/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/804 variables, 72/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/804 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/804 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 804/804 variables, and 385 constraints, problems are : Problem set: 0 solved, 1 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 292/292 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 263/265 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/282 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/292 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 512/804 variables, 292/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/804 variables, 72/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/804 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/804 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/804 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 804/804 variables, and 386 constraints, problems are : Problem set: 0 solved, 1 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 292/292 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1197ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 512/512 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 292 transition count 511
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 291 transition count 511
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 290 transition count 494
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 290 transition count 494
Applied a total of 4 rules in 44 ms. Remains 290 /292 variables (removed 2) and now considering 494/512 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 290/292 places, 494/512 transitions.
RANDOM walk for 40000 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1001761 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :0 out of 1
Probabilistic random walk after 1001761 steps, saw 705577 distinct states, run finished after 3001 ms. (steps per millisecond=333 ) properties seen :0
// Phase 1: matrix 494 rows 290 cols
[2024-06-01 16:03:12] [INFO ] Computed 21 invariants in 11 ms
[2024-06-01 16:03:12] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 261/263 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/280 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/290 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 494/784 variables, 290/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 72/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/784 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 383 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 290/290 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 261/263 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/280 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/290 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 494/784 variables, 290/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 72/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/784 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 784/784 variables, and 384 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 290/290 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 890ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 494/494 transitions.
Applied a total of 0 rules in 27 ms. Remains 290 /290 variables (removed 0) and now considering 494/494 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 290/290 places, 494/494 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 494/494 transitions.
Applied a total of 0 rules in 14 ms. Remains 290 /290 variables (removed 0) and now considering 494/494 (removed 0) transitions.
[2024-06-01 16:03:13] [INFO ] Invariant cache hit.
[2024-06-01 16:03:14] [INFO ] Implicit Places using invariants in 709 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 712 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 289/290 places, 494/494 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 289 transition count 414
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 209 transition count 414
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 209 transition count 413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 208 transition count 413
Applied a total of 162 rules in 29 ms. Remains 208 /289 variables (removed 81) and now considering 413/494 (removed 81) transitions.
// Phase 1: matrix 413 rows 208 cols
[2024-06-01 16:03:14] [INFO ] Computed 20 invariants in 5 ms
[2024-06-01 16:03:14] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-01 16:03:14] [INFO ] Invariant cache hit.
[2024-06-01 16:03:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:03:15] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1451 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/290 places, 413/494 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2211 ms. Remains : 208/290 places, 413/494 transitions.
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1103306 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :0 out of 1
Probabilistic random walk after 1103306 steps, saw 745583 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) properties seen :0
[2024-06-01 16:03:18] [INFO ] Invariant cache hit.
[2024-06-01 16:03:18] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 180/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/190 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/208 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 413/621 variables, 208/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/621 variables, 72/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/621 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/621 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 621/621 variables, and 300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 180/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/190 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/208 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 413/621 variables, 208/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/621 variables, 72/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/621 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/621 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 621/621 variables, and 301 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 501ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 413/413 transitions.
Applied a total of 0 rules in 9 ms. Remains 208 /208 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 208/208 places, 413/413 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 413/413 transitions.
Applied a total of 0 rules in 9 ms. Remains 208 /208 variables (removed 0) and now considering 413/413 (removed 0) transitions.
[2024-06-01 16:03:19] [INFO ] Invariant cache hit.
[2024-06-01 16:03:19] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-06-01 16:03:19] [INFO ] Invariant cache hit.
[2024-06-01 16:03:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:03:20] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1509 ms to find 0 implicit places.
[2024-06-01 16:03:20] [INFO ] Redundant transitions in 43 ms returned []
Running 404 sub problems to find dead transitions.
[2024-06-01 16:03:20] [INFO ] Invariant cache hit.
[2024-06-01 16:03:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-06-01 16:03:26] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:03:26] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:03:26] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:03:26] [INFO ] Deduced a trap composed of 91 places in 197 ms of which 6 ms to minimize.
[2024-06-01 16:03:27] [INFO ] Deduced a trap composed of 88 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:03:27] [INFO ] Deduced a trap composed of 109 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:03:28] [INFO ] Deduced a trap composed of 109 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:03:28] [INFO ] Deduced a trap composed of 88 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:03:28] [INFO ] Deduced a trap composed of 100 places in 237 ms of which 2 ms to minimize.
[2024-06-01 16:03:28] [INFO ] Deduced a trap composed of 86 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:03:29] [INFO ] Deduced a trap composed of 83 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:03:29] [INFO ] Deduced a trap composed of 98 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:03:29] [INFO ] Deduced a trap composed of 88 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:03:29] [INFO ] Deduced a trap composed of 79 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:03:30] [INFO ] Deduced a trap composed of 74 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:03:30] [INFO ] Deduced a trap composed of 78 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:03:30] [INFO ] Deduced a trap composed of 71 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:03:31] [INFO ] Deduced a trap composed of 102 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:03:31] [INFO ] Deduced a trap composed of 76 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:03:31] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-06-01 16:03:33] [INFO ] Deduced a trap composed of 85 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:03:34] [INFO ] Deduced a trap composed of 49 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:03:34] [INFO ] Deduced a trap composed of 95 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:03:34] [INFO ] Deduced a trap composed of 94 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:03:35] [INFO ] Deduced a trap composed of 81 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:03:35] [INFO ] Deduced a trap composed of 90 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:03:35] [INFO ] Deduced a trap composed of 96 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:03:35] [INFO ] Deduced a trap composed of 94 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:03:36] [INFO ] Deduced a trap composed of 78 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:03:36] [INFO ] Deduced a trap composed of 96 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:03:36] [INFO ] Deduced a trap composed of 82 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:03:36] [INFO ] Deduced a trap composed of 122 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:03:37] [INFO ] Deduced a trap composed of 84 places in 297 ms of which 3 ms to minimize.
[2024-06-01 16:03:37] [INFO ] Deduced a trap composed of 85 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:03:37] [INFO ] Deduced a trap composed of 94 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:03:38] [INFO ] Deduced a trap composed of 104 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:03:38] [INFO ] Deduced a trap composed of 99 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:03:38] [INFO ] Deduced a trap composed of 102 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:03:38] [INFO ] Deduced a trap composed of 98 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:03:39] [INFO ] Deduced a trap composed of 98 places in 269 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-06-01 16:03:45] [INFO ] Deduced a trap composed of 97 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:03:45] [INFO ] Deduced a trap composed of 49 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:03:45] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:03:45] [INFO ] Deduced a trap composed of 84 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:03:46] [INFO ] Deduced a trap composed of 75 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:03:46] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:03:46] [INFO ] Deduced a trap composed of 108 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:03:47] [INFO ] Deduced a trap composed of 85 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:03:47] [INFO ] Deduced a trap composed of 86 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:03:47] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:03:47] [INFO ] Deduced a trap composed of 81 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:03:48] [INFO ] Deduced a trap composed of 89 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:03:48] [INFO ] Deduced a trap composed of 49 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:03:48] [INFO ] Deduced a trap composed of 90 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:03:49] [INFO ] Deduced a trap composed of 86 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:03:49] [INFO ] Deduced a trap composed of 56 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:03:49] [INFO ] Deduced a trap composed of 93 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:03:49] [INFO ] Deduced a trap composed of 87 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:03:50] [INFO ] Deduced a trap composed of 54 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:03:50] [INFO ] Deduced a trap composed of 82 places in 251 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/621 variables, and 80 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/208 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 60/80 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 208/621 variables, and 80 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/208 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/404 constraints, Known Traps: 60/60 constraints]
After SMT, in 60570ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 60578ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62153 ms. Remains : 208/208 places, 413/413 transitions.
FORMULA Anderson-PT-09-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 380 transition count 768
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 308 transition count 768
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 162 place count 290 transition count 494
Iterating global reduction 0 with 18 rules applied. Total rules applied 180 place count 290 transition count 494
Applied a total of 180 rules in 57 ms. Remains 290 /380 variables (removed 90) and now considering 494/840 (removed 346) transitions.
// Phase 1: matrix 494 rows 290 cols
[2024-06-01 16:04:21] [INFO ] Computed 21 invariants in 6 ms
[2024-06-01 16:04:22] [INFO ] Implicit Places using invariants in 809 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 823 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/380 places, 494/840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 289 transition count 432
Reduce places removed 62 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 71 rules applied. Total rules applied 133 place count 227 transition count 423
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 142 place count 218 transition count 423
Applied a total of 142 rules in 30 ms. Remains 218 /289 variables (removed 71) and now considering 423/494 (removed 71) transitions.
// Phase 1: matrix 423 rows 218 cols
[2024-06-01 16:04:22] [INFO ] Computed 20 invariants in 11 ms
[2024-06-01 16:04:23] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-06-01 16:04:23] [INFO ] Invariant cache hit.
[2024-06-01 16:04:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:04:24] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 218/380 places, 423/840 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2537 ms. Remains : 218/380 places, 423/840 transitions.
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 730 ms.
Stack based approach found an accepted trace after 518 steps with 0 reset with depth 519 and stack size 424 in 2 ms.
FORMULA Anderson-PT-09-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-03 finished in 3767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 380 transition count 768
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 308 transition count 768
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 161 place count 291 transition count 511
Iterating global reduction 0 with 17 rules applied. Total rules applied 178 place count 291 transition count 511
Applied a total of 178 rules in 29 ms. Remains 291 /380 variables (removed 89) and now considering 511/840 (removed 329) transitions.
// Phase 1: matrix 511 rows 291 cols
[2024-06-01 16:04:25] [INFO ] Computed 21 invariants in 7 ms
[2024-06-01 16:04:26] [INFO ] Implicit Places using invariants in 582 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 583 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 290/380 places, 511/840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 290 transition count 432
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 211 transition count 432
Applied a total of 158 rules in 14 ms. Remains 211 /290 variables (removed 79) and now considering 432/511 (removed 79) transitions.
// Phase 1: matrix 432 rows 211 cols
[2024-06-01 16:04:26] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 16:04:26] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-06-01 16:04:26] [INFO ] Invariant cache hit.
[2024-06-01 16:04:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:04:27] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 1683 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 211/380 places, 432/840 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2309 ms. Remains : 211/380 places, 432/840 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 345 ms.
Product exploration explored 100000 steps with 0 reset in 578 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 11787 steps (1 resets) in 64 ms. (181 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 7 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2024-06-01 16:04:29] [INFO ] Invariant cache hit.
[2024-06-01 16:04:29] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-06-01 16:04:29] [INFO ] Invariant cache hit.
[2024-06-01 16:04:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:04:30] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
[2024-06-01 16:04:30] [INFO ] Redundant transitions in 13 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-01 16:04:30] [INFO ] Invariant cache hit.
[2024-06-01 16:04:30] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:04:35] [INFO ] Deduced a trap composed of 82 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:04:35] [INFO ] Deduced a trap composed of 60 places in 303 ms of which 4 ms to minimize.
[2024-06-01 16:04:36] [INFO ] Deduced a trap composed of 72 places in 356 ms of which 4 ms to minimize.
[2024-06-01 16:04:36] [INFO ] Deduced a trap composed of 78 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:04:36] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:04:37] [INFO ] Deduced a trap composed of 49 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:04:38] [INFO ] Deduced a trap composed of 79 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:04:38] [INFO ] Deduced a trap composed of 78 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:04:38] [INFO ] Deduced a trap composed of 82 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:04:39] [INFO ] Deduced a trap composed of 86 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:04:39] [INFO ] Deduced a trap composed of 74 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:04:39] [INFO ] Deduced a trap composed of 53 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:04:39] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:04:40] [INFO ] Deduced a trap composed of 80 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:04:40] [INFO ] Deduced a trap composed of 75 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:04:40] [INFO ] Deduced a trap composed of 69 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:04:41] [INFO ] Deduced a trap composed of 59 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:04:41] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:04:41] [INFO ] Deduced a trap composed of 55 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:04:42] [INFO ] Deduced a trap composed of 80 places in 260 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:04:44] [INFO ] Deduced a trap composed of 70 places in 207 ms of which 4 ms to minimize.
[2024-06-01 16:04:44] [INFO ] Deduced a trap composed of 73 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 73 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 84 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 67 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 73 places in 291 ms of which 3 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 58 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 56 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 80 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 59 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 78 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 84 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 73 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 59 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 110 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:04:49] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:04:49] [INFO ] Deduced a trap composed of 56 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:04:49] [INFO ] Deduced a trap composed of 56 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:04:49] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:04:50] [INFO ] Deduced a trap composed of 89 places in 259 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 76 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 53 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 55 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:04:56] [INFO ] Deduced a trap composed of 49 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:04:58] [INFO ] Deduced a trap composed of 45 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:04:58] [INFO ] Deduced a trap composed of 68 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:04:58] [INFO ] Deduced a trap composed of 77 places in 260 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 211/643 variables, and 67 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/211 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 47/67 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 211/643 variables, and 67 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/211 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/423 constraints, Known Traps: 47/47 constraints]
After SMT, in 60491ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60497ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61845 ms. Remains : 211/211 places, 432/432 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3304 steps (0 resets) in 10 ms. (300 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 261 ms.
Product exploration explored 100000 steps with 0 reset in 463 ms.
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 13 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2024-06-01 16:05:32] [INFO ] Invariant cache hit.
[2024-06-01 16:05:33] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-06-01 16:05:33] [INFO ] Invariant cache hit.
[2024-06-01 16:05:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:05:33] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
[2024-06-01 16:05:33] [INFO ] Redundant transitions in 5 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-01 16:05:33] [INFO ] Invariant cache hit.
[2024-06-01 16:05:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:05:37] [INFO ] Deduced a trap composed of 82 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:05:38] [INFO ] Deduced a trap composed of 60 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:05:39] [INFO ] Deduced a trap composed of 72 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:05:39] [INFO ] Deduced a trap composed of 78 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:05:39] [INFO ] Deduced a trap composed of 36 places in 313 ms of which 4 ms to minimize.
[2024-06-01 16:05:40] [INFO ] Deduced a trap composed of 49 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:05:41] [INFO ] Deduced a trap composed of 79 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:05:41] [INFO ] Deduced a trap composed of 78 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:05:41] [INFO ] Deduced a trap composed of 82 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:05:41] [INFO ] Deduced a trap composed of 86 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:05:42] [INFO ] Deduced a trap composed of 74 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:05:42] [INFO ] Deduced a trap composed of 53 places in 279 ms of which 3 ms to minimize.
[2024-06-01 16:05:42] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 80 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 75 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 69 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 59 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 55 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 80 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:05:47] [INFO ] Deduced a trap composed of 70 places in 277 ms of which 3 ms to minimize.
[2024-06-01 16:05:47] [INFO ] Deduced a trap composed of 73 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:05:47] [INFO ] Deduced a trap composed of 73 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:05:48] [INFO ] Deduced a trap composed of 84 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:05:48] [INFO ] Deduced a trap composed of 67 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:05:48] [INFO ] Deduced a trap composed of 73 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:05:49] [INFO ] Deduced a trap composed of 58 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:05:49] [INFO ] Deduced a trap composed of 56 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:05:49] [INFO ] Deduced a trap composed of 80 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:05:49] [INFO ] Deduced a trap composed of 59 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:05:50] [INFO ] Deduced a trap composed of 78 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:05:50] [INFO ] Deduced a trap composed of 84 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:05:50] [INFO ] Deduced a trap composed of 73 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:05:51] [INFO ] Deduced a trap composed of 59 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:05:51] [INFO ] Deduced a trap composed of 110 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:05:52] [INFO ] Deduced a trap composed of 52 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:05:52] [INFO ] Deduced a trap composed of 56 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:05:52] [INFO ] Deduced a trap composed of 56 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:05:52] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 3 ms to minimize.
[2024-06-01 16:05:53] [INFO ] Deduced a trap composed of 89 places in 262 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:05:58] [INFO ] Deduced a trap composed of 76 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:05:58] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 4 ms to minimize.
[2024-06-01 16:05:58] [INFO ] Deduced a trap composed of 55 places in 282 ms of which 6 ms to minimize.
[2024-06-01 16:05:59] [INFO ] Deduced a trap composed of 49 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:06:01] [INFO ] Deduced a trap composed of 45 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:06:01] [INFO ] Deduced a trap composed of 68 places in 259 ms of which 5 ms to minimize.
[2024-06-01 16:06:01] [INFO ] Deduced a trap composed of 77 places in 269 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 211/643 variables, and 67 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/211 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 47/67 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:06:12] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 211/643 variables, and 68 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/211 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/423 constraints, Known Traps: 48/48 constraints]
After SMT, in 60333ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60338ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61640 ms. Remains : 211/211 places, 432/432 transitions.
Treatment of property Anderson-PT-09-LTLFireability-04 finished in 129095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p0) U p1)&&F(p2)))))'
Support contains 6 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 363 transition count 583
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 363 transition count 583
Applied a total of 34 rules in 26 ms. Remains 363 /380 variables (removed 17) and now considering 583/840 (removed 257) transitions.
// Phase 1: matrix 583 rows 363 cols
[2024-06-01 16:06:34] [INFO ] Computed 21 invariants in 9 ms
[2024-06-01 16:06:35] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-06-01 16:06:35] [INFO ] Invariant cache hit.
[2024-06-01 16:06:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:06:37] [INFO ] Implicit Places using invariants and state equation in 2459 ms returned []
Implicit Place search using SMT with State Equation took 3031 ms to find 0 implicit places.
Running 574 sub problems to find dead transitions.
[2024-06-01 16:06:37] [INFO ] Invariant cache hit.
[2024-06-01 16:06:37] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-01 16:06:46] [INFO ] Deduced a trap composed of 178 places in 450 ms of which 6 ms to minimize.
[2024-06-01 16:06:47] [INFO ] Deduced a trap composed of 209 places in 455 ms of which 6 ms to minimize.
[2024-06-01 16:06:47] [INFO ] Deduced a trap composed of 120 places in 444 ms of which 7 ms to minimize.
[2024-06-01 16:06:49] [INFO ] Deduced a trap composed of 151 places in 448 ms of which 6 ms to minimize.
[2024-06-01 16:06:50] [INFO ] Deduced a trap composed of 93 places in 375 ms of which 3 ms to minimize.
[2024-06-01 16:06:51] [INFO ] Deduced a trap composed of 201 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:06:52] [INFO ] Deduced a trap composed of 219 places in 440 ms of which 6 ms to minimize.
[2024-06-01 16:06:52] [INFO ] Deduced a trap composed of 197 places in 459 ms of which 6 ms to minimize.
[2024-06-01 16:06:53] [INFO ] Deduced a trap composed of 151 places in 401 ms of which 6 ms to minimize.
[2024-06-01 16:06:53] [INFO ] Deduced a trap composed of 160 places in 418 ms of which 6 ms to minimize.
[2024-06-01 16:06:56] [INFO ] Deduced a trap composed of 137 places in 456 ms of which 5 ms to minimize.
[2024-06-01 16:06:56] [INFO ] Deduced a trap composed of 102 places in 433 ms of which 5 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 106 places in 437 ms of which 5 ms to minimize.
[2024-06-01 16:06:58] [INFO ] Deduced a trap composed of 63 places in 463 ms of which 6 ms to minimize.
[2024-06-01 16:06:58] [INFO ] Deduced a trap composed of 63 places in 449 ms of which 6 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 71 places in 485 ms of which 7 ms to minimize.
[2024-06-01 16:07:00] [INFO ] Deduced a trap composed of 154 places in 449 ms of which 6 ms to minimize.
[2024-06-01 16:07:01] [INFO ] Deduced a trap composed of 162 places in 412 ms of which 6 ms to minimize.
[2024-06-01 16:07:01] [INFO ] Deduced a trap composed of 104 places in 460 ms of which 6 ms to minimize.
[2024-06-01 16:07:02] [INFO ] Deduced a trap composed of 105 places in 440 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-01 16:07:04] [INFO ] Deduced a trap composed of 116 places in 435 ms of which 6 ms to minimize.
[2024-06-01 16:07:04] [INFO ] Deduced a trap composed of 197 places in 447 ms of which 6 ms to minimize.
[2024-06-01 16:07:05] [INFO ] Deduced a trap composed of 200 places in 428 ms of which 5 ms to minimize.
[2024-06-01 16:07:05] [INFO ] Deduced a trap composed of 155 places in 426 ms of which 6 ms to minimize.
[2024-06-01 16:07:06] [INFO ] Deduced a trap composed of 110 places in 444 ms of which 6 ms to minimize.
[2024-06-01 16:07:06] [INFO ] Deduced a trap composed of 139 places in 424 ms of which 6 ms to minimize.
[2024-06-01 16:07:07] [INFO ] Deduced a trap composed of 126 places in 444 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/946 variables, and 48 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-01 16:07:12] [INFO ] Deduced a trap composed of 178 places in 417 ms of which 6 ms to minimize.
[2024-06-01 16:07:13] [INFO ] Deduced a trap composed of 203 places in 464 ms of which 6 ms to minimize.
[2024-06-01 16:07:13] [INFO ] Deduced a trap composed of 135 places in 423 ms of which 7 ms to minimize.
[2024-06-01 16:07:14] [INFO ] Deduced a trap composed of 75 places in 420 ms of which 6 ms to minimize.
[2024-06-01 16:07:14] [INFO ] Deduced a trap composed of 136 places in 417 ms of which 6 ms to minimize.
[2024-06-01 16:07:15] [INFO ] Deduced a trap composed of 109 places in 433 ms of which 6 ms to minimize.
[2024-06-01 16:07:15] [INFO ] Deduced a trap composed of 169 places in 439 ms of which 6 ms to minimize.
[2024-06-01 16:07:16] [INFO ] Deduced a trap composed of 195 places in 445 ms of which 6 ms to minimize.
[2024-06-01 16:07:16] [INFO ] Deduced a trap composed of 205 places in 429 ms of which 6 ms to minimize.
[2024-06-01 16:07:17] [INFO ] Deduced a trap composed of 94 places in 425 ms of which 5 ms to minimize.
[2024-06-01 16:07:19] [INFO ] Deduced a trap composed of 153 places in 457 ms of which 6 ms to minimize.
[2024-06-01 16:07:19] [INFO ] Deduced a trap composed of 150 places in 446 ms of which 5 ms to minimize.
[2024-06-01 16:07:20] [INFO ] Deduced a trap composed of 152 places in 448 ms of which 6 ms to minimize.
[2024-06-01 16:07:20] [INFO ] Deduced a trap composed of 146 places in 449 ms of which 6 ms to minimize.
[2024-06-01 16:07:21] [INFO ] Deduced a trap composed of 127 places in 443 ms of which 7 ms to minimize.
[2024-06-01 16:07:21] [INFO ] Deduced a trap composed of 135 places in 415 ms of which 6 ms to minimize.
[2024-06-01 16:07:22] [INFO ] Deduced a trap composed of 130 places in 455 ms of which 6 ms to minimize.
[2024-06-01 16:07:22] [INFO ] Deduced a trap composed of 140 places in 436 ms of which 6 ms to minimize.
[2024-06-01 16:07:23] [INFO ] Deduced a trap composed of 144 places in 412 ms of which 5 ms to minimize.
[2024-06-01 16:07:23] [INFO ] Deduced a trap composed of 115 places in 409 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-01 16:07:26] [INFO ] Deduced a trap composed of 130 places in 341 ms of which 6 ms to minimize.
[2024-06-01 16:07:27] [INFO ] Deduced a trap composed of 152 places in 434 ms of which 6 ms to minimize.
[2024-06-01 16:07:27] [INFO ] Deduced a trap composed of 76 places in 445 ms of which 6 ms to minimize.
[2024-06-01 16:07:32] [INFO ] Deduced a trap composed of 153 places in 461 ms of which 7 ms to minimize.
[2024-06-01 16:07:33] [INFO ] Deduced a trap composed of 157 places in 423 ms of which 5 ms to minimize.
[2024-06-01 16:07:33] [INFO ] Deduced a trap composed of 200 places in 439 ms of which 5 ms to minimize.
[2024-06-01 16:07:34] [INFO ] Deduced a trap composed of 224 places in 479 ms of which 6 ms to minimize.
[2024-06-01 16:07:35] [INFO ] Deduced a trap composed of 183 places in 492 ms of which 6 ms to minimize.
[2024-06-01 16:07:35] [INFO ] Deduced a trap composed of 102 places in 477 ms of which 6 ms to minimize.
[2024-06-01 16:07:36] [INFO ] Deduced a trap composed of 87 places in 453 ms of which 5 ms to minimize.
[2024-06-01 16:07:37] [INFO ] Deduced a trap composed of 188 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:07:38] [INFO ] Deduced a trap composed of 186 places in 346 ms of which 5 ms to minimize.
SMT process timed out in 60797ms, After SMT, problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 60804ms
Starting structural reductions in LTL mode, iteration 1 : 363/380 places, 583/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63863 ms. Remains : 363/380 places, 583/840 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 258 ms.
Stack based approach found an accepted trace after 69 steps with 0 reset with depth 70 and stack size 70 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-05 finished in 64426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)||G(!p1))))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 566
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 566
Applied a total of 36 rules in 14 ms. Remains 362 /380 variables (removed 18) and now considering 566/840 (removed 274) transitions.
// Phase 1: matrix 566 rows 362 cols
[2024-06-01 16:07:39] [INFO ] Computed 21 invariants in 12 ms
[2024-06-01 16:07:39] [INFO ] Implicit Places using invariants in 671 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 673 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 361/380 places, 566/840 transitions.
Applied a total of 0 rules in 8 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 695 ms. Remains : 361/380 places, 566/840 transitions.
Stuttering acceptance computed with spot in 150 ms :[p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 477 ms.
Product exploration explored 100000 steps with 50000 reset in 522 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-06 finished in 1894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 380 transition count 769
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 309 transition count 769
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 159 place count 292 transition count 512
Iterating global reduction 0 with 17 rules applied. Total rules applied 176 place count 292 transition count 512
Applied a total of 176 rules in 58 ms. Remains 292 /380 variables (removed 88) and now considering 512/840 (removed 328) transitions.
// Phase 1: matrix 512 rows 292 cols
[2024-06-01 16:07:41] [INFO ] Computed 21 invariants in 6 ms
[2024-06-01 16:07:41] [INFO ] Implicit Places using invariants in 513 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 517 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/380 places, 512/840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 291 transition count 451
Reduce places removed 61 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 70 rules applied. Total rules applied 131 place count 230 transition count 442
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 140 place count 221 transition count 442
Applied a total of 140 rules in 28 ms. Remains 221 /291 variables (removed 70) and now considering 442/512 (removed 70) transitions.
// Phase 1: matrix 442 rows 221 cols
[2024-06-01 16:07:41] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 16:07:41] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-06-01 16:07:41] [INFO ] Invariant cache hit.
[2024-06-01 16:07:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:07:43] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 221/380 places, 442/840 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2193 ms. Remains : 221/380 places, 442/840 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 315 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 1 ms.
FORMULA Anderson-PT-09-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-07 finished in 2578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((F(p1)||p0)))&&(!p2 U (p3||G(!p2)))))'
Support contains 7 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 380 transition count 768
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 308 transition count 768
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 161 place count 291 transition count 511
Iterating global reduction 0 with 17 rules applied. Total rules applied 178 place count 291 transition count 511
Applied a total of 178 rules in 40 ms. Remains 291 /380 variables (removed 89) and now considering 511/840 (removed 329) transitions.
// Phase 1: matrix 511 rows 291 cols
[2024-06-01 16:07:43] [INFO ] Computed 21 invariants in 7 ms
[2024-06-01 16:07:44] [INFO ] Implicit Places using invariants in 770 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 772 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 290/380 places, 511/840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 290 transition count 432
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 211 transition count 432
Applied a total of 158 rules in 37 ms. Remains 211 /290 variables (removed 79) and now considering 432/511 (removed 79) transitions.
// Phase 1: matrix 432 rows 211 cols
[2024-06-01 16:07:44] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 16:07:44] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-06-01 16:07:44] [INFO ] Invariant cache hit.
[2024-06-01 16:07:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:07:46] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1623 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 211/380 places, 432/840 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2477 ms. Remains : 211/380 places, 432/840 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), true, (AND (NOT p0) (NOT p1)), (AND (NOT p3) p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 269 ms.
Product exploration explored 100000 steps with 0 reset in 319 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p3) p2))), (X p3), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 161 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 625 ms. (63 steps per ms) remains 1/4 properties
BEST_FIRST walk for 7241 steps (0 resets) in 14 ms. (482 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p3) p2))), (X p3), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 17 factoid took 325 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 211 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 12 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2024-06-01 16:07:48] [INFO ] Invariant cache hit.
[2024-06-01 16:07:48] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-06-01 16:07:48] [INFO ] Invariant cache hit.
[2024-06-01 16:07:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:07:49] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1693 ms to find 0 implicit places.
[2024-06-01 16:07:49] [INFO ] Redundant transitions in 4 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-01 16:07:49] [INFO ] Invariant cache hit.
[2024-06-01 16:07:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 91 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 2 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:07:55] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 2 ms to minimize.
[2024-06-01 16:07:55] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:07:55] [INFO ] Deduced a trap composed of 102 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:07:55] [INFO ] Deduced a trap composed of 75 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:07:55] [INFO ] Deduced a trap composed of 78 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:07:56] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:07:56] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:07:56] [INFO ] Deduced a trap composed of 66 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:07:56] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:07:56] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:07:56] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:07:57] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:07:57] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:07:57] [INFO ] Deduced a trap composed of 72 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:07:57] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:07:58] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:07:59] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:07:59] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 2 ms to minimize.
[2024-06-01 16:07:59] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:07:59] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:07:59] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:08:00] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 2 ms to minimize.
[2024-06-01 16:08:00] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 2 ms to minimize.
[2024-06-01 16:08:00] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:08:00] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:08:00] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:08:01] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:08:01] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 3 ms to minimize.
[2024-06-01 16:08:01] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:08:01] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 2 ms to minimize.
[2024-06-01 16:08:01] [INFO ] Deduced a trap composed of 54 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:08:01] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:08:02] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:08:02] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:08:02] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:08:05] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:08:06] [INFO ] Deduced a trap composed of 87 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:08:06] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:08:07] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:08:08] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:08:08] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:08:08] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:08:08] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:08:09] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:08:09] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:08:09] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 2 ms to minimize.
[2024-06-01 16:08:09] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:08:09] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 2 ms to minimize.
[2024-06-01 16:08:09] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:08:10] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:08:10] [INFO ] Deduced a trap composed of 77 places in 170 ms of which 2 ms to minimize.
[2024-06-01 16:08:10] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:08:10] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 2 ms to minimize.
[2024-06-01 16:08:10] [INFO ] Deduced a trap composed of 62 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:08:10] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:08:11] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 3 ms to minimize.
[2024-06-01 16:08:11] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:08:11] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:08:11] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:08:12] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:08:12] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:08:12] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:08:13] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:08:13] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:08:13] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 2 ms to minimize.
[2024-06-01 16:08:13] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:08:13] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:08:14] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:08:15] [INFO ] Deduced a trap composed of 56 places in 153 ms of which 2 ms to minimize.
[2024-06-01 16:08:15] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:08:15] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:08:15] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 2 ms to minimize.
[2024-06-01 16:08:16] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:08:16] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 3 ms to minimize.
[2024-06-01 16:08:16] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:08:16] [INFO ] Deduced a trap composed of 77 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:08:16] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:08:17] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 2 ms to minimize.
[2024-06-01 16:08:17] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 211/643 variables, and 104 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/211 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 84/104 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:08:22] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:08:22] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:08:23] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:08:23] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 2 ms to minimize.
[2024-06-01 16:08:24] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:08:24] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:08:24] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:08:24] [INFO ] Deduced a trap composed of 97 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:08:25] [INFO ] Deduced a trap composed of 89 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:08:25] [INFO ] Deduced a trap composed of 88 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:08:25] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:08:25] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:08:25] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:08:25] [INFO ] Deduced a trap composed of 101 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:08:26] [INFO ] Deduced a trap composed of 89 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:08:26] [INFO ] Deduced a trap composed of 91 places in 175 ms of which 2 ms to minimize.
[2024-06-01 16:08:26] [INFO ] Deduced a trap composed of 90 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:08:26] [INFO ] Deduced a trap composed of 79 places in 168 ms of which 2 ms to minimize.
[2024-06-01 16:08:26] [INFO ] Deduced a trap composed of 86 places in 172 ms of which 2 ms to minimize.
[2024-06-01 16:08:27] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 211/643 variables, and 124 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/211 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/423 constraints, Known Traps: 104/104 constraints]
After SMT, in 60466ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60473ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62192 ms. Remains : 211/211 places, 432/432 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 287 ms. (138 steps per ms) remains 1/4 properties
BEST_FIRST walk for 12644 steps (2 resets) in 12 ms. (972 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 168 ms.
Product exploration explored 100000 steps with 0 reset in 201 ms.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 7 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2024-06-01 16:08:51] [INFO ] Invariant cache hit.
[2024-06-01 16:08:51] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-06-01 16:08:51] [INFO ] Invariant cache hit.
[2024-06-01 16:08:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:08:52] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
[2024-06-01 16:08:52] [INFO ] Redundant transitions in 2 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-01 16:08:52] [INFO ] Invariant cache hit.
[2024-06-01 16:08:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:08:55] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:08:56] [INFO ] Deduced a trap composed of 91 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:08:56] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 2 ms to minimize.
[2024-06-01 16:08:56] [INFO ] Deduced a trap composed of 90 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:08:56] [INFO ] Deduced a trap composed of 67 places in 183 ms of which 2 ms to minimize.
[2024-06-01 16:08:56] [INFO ] Deduced a trap composed of 72 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:08:57] [INFO ] Deduced a trap composed of 72 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:08:57] [INFO ] Deduced a trap composed of 102 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:08:57] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:08:57] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:08:57] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 2 ms to minimize.
[2024-06-01 16:08:57] [INFO ] Deduced a trap composed of 73 places in 177 ms of which 2 ms to minimize.
[2024-06-01 16:08:58] [INFO ] Deduced a trap composed of 66 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:08:58] [INFO ] Deduced a trap composed of 90 places in 172 ms of which 2 ms to minimize.
[2024-06-01 16:08:58] [INFO ] Deduced a trap composed of 79 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:08:58] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:08:58] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 2 ms to minimize.
[2024-06-01 16:08:58] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 2 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 70 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 2 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 2 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 68 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 68 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 2 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:09:04] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:09:04] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:09:07] [INFO ] Deduced a trap composed of 62 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:09:08] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:09:08] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:09:08] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 60 places in 164 ms of which 2 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 2 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 2 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 67 places in 158 ms of which 2 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 2 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 62 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 2 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 77 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 77 places in 172 ms of which 2 ms to minimize.
[2024-06-01 16:09:12] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:09:12] [INFO ] Deduced a trap composed of 68 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:09:12] [INFO ] Deduced a trap composed of 62 places in 173 ms of which 2 ms to minimize.
[2024-06-01 16:09:12] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 2 ms to minimize.
[2024-06-01 16:09:12] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:09:12] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:09:13] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 2 ms to minimize.
[2024-06-01 16:09:13] [INFO ] Deduced a trap composed of 72 places in 172 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 85 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 68 places in 169 ms of which 2 ms to minimize.
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:09:15] [INFO ] Deduced a trap composed of 67 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:09:15] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:09:15] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:09:16] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:09:16] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 2 ms to minimize.
[2024-06-01 16:09:16] [INFO ] Deduced a trap composed of 91 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 2 ms to minimize.
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 2 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 77 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 2 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:09:22] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:09:22] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:09:22] [INFO ] Deduced a trap composed of 89 places in 163 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 211/643 variables, and 107 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/211 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 87/107 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-01 16:09:26] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:09:26] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:09:26] [INFO ] Deduced a trap composed of 85 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:09:26] [INFO ] Deduced a trap composed of 78 places in 171 ms of which 2 ms to minimize.
[2024-06-01 16:09:26] [INFO ] Deduced a trap composed of 78 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:09:27] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 2 ms to minimize.
[2024-06-01 16:09:27] [INFO ] Deduced a trap composed of 86 places in 174 ms of which 2 ms to minimize.
[2024-06-01 16:09:27] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:09:27] [INFO ] Deduced a trap composed of 69 places in 179 ms of which 2 ms to minimize.
[2024-06-01 16:09:27] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 2 ms to minimize.
[2024-06-01 16:09:27] [INFO ] Deduced a trap composed of 76 places in 171 ms of which 2 ms to minimize.
[2024-06-01 16:09:28] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:09:28] [INFO ] Deduced a trap composed of 82 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:09:28] [INFO ] Deduced a trap composed of 89 places in 165 ms of which 2 ms to minimize.
[2024-06-01 16:09:28] [INFO ] Deduced a trap composed of 99 places in 161 ms of which 2 ms to minimize.
[2024-06-01 16:09:28] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-06-01 16:09:28] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:09:29] [INFO ] Deduced a trap composed of 71 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:09:29] [INFO ] Deduced a trap composed of 72 places in 184 ms of which 2 ms to minimize.
[2024-06-01 16:09:29] [INFO ] Deduced a trap composed of 67 places in 172 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 211/643 variables, and 127 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/211 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/423 constraints, Known Traps: 107/107 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61487 ms. Remains : 211/211 places, 432/432 transitions.
Treatment of property Anderson-PT-09-LTLFireability-08 finished in 129470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 380 transition count 768
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 308 transition count 768
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 163 place count 289 transition count 477
Iterating global reduction 0 with 19 rules applied. Total rules applied 182 place count 289 transition count 477
Applied a total of 182 rules in 22 ms. Remains 289 /380 variables (removed 91) and now considering 477/840 (removed 363) transitions.
// Phase 1: matrix 477 rows 289 cols
[2024-06-01 16:09:53] [INFO ] Computed 21 invariants in 4 ms
[2024-06-01 16:09:53] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-06-01 16:09:53] [INFO ] Invariant cache hit.
[2024-06-01 16:09:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:09:54] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 1891 ms to find 0 implicit places.
[2024-06-01 16:09:54] [INFO ] Redundant transitions in 2 ms returned []
Running 468 sub problems to find dead transitions.
[2024-06-01 16:09:54] [INFO ] Invariant cache hit.
[2024-06-01 16:09:54] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-01 16:10:00] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:10:00] [INFO ] Deduced a trap composed of 130 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:10:00] [INFO ] Deduced a trap composed of 90 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:10:01] [INFO ] Deduced a trap composed of 91 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:10:01] [INFO ] Deduced a trap composed of 123 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:10:01] [INFO ] Deduced a trap composed of 127 places in 291 ms of which 3 ms to minimize.
[2024-06-01 16:10:01] [INFO ] Deduced a trap composed of 93 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:10:02] [INFO ] Deduced a trap composed of 71 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:10:02] [INFO ] Deduced a trap composed of 91 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:10:02] [INFO ] Deduced a trap composed of 99 places in 330 ms of which 3 ms to minimize.
[2024-06-01 16:10:03] [INFO ] Deduced a trap composed of 88 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:10:03] [INFO ] Deduced a trap composed of 100 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:10:03] [INFO ] Deduced a trap composed of 153 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:10:03] [INFO ] Deduced a trap composed of 152 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:10:04] [INFO ] Deduced a trap composed of 78 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:10:04] [INFO ] Deduced a trap composed of 111 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:10:04] [INFO ] Deduced a trap composed of 133 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:10:05] [INFO ] Deduced a trap composed of 144 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:10:05] [INFO ] Deduced a trap composed of 90 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:10:05] [INFO ] Deduced a trap composed of 135 places in 336 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-01 16:10:08] [INFO ] Deduced a trap composed of 111 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:10:08] [INFO ] Deduced a trap composed of 83 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:10:09] [INFO ] Deduced a trap composed of 116 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:10:09] [INFO ] Deduced a trap composed of 107 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:10:09] [INFO ] Deduced a trap composed of 93 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:10:10] [INFO ] Deduced a trap composed of 103 places in 289 ms of which 5 ms to minimize.
[2024-06-01 16:10:10] [INFO ] Deduced a trap composed of 149 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:10:10] [INFO ] Deduced a trap composed of 83 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:10:10] [INFO ] Deduced a trap composed of 87 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:10:11] [INFO ] Deduced a trap composed of 136 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:10:11] [INFO ] Deduced a trap composed of 82 places in 306 ms of which 4 ms to minimize.
[2024-06-01 16:10:11] [INFO ] Deduced a trap composed of 185 places in 308 ms of which 4 ms to minimize.
[2024-06-01 16:10:12] [INFO ] Deduced a trap composed of 102 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:10:12] [INFO ] Deduced a trap composed of 109 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:10:12] [INFO ] Deduced a trap composed of 177 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:10:12] [INFO ] Deduced a trap composed of 176 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:10:13] [INFO ] Deduced a trap composed of 101 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:10:13] [INFO ] Deduced a trap composed of 170 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:10:13] [INFO ] Deduced a trap composed of 113 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:10:14] [INFO ] Deduced a trap composed of 174 places in 226 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (OVERLAPS) 1/289 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 158 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 102 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 157 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:10:23] [INFO ] Deduced a trap composed of 120 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:10:24] [INFO ] Deduced a trap composed of 166 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:10:24] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:10:24] [INFO ] Deduced a trap composed of 124 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:10:25] [INFO ] Deduced a trap composed of 168 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:10:25] [INFO ] Deduced a trap composed of 81 places in 313 ms of which 3 ms to minimize.
SMT process timed out in 30507ms, After SMT, problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 30513ms
Starting structural reductions in SI_LTL mode, iteration 1 : 289/380 places, 477/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32438 ms. Remains : 289/380 places, 477/840 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-09
Product exploration explored 100000 steps with 30 reset in 206 ms.
Product exploration explored 100000 steps with 21 reset in 222 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4467 steps (0 resets) in 17 ms. (248 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 477/477 transitions.
Applied a total of 0 rules in 7 ms. Remains 289 /289 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2024-06-01 16:10:26] [INFO ] Invariant cache hit.
[2024-06-01 16:10:26] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-06-01 16:10:26] [INFO ] Invariant cache hit.
[2024-06-01 16:10:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:10:28] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1861 ms to find 0 implicit places.
[2024-06-01 16:10:28] [INFO ] Redundant transitions in 3 ms returned []
Running 468 sub problems to find dead transitions.
[2024-06-01 16:10:28] [INFO ] Invariant cache hit.
[2024-06-01 16:10:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-01 16:10:33] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:10:34] [INFO ] Deduced a trap composed of 130 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:10:34] [INFO ] Deduced a trap composed of 90 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:10:34] [INFO ] Deduced a trap composed of 91 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:10:34] [INFO ] Deduced a trap composed of 123 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:10:35] [INFO ] Deduced a trap composed of 127 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:10:35] [INFO ] Deduced a trap composed of 93 places in 309 ms of which 4 ms to minimize.
[2024-06-01 16:10:35] [INFO ] Deduced a trap composed of 71 places in 304 ms of which 3 ms to minimize.
[2024-06-01 16:10:36] [INFO ] Deduced a trap composed of 91 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:10:36] [INFO ] Deduced a trap composed of 99 places in 287 ms of which 5 ms to minimize.
[2024-06-01 16:10:36] [INFO ] Deduced a trap composed of 88 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:10:37] [INFO ] Deduced a trap composed of 100 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:10:37] [INFO ] Deduced a trap composed of 153 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:10:37] [INFO ] Deduced a trap composed of 152 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:10:37] [INFO ] Deduced a trap composed of 78 places in 272 ms of which 5 ms to minimize.
[2024-06-01 16:10:38] [INFO ] Deduced a trap composed of 111 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:10:38] [INFO ] Deduced a trap composed of 133 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:10:38] [INFO ] Deduced a trap composed of 144 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:10:39] [INFO ] Deduced a trap composed of 90 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:10:39] [INFO ] Deduced a trap composed of 135 places in 234 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-01 16:10:42] [INFO ] Deduced a trap composed of 111 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:10:42] [INFO ] Deduced a trap composed of 83 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:10:43] [INFO ] Deduced a trap composed of 116 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:10:43] [INFO ] Deduced a trap composed of 107 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:10:43] [INFO ] Deduced a trap composed of 93 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:10:43] [INFO ] Deduced a trap composed of 103 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:10:44] [INFO ] Deduced a trap composed of 149 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:10:44] [INFO ] Deduced a trap composed of 83 places in 267 ms of which 5 ms to minimize.
[2024-06-01 16:10:44] [INFO ] Deduced a trap composed of 87 places in 331 ms of which 3 ms to minimize.
[2024-06-01 16:10:45] [INFO ] Deduced a trap composed of 136 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:10:45] [INFO ] Deduced a trap composed of 82 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:10:45] [INFO ] Deduced a trap composed of 185 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:10:45] [INFO ] Deduced a trap composed of 102 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:10:46] [INFO ] Deduced a trap composed of 109 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:10:46] [INFO ] Deduced a trap composed of 177 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:10:46] [INFO ] Deduced a trap composed of 176 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:10:46] [INFO ] Deduced a trap composed of 101 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:10:47] [INFO ] Deduced a trap composed of 170 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:10:47] [INFO ] Deduced a trap composed of 113 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:10:47] [INFO ] Deduced a trap composed of 174 places in 244 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (OVERLAPS) 1/289 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-01 16:10:57] [INFO ] Deduced a trap composed of 158 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:10:57] [INFO ] Deduced a trap composed of 102 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:10:57] [INFO ] Deduced a trap composed of 157 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:10:58] [INFO ] Deduced a trap composed of 120 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:10:58] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:10:58] [INFO ] Deduced a trap composed of 64 places in 314 ms of which 5 ms to minimize.
SMT process timed out in 30457ms, After SMT, problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 30462ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32340 ms. Remains : 289/289 places, 477/477 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7911 steps (1 resets) in 24 ms. (316 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27 reset in 215 ms.
Product exploration explored 100000 steps with 28 reset in 239 ms.
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 477/477 transitions.
Applied a total of 0 rules in 8 ms. Remains 289 /289 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2024-06-01 16:10:59] [INFO ] Invariant cache hit.
[2024-06-01 16:11:00] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-06-01 16:11:00] [INFO ] Invariant cache hit.
[2024-06-01 16:11:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:11:01] [INFO ] Implicit Places using invariants and state equation in 1404 ms returned []
Implicit Place search using SMT with State Equation took 1817 ms to find 0 implicit places.
[2024-06-01 16:11:01] [INFO ] Redundant transitions in 3 ms returned []
Running 468 sub problems to find dead transitions.
[2024-06-01 16:11:01] [INFO ] Invariant cache hit.
[2024-06-01 16:11:01] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-01 16:11:06] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:11:07] [INFO ] Deduced a trap composed of 130 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:11:07] [INFO ] Deduced a trap composed of 90 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:11:07] [INFO ] Deduced a trap composed of 91 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:11:08] [INFO ] Deduced a trap composed of 123 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:11:08] [INFO ] Deduced a trap composed of 127 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:11:08] [INFO ] Deduced a trap composed of 93 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:11:08] [INFO ] Deduced a trap composed of 71 places in 246 ms of which 5 ms to minimize.
[2024-06-01 16:11:09] [INFO ] Deduced a trap composed of 91 places in 327 ms of which 4 ms to minimize.
[2024-06-01 16:11:09] [INFO ] Deduced a trap composed of 99 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:11:09] [INFO ] Deduced a trap composed of 88 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:11:10] [INFO ] Deduced a trap composed of 100 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:11:10] [INFO ] Deduced a trap composed of 153 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:11:10] [INFO ] Deduced a trap composed of 152 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:11:10] [INFO ] Deduced a trap composed of 78 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:11:11] [INFO ] Deduced a trap composed of 111 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:11:11] [INFO ] Deduced a trap composed of 133 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:11:11] [INFO ] Deduced a trap composed of 144 places in 280 ms of which 5 ms to minimize.
[2024-06-01 16:11:12] [INFO ] Deduced a trap composed of 90 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:11:12] [INFO ] Deduced a trap composed of 135 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-01 16:11:15] [INFO ] Deduced a trap composed of 111 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:11:15] [INFO ] Deduced a trap composed of 83 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 116 places in 339 ms of which 5 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 107 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 93 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:11:17] [INFO ] Deduced a trap composed of 103 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:11:17] [INFO ] Deduced a trap composed of 149 places in 307 ms of which 3 ms to minimize.
[2024-06-01 16:11:17] [INFO ] Deduced a trap composed of 83 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:11:17] [INFO ] Deduced a trap composed of 87 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:11:18] [INFO ] Deduced a trap composed of 136 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:11:18] [INFO ] Deduced a trap composed of 82 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:11:18] [INFO ] Deduced a trap composed of 185 places in 315 ms of which 3 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 102 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 109 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 177 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 176 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 101 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 170 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 113 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 174 places in 246 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (OVERLAPS) 1/289 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-01 16:11:30] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:11:30] [INFO ] Deduced a trap composed of 102 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:11:30] [INFO ] Deduced a trap composed of 157 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:11:31] [INFO ] Deduced a trap composed of 120 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:11:31] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:11:31] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:11:32] [INFO ] Deduced a trap composed of 124 places in 278 ms of which 4 ms to minimize.
SMT process timed out in 30510ms, After SMT, problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 30516ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32351 ms. Remains : 289/289 places, 477/477 transitions.
Treatment of property Anderson-PT-09-LTLFireability-09 finished in 99080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&X(X(X(!p1))))||G(!p1)))))'
Support contains 6 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 364 transition count 600
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 364 transition count 600
Applied a total of 32 rules in 16 ms. Remains 364 /380 variables (removed 16) and now considering 600/840 (removed 240) transitions.
// Phase 1: matrix 600 rows 364 cols
[2024-06-01 16:11:32] [INFO ] Computed 21 invariants in 7 ms
[2024-06-01 16:11:32] [INFO ] Implicit Places using invariants in 636 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 638 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 363/380 places, 600/840 transitions.
Applied a total of 0 rules in 5 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 660 ms. Remains : 363/380 places, 600/840 transitions.
Stuttering acceptance computed with spot in 440 ms :[p1, p1, p1, p1, p1, p1, p1, p1, p1]
Running random walk in product with property : Anderson-PT-09-LTLFireability-10
Product exploration explored 100000 steps with 14 reset in 205 ms.
Product exploration explored 100000 steps with 12 reset in 193 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 152 ms. Reduced automaton from 9 states, 27 edges and 2 AP (stutter sensitive) to 9 states, 27 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[p1, p1, p1, p1, p1, p1, p1, p1, p1]
RANDOM walk for 40000 steps (8 resets) in 739 ms. (54 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 1/3 properties
// Phase 1: matrix 600 rows 363 cols
[2024-06-01 16:11:34] [INFO ] Computed 20 invariants in 4 ms
[2024-06-01 16:11:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/355 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 363/963 variables, and 20 constraints, problems are : Problem set: 1 solved, 0 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 14 factoid took 435 ms. Reduced automaton from 9 states, 27 edges and 2 AP (stutter sensitive) to 8 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 283 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
Support contains 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 600/600 transitions.
Applied a total of 0 rules in 4 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-06-01 16:11:35] [INFO ] Invariant cache hit.
[2024-06-01 16:11:36] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-06-01 16:11:36] [INFO ] Invariant cache hit.
[2024-06-01 16:11:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:11:38] [INFO ] Implicit Places using invariants and state equation in 2035 ms returned []
Implicit Place search using SMT with State Equation took 2423 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-06-01 16:11:38] [INFO ] Invariant cache hit.
[2024-06-01 16:11:38] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:11:44] [INFO ] Deduced a trap composed of 188 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:11:45] [INFO ] Deduced a trap composed of 133 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:11:45] [INFO ] Deduced a trap composed of 99 places in 304 ms of which 6 ms to minimize.
[2024-06-01 16:11:46] [INFO ] Deduced a trap composed of 236 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:11:47] [INFO ] Deduced a trap composed of 156 places in 301 ms of which 4 ms to minimize.
[2024-06-01 16:11:49] [INFO ] Deduced a trap composed of 89 places in 301 ms of which 4 ms to minimize.
[2024-06-01 16:11:49] [INFO ] Deduced a trap composed of 108 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:11:50] [INFO ] Deduced a trap composed of 102 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:11:50] [INFO ] Deduced a trap composed of 106 places in 292 ms of which 3 ms to minimize.
[2024-06-01 16:11:50] [INFO ] Deduced a trap composed of 167 places in 331 ms of which 6 ms to minimize.
[2024-06-01 16:11:51] [INFO ] Deduced a trap composed of 145 places in 399 ms of which 3 ms to minimize.
[2024-06-01 16:11:51] [INFO ] Deduced a trap composed of 176 places in 309 ms of which 4 ms to minimize.
[2024-06-01 16:11:52] [INFO ] Deduced a trap composed of 94 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:11:52] [INFO ] Deduced a trap composed of 136 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:11:52] [INFO ] Deduced a trap composed of 155 places in 403 ms of which 5 ms to minimize.
[2024-06-01 16:11:53] [INFO ] Deduced a trap composed of 169 places in 313 ms of which 4 ms to minimize.
[2024-06-01 16:11:53] [INFO ] Deduced a trap composed of 104 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:11:53] [INFO ] Deduced a trap composed of 102 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:11:54] [INFO ] Deduced a trap composed of 174 places in 401 ms of which 6 ms to minimize.
[2024-06-01 16:11:54] [INFO ] Deduced a trap composed of 94 places in 335 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:11:56] [INFO ] Deduced a trap composed of 218 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:11:56] [INFO ] Deduced a trap composed of 161 places in 299 ms of which 3 ms to minimize.
[2024-06-01 16:11:57] [INFO ] Deduced a trap composed of 96 places in 364 ms of which 4 ms to minimize.
[2024-06-01 16:11:58] [INFO ] Deduced a trap composed of 158 places in 296 ms of which 3 ms to minimize.
[2024-06-01 16:11:58] [INFO ] Deduced a trap composed of 135 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:11:59] [INFO ] Deduced a trap composed of 97 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:11:59] [INFO ] Deduced a trap composed of 190 places in 307 ms of which 3 ms to minimize.
[2024-06-01 16:11:59] [INFO ] Deduced a trap composed of 62 places in 318 ms of which 6 ms to minimize.
[2024-06-01 16:12:00] [INFO ] Deduced a trap composed of 180 places in 331 ms of which 4 ms to minimize.
[2024-06-01 16:12:00] [INFO ] Deduced a trap composed of 128 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:12:01] [INFO ] Deduced a trap composed of 195 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:12:01] [INFO ] Deduced a trap composed of 182 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:12:01] [INFO ] Deduced a trap composed of 159 places in 321 ms of which 5 ms to minimize.
[2024-06-01 16:12:02] [INFO ] Deduced a trap composed of 171 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:12:02] [INFO ] Deduced a trap composed of 163 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:12:02] [INFO ] Deduced a trap composed of 131 places in 290 ms of which 3 ms to minimize.
[2024-06-01 16:12:03] [INFO ] Deduced a trap composed of 216 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:12:03] [INFO ] Deduced a trap composed of 167 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:12:03] [INFO ] Deduced a trap composed of 179 places in 294 ms of which 3 ms to minimize.
[2024-06-01 16:12:04] [INFO ] Deduced a trap composed of 145 places in 312 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/963 variables, and 60 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:12:12] [INFO ] Deduced a trap composed of 177 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:12:12] [INFO ] Deduced a trap composed of 127 places in 300 ms of which 3 ms to minimize.
[2024-06-01 16:12:13] [INFO ] Deduced a trap composed of 173 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:12:13] [INFO ] Deduced a trap composed of 100 places in 321 ms of which 5 ms to minimize.
[2024-06-01 16:12:13] [INFO ] Deduced a trap composed of 94 places in 385 ms of which 6 ms to minimize.
[2024-06-01 16:12:14] [INFO ] Deduced a trap composed of 138 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:12:15] [INFO ] Deduced a trap composed of 153 places in 309 ms of which 4 ms to minimize.
[2024-06-01 16:12:15] [INFO ] Deduced a trap composed of 234 places in 302 ms of which 5 ms to minimize.
[2024-06-01 16:12:16] [INFO ] Deduced a trap composed of 138 places in 354 ms of which 5 ms to minimize.
[2024-06-01 16:12:16] [INFO ] Deduced a trap composed of 167 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:12:16] [INFO ] Deduced a trap composed of 148 places in 286 ms of which 3 ms to minimize.
[2024-06-01 16:12:17] [INFO ] Deduced a trap composed of 150 places in 299 ms of which 3 ms to minimize.
[2024-06-01 16:12:17] [INFO ] Deduced a trap composed of 148 places in 360 ms of which 6 ms to minimize.
[2024-06-01 16:12:17] [INFO ] Deduced a trap composed of 170 places in 361 ms of which 3 ms to minimize.
[2024-06-01 16:12:18] [INFO ] Deduced a trap composed of 99 places in 303 ms of which 4 ms to minimize.
[2024-06-01 16:12:18] [INFO ] Deduced a trap composed of 136 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:12:19] [INFO ] Deduced a trap composed of 111 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:12:19] [INFO ] Deduced a trap composed of 159 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:12:19] [INFO ] Deduced a trap composed of 125 places in 293 ms of which 3 ms to minimize.
[2024-06-01 16:12:20] [INFO ] Deduced a trap composed of 133 places in 292 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:12:22] [INFO ] Deduced a trap composed of 173 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:12:23] [INFO ] Deduced a trap composed of 154 places in 292 ms of which 3 ms to minimize.
[2024-06-01 16:12:23] [INFO ] Deduced a trap composed of 133 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:12:23] [INFO ] Deduced a trap composed of 151 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:12:24] [INFO ] Deduced a trap composed of 170 places in 292 ms of which 3 ms to minimize.
[2024-06-01 16:12:24] [INFO ] Deduced a trap composed of 145 places in 345 ms of which 6 ms to minimize.
[2024-06-01 16:12:24] [INFO ] Deduced a trap composed of 171 places in 354 ms of which 4 ms to minimize.
[2024-06-01 16:12:25] [INFO ] Deduced a trap composed of 156 places in 291 ms of which 3 ms to minimize.
[2024-06-01 16:12:25] [INFO ] Deduced a trap composed of 160 places in 365 ms of which 5 ms to minimize.
[2024-06-01 16:12:26] [INFO ] Deduced a trap composed of 156 places in 344 ms of which 4 ms to minimize.
[2024-06-01 16:12:26] [INFO ] Deduced a trap composed of 193 places in 292 ms of which 6 ms to minimize.
[2024-06-01 16:12:26] [INFO ] Deduced a trap composed of 145 places in 383 ms of which 6 ms to minimize.
[2024-06-01 16:12:27] [INFO ] Deduced a trap composed of 141 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:12:27] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:12:27] [INFO ] Deduced a trap composed of 142 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:12:27] [INFO ] Deduced a trap composed of 163 places in 322 ms of which 5 ms to minimize.
[2024-06-01 16:12:28] [INFO ] Deduced a trap composed of 126 places in 406 ms of which 4 ms to minimize.
[2024-06-01 16:12:28] [INFO ] Deduced a trap composed of 175 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:12:28] [INFO ] Deduced a trap composed of 165 places in 305 ms of which 3 ms to minimize.
[2024-06-01 16:12:29] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/963 variables, and 100 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 80/80 constraints]
After SMT, in 60335ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60342ms
Finished structural reductions in LTL mode , in 1 iterations and 62771 ms. Remains : 363/363 places, 600/600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 8 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2024-06-01 16:12:39] [INFO ] Invariant cache hit.
[2024-06-01 16:12:39] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/338 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/354 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:12:39] [INFO ] Deduced a trap composed of 305 places in 186 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/363 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 600/963 variables, 363/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 72/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/963 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/963 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 963/963 variables, and 456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 363/363 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/338 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/354 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/363 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 600/963 variables, 363/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 72/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/963 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/963 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/963 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 963/963 variables, and 457 constraints, problems are : Problem set: 0 solved, 1 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 363/363 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1270ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6848 steps, including 605 resets, run visited all 1 properties in 14 ms. (steps per millisecond=489 )
Parikh walk visited 1 properties in 21 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 8 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 281 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 282 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
Product exploration explored 100000 steps with 9 reset in 153 ms.
Product exploration explored 100000 steps with 16 reset in 164 ms.
Applying partial POR strategy [false, false, false, false, true, false, false, false]
Stuttering acceptance computed with spot in 284 ms :[p1, p1, p1, p1, p1, p1, p1, p1]
Support contains 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 600/600 transitions.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 363 transition count 600
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 72 Pre rules applied. Total rules applied 78 place count 363 transition count 600
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 150 place count 363 transition count 600
Deduced a syphon composed of 150 places in 1 ms
Applied a total of 150 rules in 47 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-06-01 16:12:42] [INFO ] Redundant transitions in 4 ms returned []
Running 591 sub problems to find dead transitions.
// Phase 1: matrix 600 rows 363 cols
[2024-06-01 16:12:42] [INFO ] Computed 20 invariants in 4 ms
[2024-06-01 16:12:42] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:12:48] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-06-01 16:12:48] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:12:48] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 16:12:48] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 16:12:48] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:12:48] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:12:49] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:12:49] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:12:49] [INFO ] Deduced a trap composed of 20 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:12:49] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:12:50] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:12:51] [INFO ] Deduced a trap composed of 86 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:12:52] [INFO ] Deduced a trap composed of 68 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:12:52] [INFO ] Deduced a trap composed of 73 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:12:52] [INFO ] Deduced a trap composed of 59 places in 295 ms of which 5 ms to minimize.
[2024-06-01 16:12:53] [INFO ] Deduced a trap composed of 60 places in 390 ms of which 6 ms to minimize.
[2024-06-01 16:12:53] [INFO ] Deduced a trap composed of 55 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:12:53] [INFO ] Deduced a trap composed of 78 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:12:54] [INFO ] Deduced a trap composed of 90 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:12:54] [INFO ] Deduced a trap composed of 81 places in 272 ms of which 4 ms to minimize.
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 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
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 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 TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 20/40 constraints. Problems are: Problem set: 150 solved, 441 unsolved
[2024-06-01 16:12:56] [INFO ] Deduced a trap composed of 52 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:12:56] [INFO ] Deduced a trap composed of 78 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:12:56] [INFO ] Deduced a trap composed of 60 places in 313 ms of which 6 ms to minimize.
[2024-06-01 16:12:58] [INFO ] Deduced a trap composed of 87 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:12:58] [INFO ] Deduced a trap composed of 84 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:12:58] [INFO ] Deduced a trap composed of 73 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:12:58] [INFO ] Deduced a trap composed of 81 places in 294 ms of which 3 ms to minimize.
[2024-06-01 16:12:59] [INFO ] Deduced a trap composed of 56 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:12:59] [INFO ] Deduced a trap composed of 72 places in 386 ms of which 5 ms to minimize.
[2024-06-01 16:13:00] [INFO ] Deduced a trap composed of 61 places in 310 ms of which 4 ms to minimize.
[2024-06-01 16:13:00] [INFO ] Deduced a trap composed of 82 places in 301 ms of which 4 ms to minimize.
[2024-06-01 16:13:00] [INFO ] Deduced a trap composed of 67 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:13:00] [INFO ] Deduced a trap composed of 70 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:13:01] [INFO ] Deduced a trap composed of 71 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:13:01] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:13:01] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:13:02] [INFO ] Deduced a trap composed of 58 places in 386 ms of which 6 ms to minimize.
[2024-06-01 16:13:02] [INFO ] Deduced a trap composed of 66 places in 317 ms of which 3 ms to minimize.
[2024-06-01 16:13:02] [INFO ] Deduced a trap composed of 80 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:13:03] [INFO ] Deduced a trap composed of 58 places in 389 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/60 constraints. Problems are: Problem set: 150 solved, 441 unsolved
[2024-06-01 16:13:08] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 99 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 98 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 60 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 81 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:13:11] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:13:11] [INFO ] Deduced a trap composed of 75 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:13:11] [INFO ] Deduced a trap composed of 87 places in 281 ms of which 3 ms to minimize.
[2024-06-01 16:13:12] [INFO ] Deduced a trap composed of 80 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:13:12] [INFO ] Deduced a trap composed of 92 places in 284 ms of which 3 ms to minimize.
[2024-06-01 16:13:12] [INFO ] Deduced a trap composed of 79 places in 284 ms of which 3 ms to minimize.
[2024-06-01 16:13:12] [INFO ] Deduced a trap composed of 88 places in 270 ms of which 3 ms to minimize.
SMT process timed out in 30445ms, After SMT, problems are : Problem set: 150 solved, 441 unsolved
Search for dead transitions found 150 dead transitions in 30451ms
Found 150 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 150 transitions
Dead transitions reduction (with SMT) removed 150 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 363/363 places, 450/600 transitions.
Graph (complete) has 1169 edges and 363 vertex of which 213 are kept as prefixes of interest. Removing 150 places using SCC suffix rule.1 ms
Discarding 150 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 213 /363 variables (removed 150) and now considering 450/450 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 213/363 places, 450/600 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30522 ms. Remains : 213/363 places, 450/600 transitions.
Support contains 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 600/600 transitions.
Applied a total of 0 rules in 11 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
// Phase 1: matrix 600 rows 363 cols
[2024-06-01 16:13:13] [INFO ] Computed 20 invariants in 4 ms
[2024-06-01 16:13:13] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-06-01 16:13:13] [INFO ] Invariant cache hit.
[2024-06-01 16:13:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:13:15] [INFO ] Implicit Places using invariants and state equation in 1976 ms returned []
Implicit Place search using SMT with State Equation took 2358 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-06-01 16:13:15] [INFO ] Invariant cache hit.
[2024-06-01 16:13:15] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:13:22] [INFO ] Deduced a trap composed of 188 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:13:23] [INFO ] Deduced a trap composed of 133 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:13:23] [INFO ] Deduced a trap composed of 99 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:13:24] [INFO ] Deduced a trap composed of 236 places in 309 ms of which 4 ms to minimize.
[2024-06-01 16:13:24] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 6 ms to minimize.
[2024-06-01 16:13:26] [INFO ] Deduced a trap composed of 89 places in 309 ms of which 4 ms to minimize.
[2024-06-01 16:13:27] [INFO ] Deduced a trap composed of 108 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:13:27] [INFO ] Deduced a trap composed of 102 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:13:27] [INFO ] Deduced a trap composed of 106 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:13:28] [INFO ] Deduced a trap composed of 167 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:13:28] [INFO ] Deduced a trap composed of 145 places in 313 ms of which 4 ms to minimize.
[2024-06-01 16:13:28] [INFO ] Deduced a trap composed of 176 places in 292 ms of which 3 ms to minimize.
[2024-06-01 16:13:29] [INFO ] Deduced a trap composed of 94 places in 405 ms of which 6 ms to minimize.
[2024-06-01 16:13:29] [INFO ] Deduced a trap composed of 136 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:13:29] [INFO ] Deduced a trap composed of 155 places in 310 ms of which 4 ms to minimize.
[2024-06-01 16:13:30] [INFO ] Deduced a trap composed of 169 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:13:30] [INFO ] Deduced a trap composed of 104 places in 354 ms of which 5 ms to minimize.
[2024-06-01 16:13:30] [INFO ] Deduced a trap composed of 102 places in 352 ms of which 3 ms to minimize.
[2024-06-01 16:13:31] [INFO ] Deduced a trap composed of 174 places in 211 ms of which 4 ms to minimize.
[2024-06-01 16:13:31] [INFO ] Deduced a trap composed of 94 places in 302 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:13:33] [INFO ] Deduced a trap composed of 218 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:13:33] [INFO ] Deduced a trap composed of 161 places in 284 ms of which 3 ms to minimize.
[2024-06-01 16:13:34] [INFO ] Deduced a trap composed of 96 places in 303 ms of which 4 ms to minimize.
[2024-06-01 16:13:35] [INFO ] Deduced a trap composed of 158 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:13:35] [INFO ] Deduced a trap composed of 135 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:13:36] [INFO ] Deduced a trap composed of 97 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:13:36] [INFO ] Deduced a trap composed of 190 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:13:36] [INFO ] Deduced a trap composed of 62 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:13:37] [INFO ] Deduced a trap composed of 180 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:13:37] [INFO ] Deduced a trap composed of 128 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:13:38] [INFO ] Deduced a trap composed of 195 places in 379 ms of which 5 ms to minimize.
[2024-06-01 16:13:38] [INFO ] Deduced a trap composed of 182 places in 340 ms of which 3 ms to minimize.
[2024-06-01 16:13:38] [INFO ] Deduced a trap composed of 159 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:13:39] [INFO ] Deduced a trap composed of 171 places in 399 ms of which 5 ms to minimize.
[2024-06-01 16:13:39] [INFO ] Deduced a trap composed of 163 places in 320 ms of which 3 ms to minimize.
[2024-06-01 16:13:39] [INFO ] Deduced a trap composed of 131 places in 316 ms of which 6 ms to minimize.
[2024-06-01 16:13:40] [INFO ] Deduced a trap composed of 216 places in 407 ms of which 5 ms to minimize.
[2024-06-01 16:13:40] [INFO ] Deduced a trap composed of 167 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:13:40] [INFO ] Deduced a trap composed of 179 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:13:41] [INFO ] Deduced a trap composed of 145 places in 286 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/963 variables, and 60 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:13:49] [INFO ] Deduced a trap composed of 177 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:13:50] [INFO ] Deduced a trap composed of 127 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:13:50] [INFO ] Deduced a trap composed of 173 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:13:50] [INFO ] Deduced a trap composed of 100 places in 387 ms of which 5 ms to minimize.
[2024-06-01 16:13:51] [INFO ] Deduced a trap composed of 94 places in 303 ms of which 4 ms to minimize.
[2024-06-01 16:13:52] [INFO ] Deduced a trap composed of 138 places in 289 ms of which 3 ms to minimize.
[2024-06-01 16:13:52] [INFO ] Deduced a trap composed of 153 places in 308 ms of which 3 ms to minimize.
[2024-06-01 16:13:53] [INFO ] Deduced a trap composed of 234 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:13:53] [INFO ] Deduced a trap composed of 138 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:13:53] [INFO ] Deduced a trap composed of 167 places in 379 ms of which 3 ms to minimize.
[2024-06-01 16:13:54] [INFO ] Deduced a trap composed of 148 places in 320 ms of which 4 ms to minimize.
[2024-06-01 16:13:54] [INFO ] Deduced a trap composed of 150 places in 380 ms of which 5 ms to minimize.
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 148 places in 353 ms of which 4 ms to minimize.
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 170 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 99 places in 387 ms of which 5 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 136 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 111 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 159 places in 327 ms of which 6 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 125 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 133 places in 303 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 16:14:00] [INFO ] Deduced a trap composed of 173 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:14:00] [INFO ] Deduced a trap composed of 154 places in 310 ms of which 4 ms to minimize.
[2024-06-01 16:14:01] [INFO ] Deduced a trap composed of 133 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:14:01] [INFO ] Deduced a trap composed of 151 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:14:01] [INFO ] Deduced a trap composed of 170 places in 306 ms of which 4 ms to minimize.
[2024-06-01 16:14:02] [INFO ] Deduced a trap composed of 145 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:14:02] [INFO ] Deduced a trap composed of 171 places in 339 ms of which 4 ms to minimize.
[2024-06-01 16:14:02] [INFO ] Deduced a trap composed of 156 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:14:03] [INFO ] Deduced a trap composed of 160 places in 382 ms of which 5 ms to minimize.
[2024-06-01 16:14:03] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:14:03] [INFO ] Deduced a trap composed of 193 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:14:04] [INFO ] Deduced a trap composed of 145 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:14:04] [INFO ] Deduced a trap composed of 141 places in 281 ms of which 3 ms to minimize.
[2024-06-01 16:14:04] [INFO ] Deduced a trap composed of 172 places in 286 ms of which 3 ms to minimize.
[2024-06-01 16:14:04] [INFO ] Deduced a trap composed of 142 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:14:05] [INFO ] Deduced a trap composed of 163 places in 366 ms of which 4 ms to minimize.
[2024-06-01 16:14:05] [INFO ] Deduced a trap composed of 126 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:14:05] [INFO ] Deduced a trap composed of 175 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:14:06] [INFO ] Deduced a trap composed of 165 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:14:06] [INFO ] Deduced a trap composed of 168 places in 335 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/963 variables, and 100 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 80/80 constraints]
After SMT, in 60334ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Finished structural reductions in LTL mode , in 1 iterations and 62714 ms. Remains : 363/363 places, 600/600 transitions.
Treatment of property Anderson-PT-09-LTLFireability-10 finished in 163678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(((p1 U p2)&&F(p3))))&&p0))))'
Support contains 6 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 364 transition count 600
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 364 transition count 600
Applied a total of 32 rules in 29 ms. Remains 364 /380 variables (removed 16) and now considering 600/840 (removed 240) transitions.
// Phase 1: matrix 600 rows 364 cols
[2024-06-01 16:14:15] [INFO ] Computed 21 invariants in 5 ms
[2024-06-01 16:14:16] [INFO ] Implicit Places using invariants in 533 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 547 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 363/380 places, 600/840 transitions.
Applied a total of 0 rules in 14 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 591 ms. Remains : 363/380 places, 600/840 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p3), (NOT p2), (OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 157 ms.
Stack based approach found an accepted trace after 88 steps with 0 reset with depth 89 and stack size 89 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-12 finished in 997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(F(!p0))||(!p1&&F(!p0)))))))))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 566
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 566
Applied a total of 36 rules in 12 ms. Remains 362 /380 variables (removed 18) and now considering 566/840 (removed 274) transitions.
// Phase 1: matrix 566 rows 362 cols
[2024-06-01 16:14:16] [INFO ] Computed 21 invariants in 5 ms
[2024-06-01 16:14:17] [INFO ] Implicit Places using invariants in 581 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 583 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 361/380 places, 566/840 transitions.
Applied a total of 0 rules in 5 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 601 ms. Remains : 361/380 places, 566/840 transitions.
Stuttering acceptance computed with spot in 224 ms :[p0, p0, p0, p0, p0, p0]
Running random walk in product with property : Anderson-PT-09-LTLFireability-13
Product exploration explored 100000 steps with 20000 reset in 233 ms.
Product exploration explored 100000 steps with 20000 reset in 232 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[p0, p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/2 properties
BEST_FIRST walk for 31109 steps (6 resets) in 29 ms. (1036 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 219 ms :[p0, p0, p0, p0, p0, p0]
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 566/566 transitions.
Applied a total of 0 rules in 5 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
// Phase 1: matrix 566 rows 361 cols
[2024-06-01 16:14:19] [INFO ] Computed 20 invariants in 4 ms
[2024-06-01 16:14:19] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-06-01 16:14:19] [INFO ] Invariant cache hit.
[2024-06-01 16:14:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:14:21] [INFO ] Implicit Places using invariants and state equation in 2096 ms returned []
Implicit Place search using SMT with State Equation took 2531 ms to find 0 implicit places.
Running 557 sub problems to find dead transitions.
[2024-06-01 16:14:21] [INFO ] Invariant cache hit.
[2024-06-01 16:14:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-01 16:14:28] [INFO ] Deduced a trap composed of 212 places in 315 ms of which 4 ms to minimize.
[2024-06-01 16:14:28] [INFO ] Deduced a trap composed of 160 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:14:28] [INFO ] Deduced a trap composed of 108 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:14:29] [INFO ] Deduced a trap composed of 126 places in 403 ms of which 6 ms to minimize.
[2024-06-01 16:14:29] [INFO ] Deduced a trap composed of 81 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:14:30] [INFO ] Deduced a trap composed of 218 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:14:30] [INFO ] Deduced a trap composed of 133 places in 323 ms of which 6 ms to minimize.
[2024-06-01 16:14:30] [INFO ] Deduced a trap composed of 168 places in 397 ms of which 5 ms to minimize.
[2024-06-01 16:14:31] [INFO ] Deduced a trap composed of 100 places in 297 ms of which 3 ms to minimize.
[2024-06-01 16:14:31] [INFO ] Deduced a trap composed of 183 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:14:31] [INFO ] Deduced a trap composed of 210 places in 380 ms of which 4 ms to minimize.
[2024-06-01 16:14:32] [INFO ] Deduced a trap composed of 108 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:14:32] [INFO ] Deduced a trap composed of 200 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:14:32] [INFO ] Deduced a trap composed of 208 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:14:33] [INFO ] Deduced a trap composed of 190 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:14:33] [INFO ] Deduced a trap composed of 221 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:14:34] [INFO ] Deduced a trap composed of 190 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:14:34] [INFO ] Deduced a trap composed of 122 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:14:34] [INFO ] Deduced a trap composed of 206 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:14:35] [INFO ] Deduced a trap composed of 116 places in 287 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-01 16:14:37] [INFO ] Deduced a trap composed of 66 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 165 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 145 places in 319 ms of which 5 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 160 places in 385 ms of which 4 ms to minimize.
[2024-06-01 16:14:39] [INFO ] Deduced a trap composed of 166 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:14:39] [INFO ] Deduced a trap composed of 204 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:14:39] [INFO ] Deduced a trap composed of 108 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:14:40] [INFO ] Deduced a trap composed of 151 places in 386 ms of which 6 ms to minimize.
[2024-06-01 16:14:40] [INFO ] Deduced a trap composed of 190 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:14:41] [INFO ] Deduced a trap composed of 156 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:14:41] [INFO ] Deduced a trap composed of 176 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:14:41] [INFO ] Deduced a trap composed of 162 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:14:42] [INFO ] Deduced a trap composed of 210 places in 376 ms of which 5 ms to minimize.
[2024-06-01 16:14:42] [INFO ] Deduced a trap composed of 209 places in 326 ms of which 4 ms to minimize.
[2024-06-01 16:14:42] [INFO ] Deduced a trap composed of 182 places in 289 ms of which 3 ms to minimize.
[2024-06-01 16:14:43] [INFO ] Deduced a trap composed of 106 places in 344 ms of which 5 ms to minimize.
[2024-06-01 16:14:43] [INFO ] Deduced a trap composed of 223 places in 290 ms of which 3 ms to minimize.
[2024-06-01 16:14:43] [INFO ] Deduced a trap composed of 247 places in 319 ms of which 5 ms to minimize.
[2024-06-01 16:14:44] [INFO ] Deduced a trap composed of 198 places in 380 ms of which 4 ms to minimize.
[2024-06-01 16:14:44] [INFO ] Deduced a trap composed of 161 places in 293 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-01 16:14:51] [INFO ] Deduced a trap composed of 165 places in 303 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/927 variables, and 61 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 41/61 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-01 16:14:56] [INFO ] Deduced a trap composed of 130 places in 310 ms of which 3 ms to minimize.
[2024-06-01 16:14:56] [INFO ] Deduced a trap composed of 113 places in 301 ms of which 3 ms to minimize.
[2024-06-01 16:14:57] [INFO ] Deduced a trap composed of 131 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:14:57] [INFO ] Deduced a trap composed of 143 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:14:58] [INFO ] Deduced a trap composed of 163 places in 358 ms of which 5 ms to minimize.
[2024-06-01 16:14:58] [INFO ] Deduced a trap composed of 162 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:14:58] [INFO ] Deduced a trap composed of 160 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:14:59] [INFO ] Deduced a trap composed of 120 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:14:59] [INFO ] Deduced a trap composed of 154 places in 292 ms of which 3 ms to minimize.
[2024-06-01 16:14:59] [INFO ] Deduced a trap composed of 176 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 171 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 144 places in 292 ms of which 3 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 186 places in 303 ms of which 4 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 155 places in 214 ms of which 7 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 158 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 128 places in 197 ms of which 4 ms to minimize.
[2024-06-01 16:15:02] [INFO ] Deduced a trap composed of 194 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:15:02] [INFO ] Deduced a trap composed of 247 places in 292 ms of which 3 ms to minimize.
[2024-06-01 16:15:02] [INFO ] Deduced a trap composed of 173 places in 298 ms of which 6 ms to minimize.
[2024-06-01 16:15:03] [INFO ] Deduced a trap composed of 232 places in 391 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/927 variables, and 81 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/557 constraints, Known Traps: 61/61 constraints]
After SMT, in 60298ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60303ms
Finished structural reductions in LTL mode , in 1 iterations and 62841 ms. Remains : 361/361 places, 566/566 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[p0, p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-06-01 16:15:22] [INFO ] Invariant cache hit.
[2024-06-01 16:15:22] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/353 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/361 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 566/927 variables, 361/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 72/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/927 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 927/927 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 342/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/353 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/361 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 566/927 variables, 361/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 72/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 927/927 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1406 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1850ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 566/566 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 361 transition count 503
Reduce places removed 63 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 71 rules applied. Total rules applied 134 place count 298 transition count 495
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 142 place count 290 transition count 495
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 142 place count 290 transition count 424
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 284 place count 219 transition count 424
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 293 place count 219 transition count 415
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 302 place count 210 transition count 415
Applied a total of 302 rules in 26 ms. Remains 210 /361 variables (removed 151) and now considering 415/566 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 210/361 places, 415/566 transitions.
RANDOM walk for 40000 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37804 steps (8 resets) in 34 ms. (1080 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 217 ms :[p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 220 ms :[p0, p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 20000 reset in 217 ms.
Product exploration explored 100000 steps with 20000 reset in 234 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 213 ms :[p0, p0, p0, p0, p0, p0]
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 566/566 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 361 transition count 566
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 71 Pre rules applied. Total rules applied 71 place count 361 transition count 566
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 142 place count 361 transition count 566
Deduced a syphon composed of 142 places in 1 ms
Applied a total of 142 rules in 17 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2024-06-01 16:15:25] [INFO ] Redundant transitions in 4 ms returned []
Running 557 sub problems to find dead transitions.
// Phase 1: matrix 566 rows 361 cols
[2024-06-01 16:15:25] [INFO ] Computed 20 invariants in 4 ms
[2024-06-01 16:15:25] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-01 16:15:31] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:15:31] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
[2024-06-01 16:15:31] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 16:15:31] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 16:15:31] [INFO ] Deduced a trap composed of 28 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:15:31] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:15:31] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 16:15:32] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 16:15:32] [INFO ] Deduced a trap composed of 46 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:15:32] [INFO ] Deduced a trap composed of 54 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:15:33] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:15:33] [INFO ] Deduced a trap composed of 60 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:15:33] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 16:15:33] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 16:15:34] [INFO ] Deduced a trap composed of 65 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:15:35] [INFO ] Deduced a trap composed of 69 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:15:35] [INFO ] Deduced a trap composed of 59 places in 368 ms of which 5 ms to minimize.
[2024-06-01 16:15:36] [INFO ] Deduced a trap composed of 62 places in 356 ms of which 5 ms to minimize.
[2024-06-01 16:15:36] [INFO ] Deduced a trap composed of 47 places in 338 ms of which 4 ms to minimize.
[2024-06-01 16:15:36] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 3 ms to minimize.
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 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 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 TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 20/40 constraints. Problems are: Problem set: 142 solved, 415 unsolved
[2024-06-01 16:15:38] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:15:38] [INFO ] Deduced a trap composed of 72 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:15:38] [INFO ] Deduced a trap composed of 77 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:15:39] [INFO ] Deduced a trap composed of 61 places in 353 ms of which 5 ms to minimize.
[2024-06-01 16:15:40] [INFO ] Deduced a trap composed of 73 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:15:40] [INFO ] Deduced a trap composed of 58 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:15:41] [INFO ] Deduced a trap composed of 60 places in 317 ms of which 6 ms to minimize.
[2024-06-01 16:15:41] [INFO ] Deduced a trap composed of 76 places in 317 ms of which 4 ms to minimize.
[2024-06-01 16:15:41] [INFO ] Deduced a trap composed of 66 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:15:42] [INFO ] Deduced a trap composed of 77 places in 369 ms of which 6 ms to minimize.
[2024-06-01 16:15:42] [INFO ] Deduced a trap composed of 74 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:15:42] [INFO ] Deduced a trap composed of 81 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:15:43] [INFO ] Deduced a trap composed of 53 places in 333 ms of which 3 ms to minimize.
[2024-06-01 16:15:43] [INFO ] Deduced a trap composed of 68 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:15:44] [INFO ] Deduced a trap composed of 68 places in 367 ms of which 6 ms to minimize.
[2024-06-01 16:15:44] [INFO ] Deduced a trap composed of 70 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:15:44] [INFO ] Deduced a trap composed of 114 places in 287 ms of which 6 ms to minimize.
[2024-06-01 16:15:45] [INFO ] Deduced a trap composed of 73 places in 383 ms of which 5 ms to minimize.
[2024-06-01 16:15:45] [INFO ] Deduced a trap composed of 62 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:15:45] [INFO ] Deduced a trap composed of 82 places in 291 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/60 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/60 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 566/927 variables, 361/421 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 134/555 constraints. Problems are: Problem set: 142 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 927/927 variables, and 555 constraints, problems are : Problem set: 142 solved, 415 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 142 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 40/40 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 0/40 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 142/361 variables, 11/51 constraints. Problems are: Problem set: 142 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 9/60 constraints. Problems are: Problem set: 142 solved, 415 unsolved
[2024-06-01 16:16:00] [INFO ] Deduced a trap composed of 63 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:16:01] [INFO ] Deduced a trap composed of 58 places in 285 ms of which 3 ms to minimize.
[2024-06-01 16:16:02] [INFO ] Deduced a trap composed of 76 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:16:03] [INFO ] Deduced a trap composed of 77 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:16:03] [INFO ] Deduced a trap composed of 77 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:16:03] [INFO ] Deduced a trap composed of 69 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:16:04] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:16:05] [INFO ] Deduced a trap composed of 69 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:16:05] [INFO ] Deduced a trap composed of 68 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:16:05] [INFO ] Deduced a trap composed of 54 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:16:06] [INFO ] Deduced a trap composed of 83 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:16:06] [INFO ] Deduced a trap composed of 60 places in 354 ms of which 4 ms to minimize.
[2024-06-01 16:16:06] [INFO ] Deduced a trap composed of 63 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:16:07] [INFO ] Deduced a trap composed of 74 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:16:07] [INFO ] Deduced a trap composed of 73 places in 345 ms of which 3 ms to minimize.
[2024-06-01 16:16:07] [INFO ] Deduced a trap composed of 62 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:16:08] [INFO ] Deduced a trap composed of 75 places in 195 ms of which 4 ms to minimize.
[2024-06-01 16:16:08] [INFO ] Deduced a trap composed of 75 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:16:08] [INFO ] Deduced a trap composed of 68 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:16:09] [INFO ] Deduced a trap composed of 73 places in 216 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/80 constraints. Problems are: Problem set: 142 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/927 variables, and 80 constraints, problems are : Problem set: 142 solved, 415 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, ReadFeed: 0/134 constraints, PredecessorRefiner: 0/557 constraints, Known Traps: 60/60 constraints]
After SMT, in 60366ms problems are : Problem set: 142 solved, 415 unsolved
Search for dead transitions found 142 dead transitions in 60372ms
Found 142 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 142 transitions
Dead transitions reduction (with SMT) removed 142 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 361/361 places, 424/566 transitions.
Graph (complete) has 1124 edges and 361 vertex of which 219 are kept as prefixes of interest. Removing 142 places using SCC suffix rule.0 ms
Discarding 142 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 219 /361 variables (removed 142) and now considering 424/424 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 219/361 places, 424/566 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60407 ms. Remains : 219/361 places, 424/566 transitions.
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 566/566 transitions.
Applied a total of 0 rules in 5 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
// Phase 1: matrix 566 rows 361 cols
[2024-06-01 16:16:26] [INFO ] Computed 20 invariants in 4 ms
[2024-06-01 16:16:26] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-06-01 16:16:26] [INFO ] Invariant cache hit.
[2024-06-01 16:16:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:16:28] [INFO ] Implicit Places using invariants and state equation in 1998 ms returned []
Implicit Place search using SMT with State Equation took 2440 ms to find 0 implicit places.
Running 557 sub problems to find dead transitions.
[2024-06-01 16:16:28] [INFO ] Invariant cache hit.
[2024-06-01 16:16:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-01 16:16:35] [INFO ] Deduced a trap composed of 212 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:16:36] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:16:36] [INFO ] Deduced a trap composed of 108 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:16:36] [INFO ] Deduced a trap composed of 126 places in 299 ms of which 3 ms to minimize.
[2024-06-01 16:16:37] [INFO ] Deduced a trap composed of 81 places in 380 ms of which 5 ms to minimize.
[2024-06-01 16:16:37] [INFO ] Deduced a trap composed of 218 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:16:37] [INFO ] Deduced a trap composed of 133 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:16:38] [INFO ] Deduced a trap composed of 168 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:16:38] [INFO ] Deduced a trap composed of 100 places in 357 ms of which 6 ms to minimize.
[2024-06-01 16:16:38] [INFO ] Deduced a trap composed of 183 places in 339 ms of which 4 ms to minimize.
[2024-06-01 16:16:39] [INFO ] Deduced a trap composed of 210 places in 299 ms of which 3 ms to minimize.
[2024-06-01 16:16:39] [INFO ] Deduced a trap composed of 108 places in 387 ms of which 5 ms to minimize.
[2024-06-01 16:16:40] [INFO ] Deduced a trap composed of 200 places in 307 ms of which 3 ms to minimize.
[2024-06-01 16:16:40] [INFO ] Deduced a trap composed of 208 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:16:40] [INFO ] Deduced a trap composed of 190 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:16:41] [INFO ] Deduced a trap composed of 221 places in 389 ms of which 6 ms to minimize.
[2024-06-01 16:16:41] [INFO ] Deduced a trap composed of 190 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:16:41] [INFO ] Deduced a trap composed of 122 places in 303 ms of which 3 ms to minimize.
[2024-06-01 16:16:42] [INFO ] Deduced a trap composed of 206 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:16:42] [INFO ] Deduced a trap composed of 116 places in 292 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 557 unsolved
[2024-06-01 16:16:45] [INFO ] Deduced a trap composed of 66 places in 288 ms of which 3 ms to minimize.
[2024-06-01 16:16:45] [INFO ] Deduced a trap composed of 165 places in 287 ms of which 3 ms to minimize.
[2024-06-01 16:16:46] [INFO ] Deduced a trap composed of 145 places in 335 ms of which 5 ms to minimize.
[2024-06-01 16:16:46] [INFO ] Deduced a trap composed of 160 places in 365 ms of which 4 ms to minimize.
[2024-06-01 16:16:46] [INFO ] Deduced a trap composed of 166 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:16:47] [INFO ] Deduced a trap composed of 204 places in 343 ms of which 6 ms to minimize.
[2024-06-01 16:16:47] [INFO ] Deduced a trap composed of 108 places in 357 ms of which 4 ms to minimize.
[2024-06-01 16:16:47] [INFO ] Deduced a trap composed of 151 places in 285 ms of which 3 ms to minimize.
[2024-06-01 16:16:48] [INFO ] Deduced a trap composed of 190 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:16:48] [INFO ] Deduced a trap composed of 156 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:16:48] [INFO ] Deduced a trap composed of 176 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:16:49] [INFO ] Deduced a trap composed of 162 places in 279 ms of which 3 ms to minimize.
[2024-06-01 16:16:49] [INFO ] Deduced a trap composed of 210 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:16:49] [INFO ] Deduced a trap composed of 209 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:16:50] [INFO ] Deduced a trap composed of 182 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:16:50] [INFO ] Deduced a trap composed of 106 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:16:50] [INFO ] Deduced a trap composed of 223 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:16:51] [INFO ] Deduced a trap composed of 247 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:16:51] [INFO ] Deduced a trap composed of 198 places in 288 ms of which 5 ms to minimize.
[2024-06-01 16:16:51] [INFO ] Deduced a trap composed of 161 places in 377 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/927 variables, and 60 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/927 variables, and 60 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/557 constraints, Known Traps: 40/40 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Finished structural reductions in LTL mode , in 1 iterations and 62755 ms. Remains : 361/361 places, 566/566 transitions.
Treatment of property Anderson-PT-09-LTLFireability-13 finished in 192232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 380 transition count 768
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 308 transition count 768
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 162 place count 290 transition count 494
Iterating global reduction 0 with 18 rules applied. Total rules applied 180 place count 290 transition count 494
Applied a total of 180 rules in 21 ms. Remains 290 /380 variables (removed 90) and now considering 494/840 (removed 346) transitions.
// Phase 1: matrix 494 rows 290 cols
[2024-06-01 16:17:28] [INFO ] Computed 21 invariants in 4 ms
[2024-06-01 16:17:29] [INFO ] Implicit Places using invariants in 483 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 489 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/380 places, 494/840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 289 transition count 414
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 209 transition count 414
Applied a total of 160 rules in 9 ms. Remains 209 /289 variables (removed 80) and now considering 414/494 (removed 80) transitions.
// Phase 1: matrix 414 rows 209 cols
[2024-06-01 16:17:29] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 16:17:29] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 16:17:29] [INFO ] Invariant cache hit.
[2024-06-01 16:17:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:17:30] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/380 places, 414/840 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1992 ms. Remains : 209/380 places, 414/840 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 264 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 57 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-14 finished in 2327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||G(p2)||p0)))))'
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 363 transition count 567
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 363 transition count 567
Applied a total of 34 rules in 18 ms. Remains 363 /380 variables (removed 17) and now considering 567/840 (removed 273) transitions.
// Phase 1: matrix 567 rows 363 cols
[2024-06-01 16:17:31] [INFO ] Computed 21 invariants in 6 ms
[2024-06-01 16:17:32] [INFO ] Implicit Places using invariants in 882 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 891 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 567/840 transitions.
Applied a total of 0 rules in 8 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 918 ms. Remains : 362/380 places, 567/840 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 383 ms.
Product exploration explored 100000 steps with 33333 reset in 400 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 22 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-15 finished in 1928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((F(p1)||p0)))&&(!p2 U (p3||G(!p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&X(X(X(!p1))))||G(!p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(F(!p0))||(!p1&&F(!p0)))))))))'
Found a Shortening insensitive property : Anderson-PT-09-LTLFireability-13
Stuttering acceptance computed with spot in 311 ms :[p0, p0, p0, p0, p0, p0]
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 380/380 places, 840/840 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 380 transition count 769
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 309 transition count 769
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 160 place count 291 transition count 495
Iterating global reduction 0 with 18 rules applied. Total rules applied 178 place count 291 transition count 495
Applied a total of 178 rules in 34 ms. Remains 291 /380 variables (removed 89) and now considering 495/840 (removed 345) transitions.
// Phase 1: matrix 495 rows 291 cols
[2024-06-01 16:17:34] [INFO ] Computed 21 invariants in 6 ms
[2024-06-01 16:17:35] [INFO ] Implicit Places using invariants in 721 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 737 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 290/380 places, 495/840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 290 transition count 432
Reduce places removed 63 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 71 rules applied. Total rules applied 134 place count 227 transition count 424
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 142 place count 219 transition count 424
Applied a total of 142 rules in 9 ms. Remains 219 /290 variables (removed 71) and now considering 424/495 (removed 71) transitions.
// Phase 1: matrix 424 rows 219 cols
[2024-06-01 16:17:35] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 16:17:35] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-06-01 16:17:35] [INFO ] Invariant cache hit.
[2024-06-01 16:17:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:17:36] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 219/380 places, 424/840 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2380 ms. Remains : 219/380 places, 424/840 transitions.
Running random walk in product with property : Anderson-PT-09-LTLFireability-13
Product exploration explored 100000 steps with 20000 reset in 311 ms.
Product exploration explored 100000 steps with 20000 reset in 350 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[p0, p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
[2024-06-01 16:17:38] [INFO ] Invariant cache hit.
[2024-06-01 16:17:38] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 200/204 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/211 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/219 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 424/643 variables, 219/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 72/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/643 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 219/219 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 200/204 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/211 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/219 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 424/643 variables, 219/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 72/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/643 variables, and 312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 219/219 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 424/424 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 219 transition count 415
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 210 transition count 415
Applied a total of 18 rules in 16 ms. Remains 210 /219 variables (removed 9) and now considering 415/424 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 210/219 places, 415/424 transitions.
RANDOM walk for 40000 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 49012 steps, run visited all 1 properties in 133 ms. (steps per millisecond=368 )
Probabilistic random walk after 49012 steps, saw 36171 distinct states, run finished after 140 ms. (steps per millisecond=350 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 317 ms :[p0, p0, p0, p0, p0, p0]
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 424/424 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-01 16:17:40] [INFO ] Invariant cache hit.
[2024-06-01 16:17:41] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-06-01 16:17:41] [INFO ] Invariant cache hit.
[2024-06-01 16:17:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:17:42] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-06-01 16:17:42] [INFO ] Invariant cache hit.
[2024-06-01 16:17:42] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:17:46] [INFO ] Deduced a trap composed of 92 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:17:48] [INFO ] Deduced a trap composed of 53 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:17:48] [INFO ] Deduced a trap composed of 58 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:17:49] [INFO ] Deduced a trap composed of 52 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:17:49] [INFO ] Deduced a trap composed of 44 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:17:50] [INFO ] Deduced a trap composed of 61 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:17:50] [INFO ] Deduced a trap composed of 62 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:17:50] [INFO ] Deduced a trap composed of 62 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:17:51] [INFO ] Deduced a trap composed of 59 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:17:51] [INFO ] Deduced a trap composed of 61 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:17:51] [INFO ] Deduced a trap composed of 58 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:17:51] [INFO ] Deduced a trap composed of 63 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:17:52] [INFO ] Deduced a trap composed of 87 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:17:52] [INFO ] Deduced a trap composed of 51 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:17:52] [INFO ] Deduced a trap composed of 61 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:17:53] [INFO ] Deduced a trap composed of 80 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:17:53] [INFO ] Deduced a trap composed of 61 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:17:53] [INFO ] Deduced a trap composed of 77 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:17:53] [INFO ] Deduced a trap composed of 80 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:17:54] [INFO ] Deduced a trap composed of 56 places in 271 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:17:57] [INFO ] Deduced a trap composed of 57 places in 289 ms of which 3 ms to minimize.
[2024-06-01 16:17:57] [INFO ] Deduced a trap composed of 74 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:17:57] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:17:58] [INFO ] Deduced a trap composed of 82 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:17:58] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:17:58] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:17:58] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:17:58] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:17:58] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:17:59] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 2 ms to minimize.
[2024-06-01 16:17:59] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:17:59] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 2 ms to minimize.
[2024-06-01 16:17:59] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 2 ms to minimize.
[2024-06-01 16:18:00] [INFO ] Deduced a trap composed of 62 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:18:00] [INFO ] Deduced a trap composed of 64 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:18:03] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:18:04] [INFO ] Deduced a trap composed of 72 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:18:06] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:18:07] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:18:07] [INFO ] Deduced a trap composed of 66 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:18:09] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:18:09] [INFO ] Deduced a trap composed of 74 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:18:10] [INFO ] Deduced a trap composed of 62 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:18:10] [INFO ] Deduced a trap composed of 83 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:18:10] [INFO ] Deduced a trap composed of 87 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:18:10] [INFO ] Deduced a trap composed of 81 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:18:11] [INFO ] Deduced a trap composed of 60 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:18:11] [INFO ] Deduced a trap composed of 57 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:18:11] [INFO ] Deduced a trap composed of 53 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:18:12] [INFO ] Deduced a trap composed of 53 places in 284 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 219/643 variables, and 70 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/219 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 219/643 variables, and 70 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/219 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/415 constraints, Known Traps: 50/50 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60267ms
Finished structural reductions in LTL mode , in 1 iterations and 61864 ms. Remains : 219/219 places, 424/424 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[p0, p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/2 properties
BEST_FIRST walk for 21845 steps (4 resets) in 20 ms. (1040 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 213 ms :[p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 216 ms :[p0, p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 20000 reset in 211 ms.
Product exploration explored 100000 steps with 20000 reset in 214 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 206 ms :[p0, p0, p0, p0, p0, p0]
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 424/424 transitions.
Applied a total of 0 rules in 5 ms. Remains 219 /219 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-01 16:18:44] [INFO ] Redundant transitions in 2 ms returned []
Running 415 sub problems to find dead transitions.
[2024-06-01 16:18:44] [INFO ] Invariant cache hit.
[2024-06-01 16:18:44] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:18:48] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:18:49] [INFO ] Deduced a trap composed of 53 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:18:49] [INFO ] Deduced a trap composed of 58 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:18:49] [INFO ] Deduced a trap composed of 52 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:18:50] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:18:51] [INFO ] Deduced a trap composed of 61 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:18:51] [INFO ] Deduced a trap composed of 62 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:18:51] [INFO ] Deduced a trap composed of 62 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:18:52] [INFO ] Deduced a trap composed of 59 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:18:52] [INFO ] Deduced a trap composed of 61 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:18:52] [INFO ] Deduced a trap composed of 58 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:18:52] [INFO ] Deduced a trap composed of 63 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:18:53] [INFO ] Deduced a trap composed of 87 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:18:53] [INFO ] Deduced a trap composed of 51 places in 289 ms of which 3 ms to minimize.
[2024-06-01 16:18:53] [INFO ] Deduced a trap composed of 61 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:18:54] [INFO ] Deduced a trap composed of 80 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:18:54] [INFO ] Deduced a trap composed of 61 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:18:54] [INFO ] Deduced a trap composed of 77 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:18:54] [INFO ] Deduced a trap composed of 80 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:18:55] [INFO ] Deduced a trap composed of 56 places in 269 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:18:58] [INFO ] Deduced a trap composed of 57 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:18:59] [INFO ] Deduced a trap composed of 74 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:18:59] [INFO ] Deduced a trap composed of 80 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:18:59] [INFO ] Deduced a trap composed of 82 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:18:59] [INFO ] Deduced a trap composed of 77 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:19:00] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:19:00] [INFO ] Deduced a trap composed of 58 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:19:00] [INFO ] Deduced a trap composed of 47 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:19:01] [INFO ] Deduced a trap composed of 46 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:19:01] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:19:01] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:19:01] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:19:01] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:19:02] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 4 ms to minimize.
[2024-06-01 16:19:03] [INFO ] Deduced a trap composed of 64 places in 214 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:19:08] [INFO ] Deduced a trap composed of 89 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:19:08] [INFO ] Deduced a trap composed of 72 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:19:10] [INFO ] Deduced a trap composed of 39 places in 280 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:19:12] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:19:12] [INFO ] Deduced a trap composed of 66 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:19:14] [INFO ] Deduced a trap composed of 65 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:19:14] [INFO ] Deduced a trap composed of 74 places in 289 ms of which 4 ms to minimize.
SMT process timed out in 30304ms, After SMT, problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 30309ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30324 ms. Remains : 219/219 places, 424/424 transitions.
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 424/424 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-01 16:19:14] [INFO ] Invariant cache hit.
[2024-06-01 16:19:15] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-06-01 16:19:15] [INFO ] Invariant cache hit.
[2024-06-01 16:19:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 16:19:16] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1686 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-06-01 16:19:16] [INFO ] Invariant cache hit.
[2024-06-01 16:19:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:19:21] [INFO ] Deduced a trap composed of 92 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:19:22] [INFO ] Deduced a trap composed of 53 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:19:23] [INFO ] Deduced a trap composed of 58 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:19:23] [INFO ] Deduced a trap composed of 52 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:19:24] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:19:24] [INFO ] Deduced a trap composed of 61 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:19:25] [INFO ] Deduced a trap composed of 62 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:19:25] [INFO ] Deduced a trap composed of 62 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:19:25] [INFO ] Deduced a trap composed of 59 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:19:26] [INFO ] Deduced a trap composed of 61 places in 297 ms of which 3 ms to minimize.
[2024-06-01 16:19:26] [INFO ] Deduced a trap composed of 58 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:19:26] [INFO ] Deduced a trap composed of 63 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:19:27] [INFO ] Deduced a trap composed of 87 places in 292 ms of which 3 ms to minimize.
[2024-06-01 16:19:27] [INFO ] Deduced a trap composed of 51 places in 290 ms of which 3 ms to minimize.
[2024-06-01 16:19:27] [INFO ] Deduced a trap composed of 61 places in 216 ms of which 2 ms to minimize.
[2024-06-01 16:19:27] [INFO ] Deduced a trap composed of 80 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:19:28] [INFO ] Deduced a trap composed of 61 places in 232 ms of which 2 ms to minimize.
[2024-06-01 16:19:28] [INFO ] Deduced a trap composed of 77 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:19:28] [INFO ] Deduced a trap composed of 80 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:19:29] [INFO ] Deduced a trap composed of 56 places in 278 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:19:32] [INFO ] Deduced a trap composed of 57 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:19:33] [INFO ] Deduced a trap composed of 74 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:19:33] [INFO ] Deduced a trap composed of 80 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:19:33] [INFO ] Deduced a trap composed of 82 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:19:33] [INFO ] Deduced a trap composed of 77 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:19:34] [INFO ] Deduced a trap composed of 65 places in 308 ms of which 4 ms to minimize.
[2024-06-01 16:19:34] [INFO ] Deduced a trap composed of 58 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:19:34] [INFO ] Deduced a trap composed of 47 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:19:35] [INFO ] Deduced a trap composed of 46 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:19:35] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:19:35] [INFO ] Deduced a trap composed of 45 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:19:36] [INFO ] Deduced a trap composed of 54 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:19:36] [INFO ] Deduced a trap composed of 52 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:19:37] [INFO ] Deduced a trap composed of 62 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:19:37] [INFO ] Deduced a trap composed of 64 places in 294 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:19:42] [INFO ] Deduced a trap composed of 89 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:19:43] [INFO ] Deduced a trap composed of 72 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:19:45] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-01 16:19:46] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:19:46] [INFO ] Deduced a trap composed of 66 places in 216 ms of which 4 ms to minimize.
SMT process timed out in 30435ms, After SMT, problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 30440ms
Finished structural reductions in LTL mode , in 1 iterations and 32133 ms. Remains : 219/219 places, 424/424 transitions.
Treatment of property Anderson-PT-09-LTLFireability-13 finished in 132946 ms.
[2024-06-01 16:19:47] [INFO ] Flatten gal took : 97 ms
[2024-06-01 16:19:47] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-01 16:19:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 380 places, 840 transitions and 3212 arcs took 20 ms.
Total runtime 1113655 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Anderson-PT-09-LTLFireability-04
Could not compute solution for formula : Anderson-PT-09-LTLFireability-08
Could not compute solution for formula : Anderson-PT-09-LTLFireability-09
Could not compute solution for formula : Anderson-PT-09-LTLFireability-10
FORMULA Anderson-PT-09-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717259239051
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Anderson-PT-09-LTLFireability-04
ltl formula formula --ltl=/tmp/5661/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 380 places, 840 transitions and 3212 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.040 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5661/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5661/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5661/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5661/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 382 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 381, there are 849 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2149 levels ~10000 states ~26568 transitions
pnml2lts-mc( 1/ 4): ~4464 levels ~20000 states ~52776 transitions
pnml2lts-mc( 1/ 4): ~8751 levels ~40000 states ~110856 transitions
pnml2lts-mc( 1/ 4): ~17139 levels ~80000 states ~227136 transitions
pnml2lts-mc( 1/ 4): ~34063 levels ~160000 states ~450864 transitions
pnml2lts-mc( 1/ 4): ~67260 levels ~320000 states ~909988 transitions
pnml2lts-mc( 1/ 4): ~135948 levels ~640000 states ~1824500 transitions
pnml2lts-mc( 1/ 4): ~272718 levels ~1280000 states ~3671628 transitions
pnml2lts-mc( 1/ 4): ~542591 levels ~2560000 states ~7417776 transitions
pnml2lts-mc( 1/ 4): ~1087400 levels ~5120000 states ~14928788 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2163
pnml2lts-mc( 0/ 4): unique states count: 5759972
pnml2lts-mc( 0/ 4): unique transitions count: 16990433
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1722
pnml2lts-mc( 0/ 4): - claim found count: 6395933
pnml2lts-mc( 0/ 4): - claim success count: 5759987
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4933086
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5759995 states 16990533 transitions, fanout: 2.950
pnml2lts-mc( 0/ 4): Total exploration time 105.520 sec (105.510 sec minimum, 105.515 sec on average)
pnml2lts-mc( 0/ 4): States per second: 54587, Transitions per second: 161017
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 137.5MB, 15.0 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 28.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 852 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 137.5MB (~256.0MB paged-in)
ltl formula name Anderson-PT-09-LTLFireability-08
ltl formula formula --ltl=/tmp/5661/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 380 places, 840 transitions and 3212 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5661/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5661/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5661/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5661/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 381 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 381, there are 867 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2151 levels ~10000 states ~24736 transitions
pnml2lts-mc( 3/ 4): ~4240 levels ~20000 states ~52220 transitions
pnml2lts-mc( 0/ 4): ~8692 levels ~40000 states ~108124 transitions
pnml2lts-mc( 0/ 4): ~17267 levels ~80000 states ~224056 transitions
pnml2lts-mc( 0/ 4): ~34555 levels ~160000 states ~454608 transitions
pnml2lts-mc( 0/ 4): ~69197 levels ~320000 states ~894188 transitions
pnml2lts-mc( 0/ 4): ~137610 levels ~640000 states ~1783408 transitions
pnml2lts-mc( 0/ 4): ~275511 levels ~1280000 states ~3641084 transitions
pnml2lts-mc( 0/ 4): ~547165 levels ~2560000 states ~7270672 transitions
pnml2lts-mc( 0/ 4): ~1087082 levels ~5120000 states ~14667820 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 5854921
pnml2lts-mc( 0/ 4): unique transitions count: 17008849
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 6546482
pnml2lts-mc( 0/ 4): - claim success count: 5854930
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4944543
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5854938 states 17008936 transitions, fanout: 2.905
pnml2lts-mc( 0/ 4): Total exploration time 120.010 sec (119.990 sec minimum, 120.003 sec on average)
pnml2lts-mc( 0/ 4): States per second: 48787, Transitions per second: 141729
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 137.1MB, 15.0 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 28.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 852 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 137.1MB (~256.0MB paged-in)
ltl formula name Anderson-PT-09-LTLFireability-09
ltl formula formula --ltl=/tmp/5661/ltl_2_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 380 places, 840 transitions and 3212 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.040 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5661/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5661/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5661/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5661/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 382 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 381, there are 849 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2085 levels ~10000 states ~29240 transitions
pnml2lts-mc( 2/ 4): ~4217 levels ~20000 states ~58492 transitions
pnml2lts-mc( 2/ 4): ~8272 levels ~40000 states ~118908 transitions
pnml2lts-mc( 3/ 4): ~16894 levels ~80000 states ~225872 transitions
pnml2lts-mc( 3/ 4): ~33895 levels ~160000 states ~449608 transitions
pnml2lts-mc( 0/ 4): ~69510 levels ~320000 states ~875848 transitions
pnml2lts-mc( 0/ 4): ~139124 levels ~640000 states ~1797796 transitions
pnml2lts-mc( 0/ 4): ~278534 levels ~1280000 states ~3655300 transitions
pnml2lts-mc( 1/ 4): ~542755 levels ~2560000 states ~7586432 transitions
pnml2lts-mc( 1/ 4): ~1080925 levels ~5120000 states ~15317236 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12355
pnml2lts-mc( 0/ 4): unique states count: 5944755
pnml2lts-mc( 0/ 4): unique transitions count: 17715816
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 10923
pnml2lts-mc( 0/ 4): - claim found count: 6939933
pnml2lts-mc( 0/ 4): - claim success count: 5944767
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5003368
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5944771 states 17715879 transitions, fanout: 2.980
pnml2lts-mc( 0/ 4): Total exploration time 108.780 sec (108.760 sec minimum, 108.765 sec on average)
pnml2lts-mc( 0/ 4): States per second: 54649, Transitions per second: 162860
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 138.5MB, 14.9 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 852 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 138.5MB (~256.0MB paged-in)
ltl formula name Anderson-PT-09-LTLFireability-10
ltl formula formula --ltl=/tmp/5661/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 380 places, 840 transitions and 3212 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.030 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5661/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5661/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5661/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5661/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 13 states
pnml2lts-mc( 0/ 4): There are 381 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 381, there are 1363 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2196 levels ~10000 states ~25380 transitions
pnml2lts-mc( 3/ 4): ~4415 levels ~20000 states ~56240 transitions
pnml2lts-mc( 0/ 4): ~8587 levels ~40000 states ~113272 transitions
pnml2lts-mc( 0/ 4): ~17252 levels ~80000 states ~220952 transitions
pnml2lts-mc( 0/ 4): ~34347 levels ~160000 states ~458052 transitions
pnml2lts-mc( 0/ 4): ~69393 levels ~320000 states ~898984 transitions
pnml2lts-mc( 0/ 4): ~138785 levels ~640000 states ~1806000 transitions
pnml2lts-mc( 0/ 4): ~273013 levels ~1280000 states ~3705488 transitions
pnml2lts-mc( 0/ 4): ~541177 levels ~2560000 states ~7544492 transitions
pnml2lts-mc( 3/ 4): ~1073002 levels ~5120000 states ~14778352 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 49879
pnml2lts-mc( 0/ 4): unique states count: 6103099
pnml2lts-mc( 0/ 4): unique transitions count: 17993048
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 223377
pnml2lts-mc( 0/ 4): - claim found count: 7104270
pnml2lts-mc( 0/ 4): - claim success count: 6103116
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5084116
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6103131 states 17993134 transitions, fanout: 2.948
pnml2lts-mc( 0/ 4): Total exploration time 113.830 sec (113.800 sec minimum, 113.815 sec on average)
pnml2lts-mc( 0/ 4): States per second: 53616, Transitions per second: 158070
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 138.5MB, 14.9 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 852 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 138.5MB (~256.0MB paged-in)
ltl formula name Anderson-PT-09-LTLFireability-13
ltl formula formula --ltl=/tmp/5661/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 380 places, 840 transitions and 3212 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.030 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5661/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5661/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5661/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5661/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 382 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 381, there are 845 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5437
pnml2lts-mc( 0/ 4): unique states count: 5437
pnml2lts-mc( 0/ 4): unique transitions count: 6660
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1513
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5596
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5596 states 7485 transitions, fanout: 1.338
pnml2lts-mc( 0/ 4): Total exploration time 0.180 sec (0.180 sec minimum, 0.180 sec on average)
pnml2lts-mc( 0/ 4): States per second: 31089, Transitions per second: 41583
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 22.2 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 852 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
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="Anderson-PT-09"
export BK_EXAMINATION="LTLFireability"
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 Anderson-PT-09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620118400356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-09.tgz
mv Anderson-PT-09 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;