About the Execution of GreatSPN+red for DES-PT-20a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3675.819 | 1396673.00 | 1577132.00 | 3224.70 | TFFFTFFFTF?TFFFF | 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.r091-tall-171624188200684.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 greatspnxred
Input is DES-PT-20a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188200684
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 12 08:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 08:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 57K 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 DES-PT-20a-LTLFireability-00
FORMULA_NAME DES-PT-20a-LTLFireability-01
FORMULA_NAME DES-PT-20a-LTLFireability-02
FORMULA_NAME DES-PT-20a-LTLFireability-03
FORMULA_NAME DES-PT-20a-LTLFireability-04
FORMULA_NAME DES-PT-20a-LTLFireability-05
FORMULA_NAME DES-PT-20a-LTLFireability-06
FORMULA_NAME DES-PT-20a-LTLFireability-07
FORMULA_NAME DES-PT-20a-LTLFireability-08
FORMULA_NAME DES-PT-20a-LTLFireability-09
FORMULA_NAME DES-PT-20a-LTLFireability-10
FORMULA_NAME DES-PT-20a-LTLFireability-11
FORMULA_NAME DES-PT-20a-LTLFireability-12
FORMULA_NAME DES-PT-20a-LTLFireability-13
FORMULA_NAME DES-PT-20a-LTLFireability-14
FORMULA_NAME DES-PT-20a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716317571984
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 18:52:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 18:52:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:52:53] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-21 18:52:53] [INFO ] Transformed 195 places.
[2024-05-21 18:52:53] [INFO ] Transformed 152 transitions.
[2024-05-21 18:52:53] [INFO ] Found NUPN structural information;
[2024-05-21 18:52:53] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-20a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 39 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2024-05-21 18:52:53] [INFO ] Computed 59 invariants in 22 ms
[2024-05-21 18:52:53] [INFO ] Implicit Places using invariants in 294 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 324 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 387 ms. Remains : 193/195 places, 137/138 transitions.
Support contains 65 out of 193 places after structural reductions.
[2024-05-21 18:52:54] [INFO ] Flatten gal took : 44 ms
[2024-05-21 18:52:54] [INFO ] Flatten gal took : 19 ms
[2024-05-21 18:52:54] [INFO ] Input system was already deterministic with 137 transitions.
Support contains 62 out of 193 places (down from 65) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (881 resets) in 1237 ms. (32 steps per ms) remains 13/28 properties
BEST_FIRST walk for 40004 steps (179 resets) in 222 ms. (179 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (206 resets) in 244 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (202 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (248 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (180 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (176 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (255 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (202 resets) in 137 ms. (289 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (177 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (177 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (177 resets) in 72 ms. (547 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (205 resets) in 47 ms. (833 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (213 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 18:52:55] [INFO ] Computed 58 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 9/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 63/94 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 75/169 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 6/175 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 9 (OVERLAPS) 136/311 variables, 175/233 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 19/330 variables, 18/251 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 251 constraints, problems are : Problem set: 1 solved, 12 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 9/29 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 63/92 variables, 27/33 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 77/169 variables, 23/56 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 6/175 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 136/311 variables, 175/233 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 2/235 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-21 18:52:56] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 20 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 1/236 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 19/330 variables, 18/254 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 10/264 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 0/264 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/330 variables, 0/264 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 264 constraints, problems are : Problem set: 1 solved, 12 unsolved in 2940 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 3876ms problems are : Problem set: 1 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 10 properties in 6860 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 193 transition count 135
Applied a total of 6 rules in 21 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 40000 steps (545 resets) in 485 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (287 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (96 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1241880 steps, run timeout after 3001 ms. (steps per millisecond=413 ) properties seen :0 out of 2
Probabilistic random walk after 1241880 steps, saw 173669 distinct states, run finished after 3004 ms. (steps per millisecond=413 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 18:53:09] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 18:53:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/89 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/174 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 135/309 variables, 174/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 19/328 variables, 19/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 255 constraints, problems are : Problem set: 0 solved, 2 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/89 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/174 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 135/309 variables, 174/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 19/328 variables, 19/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 257 constraints, problems are : Problem set: 0 solved, 2 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 577ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 699 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 11 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-21 18:53:10] [INFO ] Invariant cache hit.
[2024-05-21 18:53:10] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 18:53:10] [INFO ] Invariant cache hit.
[2024-05-21 18:53:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:53:10] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-05-21 18:53:10] [INFO ] Redundant transitions in 4 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-21 18:53:10] [INFO ] Invariant cache hit.
[2024-05-21 18:53:10] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/328 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:53:12] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
[2024-05-21 18:53:12] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:53:12] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-21 18:53:12] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:53:13] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:53:15] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:53:16] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:53:16] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:53:16] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:53:18] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 4 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/328 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 14 (OVERLAPS) 0/328 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 265 constraints, problems are : Problem set: 0 solved, 134 unsolved in 10667 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:53:22] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-21 18:53:22] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:53:22] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 135/328 variables, 193/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 134/402 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:53:27] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:53:27] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:53:35] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:53:44] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 406 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 17/17 constraints]
After SMT, in 40755ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 40760ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41191 ms. Remains : 193/193 places, 135/135 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 18:53:51] [INFO ] Invariant cache hit.
[2024-05-21 18:53:51] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2024-05-21 18:53:51] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-21 18:53:51] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 18:53:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 18:53:51] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-21 18:53:51] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 18:53:51] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 18:53:51] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 331 ms.
FORMULA DES-PT-20a-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 96 stabilizing places and 91 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((!p0&&X((!p0 U (!p1||G(!p0)))))) U p2))'
Support contains 5 out of 193 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 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 18:53:52] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 18:53:52] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 18:53:52] [INFO ] Invariant cache hit.
[2024-05-21 18:53:52] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-21 18:53:52] [INFO ] Redundant transitions in 4 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 18:53:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:53:53] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:53:54] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:53:55] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:53:55] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:53:57] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6300 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:54:03] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29579 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 35940ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35942ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36450 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), true, p0]
Running random walk in product with property : DES-PT-20a-LTLFireability-01
Product exploration explored 100000 steps with 2245 reset in 310 ms.
Product exploration explored 100000 steps with 2235 reset in 264 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 224 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p2), true, p0]
RANDOM walk for 40000 steps (871 resets) in 220 ms. (180 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (203 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (202 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (177 resets) in 324 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (183 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 871210 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :0 out of 4
Probabilistic random walk after 871210 steps, saw 128626 distinct states, run finished after 3001 ms. (steps per millisecond=290 ) properties seen :0
[2024-05-21 18:54:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 71/80 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 85/165 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 6/171 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 136/307 variables, 171/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 23/330 variables, 22/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 251 constraints, problems are : Problem set: 0 solved, 4 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 71/80 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 85/165 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 18:54:33] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:54:33] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/171 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 136/307 variables, 171/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 23/330 variables, 22/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/330 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 257 constraints, problems are : Problem set: 0 solved, 4 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 772ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3765 ms.
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 193 transition count 135
Applied a total of 7 rules in 12 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 40000 steps (551 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (97 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (95 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (85 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (90 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 846812 steps, run timeout after 3002 ms. (steps per millisecond=282 ) properties seen :0 out of 4
Probabilistic random walk after 846812 steps, saw 120675 distinct states, run finished after 3003 ms. (steps per millisecond=281 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 18:54:40] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 18:54:40] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 88/174 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 135/309 variables, 174/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 18:54:41] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 18:54:41] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:54:41] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 19/328 variables, 19/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 258 constraints, problems are : Problem set: 0 solved, 4 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 88/174 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 135/309 variables, 174/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 18:54:41] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 19/328 variables, 19/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/328 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 263 constraints, problems are : Problem set: 0 solved, 4 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 929ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3496 ms.
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-21 18:54:45] [INFO ] Invariant cache hit.
[2024-05-21 18:54:45] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 18:54:45] [INFO ] Invariant cache hit.
[2024-05-21 18:54:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:54:45] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-21 18:54:45] [INFO ] Redundant transitions in 3 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-21 18:54:45] [INFO ] Invariant cache hit.
[2024-05-21 18:54:45] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/328 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:54:47] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-21 18:54:47] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:54:47] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:54:48] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
[2024-05-21 18:54:48] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
[2024-05-21 18:54:48] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:54:48] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:54:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-21 18:54:48] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:54:49] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:54:50] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 266 constraints, problems are : Problem set: 0 solved, 134 unsolved in 8043 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 135/328 variables, 193/264 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 134/400 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:54:59] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:55:07] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:55:09] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 403 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 14/14 constraints]
After SMT, in 38113ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 38115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38434 ms. Remains : 193/193 places, 135/135 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-21 18:55:23] [INFO ] Invariant cache hit.
[2024-05-21 18:55:23] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 18:55:23] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 18:55:23] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 18:55:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 18:55:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-21 18:55:24] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-21 18:55:24] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-05-21 18:55:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
TRAPS : Iteration 1
[2024-05-21 18:55:24] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-21 18:55:24] [INFO ] After 463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 554 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 237 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), true, p0]
Stuttering acceptance computed with spot in 75 ms :[(NOT p2), true, p0]
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 18:55:24] [INFO ] Computed 58 invariants in 9 ms
[2024-05-21 18:55:24] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-21 18:55:24] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 18:55:25] [INFO ] [Real]Absence check using state equation in 120 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 11 factoid took 284 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLFireability-01 finished in 93190 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(p0))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 18:55:25] [INFO ] Invariant cache hit.
[2024-05-21 18:55:25] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 18:55:25] [INFO ] Invariant cache hit.
[2024-05-21 18:55:25] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-21 18:55:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:55:26] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:55:27] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:55:28] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:55:28] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:55:30] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6481 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:55:37] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29752 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36279ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36281ms
Finished structural reductions in LTL mode , in 1 iterations and 36590 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-20a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-02 finished in 36684 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(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 18:56:02] [INFO ] Invariant cache hit.
[2024-05-21 18:56:02] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 18:56:02] [INFO ] Invariant cache hit.
[2024-05-21 18:56:02] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-21 18:56:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:56:02] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:56:04] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:56:04] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:56:04] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:56:06] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6370 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:56:13] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29728 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36137ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36139ms
Finished structural reductions in LTL mode , in 1 iterations and 36428 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-03 finished in 36535 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(p0))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 18:56:38] [INFO ] Invariant cache hit.
[2024-05-21 18:56:38] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 18:56:38] [INFO ] Invariant cache hit.
[2024-05-21 18:56:38] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-05-21 18:56:38] [INFO ] Redundant transitions in 4 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 18:56:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:56:39] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:56:40] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:56:41] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:56:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:56:43] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6329 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:56:50] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29507 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 35877ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35879ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36187 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLFireability-04
Product exploration explored 100000 steps with 18178 reset in 232 ms.
Product exploration explored 100000 steps with 18193 reset in 233 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 16 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-21 18:57:15] [INFO ] Invariant cache hit.
[2024-05-21 18:57:15] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-21 18:57:15] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 18:57:15] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-21 18:57:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:57:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 18:57:15] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 18:57:16] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2024-05-21 18:57:16] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 12 ms.
[2024-05-21 18:57:16] [INFO ] Added : 84 causal constraints over 17 iterations in 367 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 18:57:16] [INFO ] Invariant cache hit.
[2024-05-21 18:57:16] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 18:57:16] [INFO ] Invariant cache hit.
[2024-05-21 18:57:16] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-21 18:57:16] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 18:57:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:57:17] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:57:19] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:57:19] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:57:19] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:57:21] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6354 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:57:28] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29641 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36030ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36032ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36330 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 18 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-21 18:57:53] [INFO ] Invariant cache hit.
[2024-05-21 18:57:53] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 18:57:53] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 18:57:53] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-21 18:57:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:57:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-21 18:57:53] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 18:57:53] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2024-05-21 18:57:53] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 11 ms.
[2024-05-21 18:57:54] [INFO ] Added : 84 causal constraints over 17 iterations in 351 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18165 reset in 179 ms.
Product exploration explored 100000 steps with 18171 reset in 281 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 18:57:54] [INFO ] Invariant cache hit.
[2024-05-21 18:57:54] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 18:57:54] [INFO ] Invariant cache hit.
[2024-05-21 18:57:55] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-21 18:57:55] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 18:57:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:57:55] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:57:57] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:57:57] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-21 18:57:57] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:57:59] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6341 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:58:06] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29798 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36177ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36179ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36495 ms. Remains : 193/193 places, 137/137 transitions.
Treatment of property DES-PT-20a-LTLFireability-04 finished in 112697 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)&&F(G(p1)))))'
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 18:58:31] [INFO ] Invariant cache hit.
[2024-05-21 18:58:31] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-21 18:58:31] [INFO ] Invariant cache hit.
[2024-05-21 18:58:31] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2024-05-21 18:58:31] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 18:58:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:58:32] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:58:33] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:58:34] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:58:34] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:58:35] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6203 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:58:42] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29419 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 35668ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35669ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36135 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-20a-LTLFireability-05
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 1 ms.
FORMULA DES-PT-20a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-05 finished in 36255 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((F(p1)&&p0))))'
Support contains 8 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 18:59:07] [INFO ] Invariant cache hit.
[2024-05-21 18:59:07] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 18:59:07] [INFO ] Invariant cache hit.
[2024-05-21 18:59:07] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-21 18:59:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:08] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:09] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:59:10] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:59:10] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6333 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:19] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29319 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 35691ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35692ms
Finished structural reductions in LTL mode , in 1 iterations and 35987 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20a-LTLFireability-06
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-06 finished in 36117 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((G(p1)||p0)))'
Support contains 9 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 18:59:43] [INFO ] Invariant cache hit.
[2024-05-21 18:59:43] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 18:59:43] [INFO ] Invariant cache hit.
[2024-05-21 18:59:43] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-21 18:59:43] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 18:59:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:44] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:46] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:59:46] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:59:46] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:48] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6316 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:55] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29666 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36019ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36020ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36311 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-20a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 742 steps with 17 reset in 6 ms.
FORMULA DES-PT-20a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-07 finished in 36518 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)||X(X(p1)))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 19:00:20] [INFO ] Invariant cache hit.
[2024-05-21 19:00:20] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 19:00:20] [INFO ] Invariant cache hit.
[2024-05-21 19:00:20] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-21 19:00:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:00:21] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:00:22] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-21 19:00:22] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-21 19:00:22] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:00:24] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6256 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:00:31] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29646 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 35942ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35944ms
Finished structural reductions in LTL mode , in 1 iterations and 36217 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20a-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLFireability-08 finished in 36986 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 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 19:00:57] [INFO ] Invariant cache hit.
[2024-05-21 19:00:57] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 19:00:57] [INFO ] Invariant cache hit.
[2024-05-21 19:00:57] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-21 19:00:57] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 19:00:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:00:58] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:00:59] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:00:59] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-21 19:00:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:01:01] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6269 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:01:08] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29953 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36258ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36260ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36549 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLFireability-09
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-09 finished in 36633 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)||G(p1))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 19:01:33] [INFO ] Invariant cache hit.
[2024-05-21 19:01:33] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 19:01:33] [INFO ] Invariant cache hit.
[2024-05-21 19:01:34] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-21 19:01:34] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 19:01:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:01:34] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:01:36] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 19:01:36] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-21 19:01:36] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:01:38] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6225 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:01:45] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29689 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 35953ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35954ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36248 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20a-LTLFireability-10
Product exploration explored 100000 steps with 2217 reset in 314 ms.
Product exploration explored 100000 steps with 2212 reset in 359 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 155 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (910 resets) in 255 ms. (156 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (175 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (175 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (175 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
[2024-05-21 19:02:11] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 65/80 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 84/164 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/170 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 136/306 variables, 170/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 24/330 variables, 23/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 251 constraints, problems are : Problem set: 0 solved, 3 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 65/80 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 84/164 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/170 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:02:11] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 136/306 variables, 170/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 24/330 variables, 23/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 255 constraints, problems are : Problem set: 0 solved, 3 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3084 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 193 transition count 135
Applied a total of 6 rules in 11 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 40000 steps (538 resets) in 303 ms. (131 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (77 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (74 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (65 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 835057 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 3
Probabilistic random walk after 835057 steps, saw 118918 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 19:02:18] [INFO ] Computed 60 invariants in 9 ms
[2024-05-21 19:02:18] [INFO ] State equation strengthened by 3 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 71/86 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 87/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 20/328 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 3 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 71/86 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 87/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:02:18] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 135/308 variables, 173/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 20/328 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:02:18] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/328 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:02:18] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 262 constraints, problems are : Problem set: 0 solved, 3 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1048ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2443 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-21 19:02:21] [INFO ] Invariant cache hit.
[2024-05-21 19:02:21] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 19:02:21] [INFO ] Invariant cache hit.
[2024-05-21 19:02:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 19:02:21] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-21 19:02:21] [INFO ] Redundant transitions in 0 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-21 19:02:21] [INFO ] Invariant cache hit.
[2024-05-21 19:02:21] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/328 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 19:02:24] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 257 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6436 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 19:02:29] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 19:02:30] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-21 19:02:30] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-21 19:02:30] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 135/328 variables, 193/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 134/395 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 19:02:33] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 19:02:33] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:02:34] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:02:34] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-21 19:02:34] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 5/400 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 19:02:43] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 401 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 11/11 constraints]
After SMT, in 36495ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 36497ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36812 ms. Remains : 193/193 places, 135/135 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 19:02:58] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 19:02:58] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 19:02:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 19:02:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 19:02:58] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-21 19:02:58] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-21 19:02:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-21 19:02:58] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 19:02:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
TRAPS : Iteration 1
[2024-05-21 19:02:58] [INFO ] After 359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-21 19:02:59] [INFO ] After 517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 587 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 297 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 19:02:59] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 19:02:59] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 19:02:59] [INFO ] Invariant cache hit.
[2024-05-21 19:02:59] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-21 19:02:59] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 19:02:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:03:00] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:03:01] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-21 19:03:02] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-21 19:03:02] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:03:03] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6286 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:03:11] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29814 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36135ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36136ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36458 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 151 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (899 resets) in 331 ms. (120 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (171 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (165 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (190 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
[2024-05-21 19:03:36] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 65/80 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 84/164 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/170 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 136/306 variables, 170/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 24/330 variables, 23/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 251 constraints, problems are : Problem set: 0 solved, 3 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 65/80 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 84/164 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/170 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:03:36] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 136/306 variables, 170/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 24/330 variables, 23/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 255 constraints, problems are : Problem set: 0 solved, 3 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 602ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3074 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 193 transition count 135
Applied a total of 6 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 40000 steps (538 resets) in 396 ms. (100 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (72 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (80 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (69 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 746272 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :0 out of 3
Probabilistic random walk after 746272 steps, saw 107159 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 19:03:43] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 19:03:43] [INFO ] State equation strengthened by 3 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 71/86 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 87/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 20/328 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 3 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 71/86 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 87/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:03:43] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 135/308 variables, 173/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 20/328 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:03:43] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/328 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:03:44] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 262 constraints, problems are : Problem set: 0 solved, 3 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 867ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2334 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-21 19:03:46] [INFO ] Invariant cache hit.
[2024-05-21 19:03:46] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 19:03:46] [INFO ] Invariant cache hit.
[2024-05-21 19:03:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 19:03:46] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-21 19:03:46] [INFO ] Redundant transitions in 0 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-21 19:03:46] [INFO ] Invariant cache hit.
[2024-05-21 19:03:46] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/328 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 19:03:49] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 257 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6275 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 19:03:53] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 19:03:54] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-21 19:03:54] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-21 19:03:54] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 135/328 variables, 193/258 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 134/395 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 19:03:57] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 19:03:58] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:03:59] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-21 19:03:59] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-21 19:03:59] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 5/400 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 19:04:07] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 401 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 11/11 constraints]
After SMT, in 36334ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 36336ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36629 ms. Remains : 193/193 places, 135/135 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 19:04:23] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 19:04:23] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 19:04:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 19:04:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 19:04:23] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-21 19:04:23] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-21 19:04:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-21 19:04:23] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:04:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
TRAPS : Iteration 1
[2024-05-21 19:04:23] [INFO ] After 364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-21 19:04:23] [INFO ] After 500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 560 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 287 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2224 reset in 234 ms.
Product exploration explored 100000 steps with 2218 reset in 257 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 19:04:24] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 19:04:24] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 19:04:24] [INFO ] Invariant cache hit.
[2024-05-21 19:04:25] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-21 19:04:25] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 19:04:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:04:25] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:04:27] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:04:27] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-21 19:04:27] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:04:29] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6295 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:04:36] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36347ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36349ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36669 ms. Remains : 193/193 places, 137/137 transitions.
Treatment of property DES-PT-20a-LTLFireability-10 finished in 207638 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(((!p1 U (p2||G(!p1)))||p0))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 19:05:01] [INFO ] Invariant cache hit.
[2024-05-21 19:05:01] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 19:05:01] [INFO ] Invariant cache hit.
[2024-05-21 19:05:01] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-21 19:05:01] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 19:05:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:05:02] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:05:03] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-21 19:05:04] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:05:04] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:05:06] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6486 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:05:13] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36534ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36536ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36855 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : DES-PT-20a-LTLFireability-11
Product exploration explored 100000 steps with 2245 reset in 213 ms.
Product exploration explored 100000 steps with 2274 reset in 231 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (OR p0 p2)), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p0 p2))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 197 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (873 resets) in 316 ms. (126 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (268 resets) in 222 ms. (179 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (269 resets) in 246 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (269 resets) in 280 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (180 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (177 resets) in 215 ms. (185 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (268 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
[2024-05-21 19:05:39] [INFO ] Invariant cache hit.
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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 72/81 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 84/165 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/171 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf4 is UNSAT
At refinement iteration 9 (OVERLAPS) 137/308 variables, 171/229 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 22/330 variables, 22/251 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 251 constraints, problems are : Problem set: 1 solved, 5 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 72/81 variables, 31/33 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 84/165 variables, 23/56 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 6/171 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 137/308 variables, 171/229 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 22/330 variables, 22/251 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 5/256 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 19:05:40] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 1/257 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 0/257 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/330 variables, 0/257 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 257 constraints, problems are : Problem set: 1 solved, 5 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 949ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5583 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 136
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 7 place count 193 transition count 136
Applied a total of 7 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 136/137 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 193/193 places, 136/137 transitions.
RANDOM walk for 40000 steps (883 resets) in 515 ms. (77 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (144 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (130 resets) in 180 ms. (221 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (173 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (176 resets) in 184 ms. (216 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (150 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 697169 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 5
Probabilistic random walk after 697169 steps, saw 96179 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
// Phase 1: matrix 136 rows 193 cols
[2024-05-21 19:05:49] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 19:05:49] [INFO ] State equation strengthened by 3 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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 75/84 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 87/171 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 136/307 variables, 171/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 22/329 variables, 22/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/329 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 255 constraints, problems are : Problem set: 0 solved, 5 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 75/84 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 87/171 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 136/307 variables, 171/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 22/329 variables, 22/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 5/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 19:05:50] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/329 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 261 constraints, problems are : Problem set: 0 solved, 5 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 976ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2521 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 136/136 transitions.
Applied a total of 0 rules in 11 ms. Remains 193 /193 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 193/193 places, 136/136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 136/136 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-21 19:05:53] [INFO ] Invariant cache hit.
[2024-05-21 19:05:53] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 19:05:53] [INFO ] Invariant cache hit.
[2024-05-21 19:05:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 19:05:53] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-21 19:05:53] [INFO ] Redundant transitions in 0 ms returned []
Running 135 sub problems to find dead transitions.
[2024-05-21 19:05:53] [INFO ] Invariant cache hit.
[2024-05-21 19:05:53] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 136/329 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-21 19:05:55] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/329 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/329 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 256 constraints, problems are : Problem set: 0 solved, 135 unsolved in 6297 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-21 19:06:00] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-21 19:06:00] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-05-21 19:06:00] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-21 19:06:01] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 136/329 variables, 193/257 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 135/395 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-21 19:06:04] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:06:05] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:06:06] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:06:06] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 19:06:06] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-21 19:06:06] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 6/401 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 13 (OVERLAPS) 0/329 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 401 constraints, problems are : Problem set: 0 solved, 135 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 11/11 constraints]
After SMT, in 36351ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 36352ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36688 ms. Remains : 193/193 places, 136/136 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-21 19:06:29] [INFO ] Invariant cache hit.
[2024-05-21 19:06:29] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 19:06:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-21 19:06:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-21 19:06:30] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-21 19:06:30] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:06:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
TRAPS : Iteration 1
[2024-05-21 19:06:30] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-21 19:06:30] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 623 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (OR p0 p2)), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p0 p2))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) p2 p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p2)]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 174 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLFireability-11 finished in 89302 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)||G(F(p1)))))'
Support contains 13 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 19:06:30] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 19:06:30] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 19:06:30] [INFO ] Invariant cache hit.
[2024-05-21 19:06:30] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-21 19:06:30] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 19:06:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:06:31] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:06:33] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:06:33] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-21 19:06:33] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:06:35] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6439 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:06:42] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36483ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36485ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36779 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20a-LTLFireability-12
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-12 finished in 36885 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(p0))&&F((p1||G(F(p2))))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 19:07:07] [INFO ] Invariant cache hit.
[2024-05-21 19:07:07] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 19:07:07] [INFO ] Invariant cache hit.
[2024-05-21 19:07:07] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-21 19:07:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:07:08] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:07:10] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:07:10] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-21 19:07:10] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:07:12] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6510 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:07:19] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36559ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36561ms
Finished structural reductions in LTL mode , in 1 iterations and 36846 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : DES-PT-20a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 18 steps with 3 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-13 finished in 37016 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(p0) U (G(!p1)||G(p1)))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 19:07:44] [INFO ] Invariant cache hit.
[2024-05-21 19:07:44] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 19:07:44] [INFO ] Invariant cache hit.
[2024-05-21 19:07:44] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-21 19:07:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:07:45] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:07:47] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:07:47] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-21 19:07:47] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:07:49] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6375 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 19:07:56] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29933 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36355ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36356ms
Finished structural reductions in LTL mode , in 1 iterations and 36636 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 236 ms :[false, false, p1, (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLFireability-14
Entered a terminal (fully accepting) state of product in 133 steps with 3 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-14 finished in 36895 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(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(p0)||G(p1))))'
[2024-05-21 19:08:21] [INFO ] Flatten gal took : 15 ms
[2024-05-21 19:08:21] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 19:08:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 137 transitions and 671 arcs took 4 ms.
Total runtime 928681 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DES-PT-20a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 193
TRANSITIONS: 137
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.000s]
SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2108
MODEL NAME: /home/mcc/execution/410/model
193 places, 137 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-20a-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-20a-LTLFireability-10 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716318968657
--------------------
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
MEDDLY ERROR: Insufficient memory
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="DES-PT-20a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DES-PT-20a, 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 r091-tall-171624188200684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a 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 ;