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.r480-tall-171624189900748.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DES-PT-60a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900748
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Apr 12 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 08:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 110K 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-60a-LTLFireability-00
FORMULA_NAME DES-PT-60a-LTLFireability-01
FORMULA_NAME DES-PT-60a-LTLFireability-02
FORMULA_NAME DES-PT-60a-LTLFireability-03
FORMULA_NAME DES-PT-60a-LTLFireability-04
FORMULA_NAME DES-PT-60a-LTLFireability-05
FORMULA_NAME DES-PT-60a-LTLFireability-06
FORMULA_NAME DES-PT-60a-LTLFireability-07
FORMULA_NAME DES-PT-60a-LTLFireability-08
FORMULA_NAME DES-PT-60a-LTLFireability-09
FORMULA_NAME DES-PT-60a-LTLFireability-10
FORMULA_NAME DES-PT-60a-LTLFireability-11
FORMULA_NAME DES-PT-60a-LTLFireability-12
FORMULA_NAME DES-PT-60a-LTLFireability-13
FORMULA_NAME DES-PT-60a-LTLFireability-14
FORMULA_NAME DES-PT-60a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717198803833

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:40:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:40:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:40:05] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-31 23:40:05] [INFO ] Transformed 354 places.
[2024-05-31 23:40:05] [INFO ] Transformed 311 transitions.
[2024-05-31 23:40:05] [INFO ] Found NUPN structural information;
[2024-05-31 23:40:05] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-60a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 297/297 transitions.
Applied a total of 0 rules in 63 ms. Remains 354 /354 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 354 cols
[2024-05-31 23:40:05] [INFO ] Computed 59 invariants in 26 ms
[2024-05-31 23:40:06] [INFO ] Implicit Places using invariants in 867 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 925 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 353/354 places, 297/297 transitions.
Applied a total of 0 rules in 19 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1041 ms. Remains : 353/354 places, 297/297 transitions.
Support contains 45 out of 353 places after structural reductions.
[2024-05-31 23:40:06] [INFO ] Flatten gal took : 79 ms
[2024-05-31 23:40:07] [INFO ] Flatten gal took : 61 ms
[2024-05-31 23:40:07] [INFO ] Input system was already deterministic with 297 transitions.
Support contains 43 out of 353 places (down from 45) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 31 to 29
RANDOM walk for 40000 steps (900 resets) in 2665 ms. (15 steps per ms) remains 21/29 properties
BEST_FIRST walk for 4002 steps (23 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (22 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (18 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (19 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (18 resets) in 74 ms. (53 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (18 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (19 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (18 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (25 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (22 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (20 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (25 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (23 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (23 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (21 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (18 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (19 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 55 ms. (71 steps per ms) remains 21/21 properties
// Phase 1: matrix 297 rows 353 cols
[2024-05-31 23:40:08] [INFO ] Computed 58 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 10/36 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 64/100 variables, 27/69 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 64/133 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 190/290 variables, 23/156 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 190/346 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 6/296 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 296/592 variables, 296/650 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/592 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 58/650 variables, 57/707 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/650 variables, 57/764 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 650/650 variables, and 764 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5040 ms.
Refiners :[Domain max(s): 353/353 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 10/36 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 64/100 variables, 27/69 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 64/133 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 190/290 variables, 23/156 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 190/346 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 6/296 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 296/592 variables, 296/650 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/592 variables, 5/655 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/650 variables, and 655 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5009 ms.
Refiners :[Domain max(s): 296/353 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 296/353 constraints, PredecessorRefiner: 5/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 10202ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 297/297 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 353 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 352 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 352 transition count 294
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 8 place count 352 transition count 294
Applied a total of 8 rules in 57 ms. Remains 352 /353 variables (removed 1) and now considering 294/297 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 352/353 places, 294/297 transitions.
RANDOM walk for 40000 steps (529 resets) in 829 ms. (48 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (28 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (28 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (27 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (28 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (28 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (27 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
// Phase 1: matrix 294 rows 352 cols
[2024-05-31 23:40:19] [INFO ] Computed 60 invariants in 7 ms
[2024-05-31 23:40:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 10/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 72/105 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 192/297 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 294/591 variables, 297/357 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/591 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 23:40:20] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 40 ms to minimize.
[2024-05-31 23:40:20] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 3 ms to minimize.
[2024-05-31 23:40:20] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-05-31 23:40:20] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/591 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 55/646 variables, 55/418 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 23:40:21] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:40:22] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-05-31 23:40:22] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 23:40:23] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-05-31 23:40:23] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/646 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/646 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 0/646 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 423 constraints, problems are : Problem set: 0 solved, 18 unsolved in 6349 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 10/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 72/105 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 192/297 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 294/591 variables, 297/365 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 23:40:26] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-31 23:40:27] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-31 23:40:27] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-31 23:40:27] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:40:28] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 5/376 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 55/646 variables, 55/431 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/646 variables, 14/445 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/646 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 23:40:35] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-05-31 23:40:36] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/646 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/646 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 23:40:54] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:40:55] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/646 variables, 2/450 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/646 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 450 constraints, problems are : Problem set: 0 solved, 18 unsolved in 45019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 18/18 constraints]
After SMT, in 51421ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 20 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 352/352 places, 294/294 transitions.
RANDOM walk for 40000 steps (560 resets) in 573 ms. (69 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (26 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (12 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (27 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (27 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 537181 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 18
Probabilistic random walk after 537181 steps, saw 77098 distinct states, run finished after 3005 ms. (steps per millisecond=178 ) properties seen :0
[2024-05-31 23:41:13] [INFO ] Invariant cache hit.
[2024-05-31 23:41:13] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 10/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 72/105 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 192/297 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 294/591 variables, 297/357 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/591 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 23:41:14] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/591 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 23:41:15] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:41:15] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-31 23:41:15] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 3 ms to minimize.
[2024-05-31 23:41:15] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-31 23:41:16] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 5/365 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 55/646 variables, 55/420 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 23:41:17] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-05-31 23:41:17] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/646 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/646 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 0/646 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 422 constraints, problems are : Problem set: 0 solved, 18 unsolved in 6021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 10/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 72/105 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 192/297 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 294/591 variables, 297/365 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 23:41:21] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:41:22] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 55/646 variables, 55/428 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/646 variables, 14/442 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/646 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 23:41:35] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/646 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/646 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 0/646 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 443 constraints, problems are : Problem set: 0 solved, 18 unsolved in 45727 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 11/11 constraints]
After SMT, in 51789ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 5682 ms.
Support contains 23 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-31 23:42:11] [INFO ] Invariant cache hit.
[2024-05-31 23:42:11] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-31 23:42:11] [INFO ] Invariant cache hit.
[2024-05-31 23:42:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:42:11] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2024-05-31 23:42:11] [INFO ] Redundant transitions in 15 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-31 23:42:11] [INFO ] Invariant cache hit.
[2024-05-31 23:42:11] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:42:19] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:42:23] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:42:24] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (OVERLAPS) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 26936 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:42:41] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-31 23:42:41] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/712 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:43:05] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 713 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 6/6 constraints]
After SMT, in 57245ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 57250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57909 ms. Remains : 352/352 places, 294/294 transitions.
Computed a total of 256 stabilizing places and 251 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' '!(F((X(X(F(p0)))&&G(p1))))'
Support contains 6 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 13 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-31 23:43:09] [INFO ] Computed 58 invariants in 5 ms
[2024-05-31 23:43:09] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-31 23:43:09] [INFO ] Invariant cache hit.
[2024-05-31 23:43:10] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-31 23:43:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:43:16] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:43:27] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 26093 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:43:40] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
[2024-05-31 23:43:40] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 56442ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56445ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57127 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-00
Product exploration explored 100000 steps with 4049 reset in 322 ms.
Product exploration explored 100000 steps with 4092 reset in 323 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (881 resets) in 612 ms. (65 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (251 resets) in 317 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (249 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 941046 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 2
Probabilistic random walk after 941046 steps, saw 136175 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
[2024-05-31 23:44:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/81 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 202/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 2 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/81 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 202/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:44:12] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-31 23:44:12] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 64/648 variables, 63/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 414 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1906 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2233ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 1809 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 352 transition count 294
Applied a total of 7 rules in 37 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (542 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (288 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1274927 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :0 out of 1
Probabilistic random walk after 1274927 steps, saw 177850 distinct states, run finished after 3001 ms. (steps per millisecond=424 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-31 23:44:18] [INFO ] Computed 60 invariants in 9 ms
[2024-05-31 23:44:18] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/89 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/89 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:44:19] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-31 23:44:19] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 294/586 variables, 292/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 60/646 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 912ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 935 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 23 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-31 23:44:20] [INFO ] Invariant cache hit.
[2024-05-31 23:44:20] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-31 23:44:20] [INFO ] Invariant cache hit.
[2024-05-31 23:44:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 23:44:21] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2024-05-31 23:44:21] [INFO ] Redundant transitions in 7 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-31 23:44:21] [INFO ] Invariant cache hit.
[2024-05-31 23:44:21] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:44:32] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:44:37] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (OVERLAPS) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:44:53] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/711 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 711 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints]
After SMT, in 60310ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61004 ms. Remains : 352/352 places, 294/294 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 352 transition count 294
Applied a total of 1 rules in 19 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-31 23:45:21] [INFO ] Computed 60 invariants in 10 ms
[2024-05-31 23:45:21] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:45:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:45:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-31 23:45:21] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:45:22] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:45:22] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 539 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-31 23:45:22] [INFO ] Computed 58 invariants in 8 ms
[2024-05-31 23:45:22] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-31 23:45:22] [INFO ] Invariant cache hit.
[2024-05-31 23:45:23] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-31 23:45:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:45:29] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:45:39] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25571 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:45:52] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-31 23:45:52] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55856ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55864ms
Finished structural reductions in LTL mode , in 1 iterations and 56565 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (886 resets) in 330 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (253 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (252 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 804465 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :0 out of 2
Probabilistic random walk after 804465 steps, saw 120788 distinct states, run finished after 3001 ms. (steps per millisecond=268 ) properties seen :0
[2024-05-31 23:46:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/81 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 202/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 2 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/81 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 202/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:46:23] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-31 23:46:23] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 64/648 variables, 63/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 414 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1958 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2326ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 1871 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 352 transition count 294
Applied a total of 7 rules in 20 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (518 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (290 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1232396 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :0 out of 1
Probabilistic random walk after 1232396 steps, saw 172452 distinct states, run finished after 3001 ms. (steps per millisecond=410 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-31 23:46:29] [INFO ] Computed 60 invariants in 10 ms
[2024-05-31 23:46:29] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/89 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/89 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:46:30] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-31 23:46:30] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 294/586 variables, 292/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 60/646 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 929ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 924 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-31 23:46:31] [INFO ] Invariant cache hit.
[2024-05-31 23:46:32] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-31 23:46:32] [INFO ] Invariant cache hit.
[2024-05-31 23:46:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 23:46:32] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2024-05-31 23:46:32] [INFO ] Redundant transitions in 6 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-31 23:46:32] [INFO ] Invariant cache hit.
[2024-05-31 23:46:32] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:46:44] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:46:49] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:47:04] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/711 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 711 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints]
After SMT, in 60274ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60278ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60986 ms. Remains : 352/352 places, 294/294 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 352 transition count 294
Applied a total of 1 rules in 27 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-31 23:47:32] [INFO ] Computed 60 invariants in 9 ms
[2024-05-31 23:47:32] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:47:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:47:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-31 23:47:33] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:47:33] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:47:33] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 513 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 4184 reset in 257 ms.
Product exploration explored 100000 steps with 4203 reset in 400 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 52 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-31 23:47:34] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-31 23:47:35] [INFO ] Computed 58 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:47:41] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-05-31 23:47:44] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:47:44] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:47:48] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 414 constraints, problems are : Problem set: 0 solved, 295 unsolved in 22792 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 53082ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 53085ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53146 ms. Remains : 352/352 places, 296/296 transitions.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-31 23:48:28] [INFO ] Invariant cache hit.
[2024-05-31 23:48:28] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-31 23:48:28] [INFO ] Invariant cache hit.
[2024-05-31 23:48:28] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-31 23:48:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:48:34] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:48:45] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25366 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:48:58] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-31 23:48:58] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55609ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55614ms
Finished structural reductions in LTL mode , in 1 iterations and 56272 ms. Remains : 352/352 places, 296/296 transitions.
Treatment of property DES-PT-60a-LTLFireability-00 finished in 375005 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 3 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 351 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 295
Applied a total of 2 rules in 36 ms. Remains 351 /353 variables (removed 2) and now considering 295/297 (removed 2) transitions.
// Phase 1: matrix 295 rows 351 cols
[2024-05-31 23:49:24] [INFO ] Computed 58 invariants in 5 ms
[2024-05-31 23:49:24] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-31 23:49:24] [INFO ] Invariant cache hit.
[2024-05-31 23:49:25] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2024-05-31 23:49:25] [INFO ] Redundant transitions in 1 ms returned []
Running 292 sub problems to find dead transitions.
[2024-05-31 23:49:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 2/350 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 295/645 variables, 350/408 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:49:34] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:49:34] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:49:34] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 3/411 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/646 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:49:42] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-31 23:49:42] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-31 23:49:42] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-31 23:49:42] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-31 23:49:42] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
[2024-05-31 23:49:44] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/418 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:49:51] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 419 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 2/350 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 295/645 variables, 350/417 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 292/709 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/646 variables, and 709 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 9/10 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60257ms
Starting structural reductions in SI_LTL mode, iteration 1 : 351/353 places, 295/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61075 ms. Remains : 351/353 places, 295/297 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-01
Product exploration explored 100000 steps with 2277 reset in 244 ms.
Product exploration explored 100000 steps with 2260 reset in 234 ms.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Detected a total of 254/351 stabilizing places and 249/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (902 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (181 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1256285 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :0 out of 1
Probabilistic random walk after 1256285 steps, saw 178470 distinct states, run finished after 3002 ms. (steps per millisecond=418 ) properties seen :0
[2024-05-31 23:50:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/215 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/244 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/273 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/280 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 229/509 variables, 280/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/523 variables, 8/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/523 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/523 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 63/586 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/586 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/586 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 60/646 variables, 60/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/646 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/646 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 409 constraints, problems are : Problem set: 0 solved, 1 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/215 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/244 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/273 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/280 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 229/509 variables, 280/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/509 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/523 variables, 8/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/523 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/523 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/586 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/586 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/586 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 60/646 variables, 60/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/646 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/646 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1017ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 880 ms.
Support contains 3 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 295/295 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 351 transition count 293
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 351 transition count 293
Applied a total of 4 rules in 29 ms. Remains 351 /351 variables (removed 0) and now considering 293/295 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 351/351 places, 293/295 transitions.
RANDOM walk for 40000 steps (655 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (112 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1271799 steps, run timeout after 3001 ms. (steps per millisecond=423 ) properties seen :0 out of 1
Probabilistic random walk after 1271799 steps, saw 177813 distinct states, run finished after 3001 ms. (steps per millisecond=423 ) properties seen :0
// Phase 1: matrix 293 rows 351 cols
[2024-05-31 23:50:34] [INFO ] Computed 60 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 213/218 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/249 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/273 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/280 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 228/508 variables, 280/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/522 variables, 8/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/523 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/523 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/523 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/585 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/585 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/585 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 59/644 variables, 59/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/644 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/644 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 411 constraints, problems are : Problem set: 0 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 213/218 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/249 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/273 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/280 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 228/508 variables, 280/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/522 variables, 8/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:50:35] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/522 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/523 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/523 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/523 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 62/585 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/585 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/585 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 59/644 variables, 59/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 413 constraints, problems are : Problem set: 0 solved, 1 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 890ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2755 steps, including 1 resets, run visited all 1 properties in 10 ms. (steps per millisecond=275 )
Parikh walk visited 1 properties in 17 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 351/351 places, 295/295 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 351 cols
[2024-05-31 23:50:35] [INFO ] Computed 58 invariants in 4 ms
[2024-05-31 23:50:36] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-31 23:50:36] [INFO ] Invariant cache hit.
[2024-05-31 23:50:36] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
[2024-05-31 23:50:36] [INFO ] Redundant transitions in 0 ms returned []
Running 292 sub problems to find dead transitions.
[2024-05-31 23:50:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 2/350 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 295/645 variables, 350/408 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:50:46] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-05-31 23:50:46] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:50:46] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 3/411 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/646 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:50:54] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-31 23:50:54] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-05-31 23:50:54] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-31 23:50:54] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2024-05-31 23:50:54] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:50:56] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/418 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:51:03] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 419 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 2/350 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 295/645 variables, 350/417 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 292/709 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/646 variables, and 709 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 9/10 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61288 ms. Remains : 351/351 places, 295/295 transitions.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Detected a total of 254/351 stabilizing places and 249/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (914 resets) in 386 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (181 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1277184 steps, run timeout after 3001 ms. (steps per millisecond=425 ) properties seen :0 out of 1
Probabilistic random walk after 1277184 steps, saw 181169 distinct states, run finished after 3003 ms. (steps per millisecond=425 ) properties seen :0
[2024-05-31 23:51:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/215 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/244 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/273 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/280 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 229/509 variables, 280/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/523 variables, 8/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/523 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/523 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 63/586 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/586 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/586 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 60/646 variables, 60/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/646 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/646 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 409 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/215 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/244 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/273 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/280 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 229/509 variables, 280/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/509 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/523 variables, 8/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/523 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/523 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/586 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/586 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/586 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 60/646 variables, 60/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/646 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/646 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 786ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 882 ms.
Support contains 3 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 295/295 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 351 transition count 293
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 351 transition count 293
Applied a total of 4 rules in 14 ms. Remains 351 /351 variables (removed 0) and now considering 293/295 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 351/351 places, 293/295 transitions.
RANDOM walk for 40000 steps (642 resets) in 291 ms. (136 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (115 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1280135 steps, run timeout after 3001 ms. (steps per millisecond=426 ) properties seen :0 out of 1
Probabilistic random walk after 1280135 steps, saw 178731 distinct states, run finished after 3001 ms. (steps per millisecond=426 ) properties seen :0
// Phase 1: matrix 293 rows 351 cols
[2024-05-31 23:51:45] [INFO ] Computed 60 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 213/218 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/249 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/273 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/280 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 228/508 variables, 280/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/522 variables, 8/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/523 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/523 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/523 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/585 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/585 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/585 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 59/644 variables, 59/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/644 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/644 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 411 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 213/218 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/249 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/273 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/280 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 228/508 variables, 280/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/522 variables, 8/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:51:45] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/522 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/523 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/523 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/523 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 62/585 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/585 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/585 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 59/644 variables, 59/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 413 constraints, problems are : Problem set: 0 solved, 1 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 813ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2708 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=246 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2257 reset in 206 ms.
Product exploration explored 100000 steps with 2264 reset in 242 ms.
Support contains 3 out of 351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 351/351 places, 295/295 transitions.
Applied a total of 0 rules in 22 ms. Remains 351 /351 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 351 cols
[2024-05-31 23:51:46] [INFO ] Computed 58 invariants in 4 ms
[2024-05-31 23:51:47] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-31 23:51:47] [INFO ] Invariant cache hit.
[2024-05-31 23:51:47] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2024-05-31 23:51:47] [INFO ] Redundant transitions in 1 ms returned []
Running 292 sub problems to find dead transitions.
[2024-05-31 23:51:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 2/350 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 295/645 variables, 350/408 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:51:57] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:51:57] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:51:57] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 3/411 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/646 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:52:04] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-31 23:52:05] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-31 23:52:05] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-31 23:52:05] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-31 23:52:05] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:52:07] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/418 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-31 23:52:13] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 419 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 2/350 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 295/645 variables, 350/417 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 292/709 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/646 variables, and 709 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 9/10 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61166 ms. Remains : 351/351 places, 295/295 transitions.
Treatment of property DES-PT-60a-LTLFireability-01 finished in 203595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 13 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-31 23:52:48] [INFO ] Computed 58 invariants in 9 ms
[2024-05-31 23:52:48] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-31 23:52:48] [INFO ] Invariant cache hit.
[2024-05-31 23:52:48] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-31 23:52:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:52:55] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:53:05] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 26372 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:53:18] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:53:19] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 56609ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56613ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57216 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-04
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-04 finished in 57359 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(((p1 U (p2||G(p1)))||p0))))'
Support contains 6 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 9 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-31 23:53:45] [INFO ] Invariant cache hit.
[2024-05-31 23:53:45] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-31 23:53:45] [INFO ] Invariant cache hit.
[2024-05-31 23:53:46] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-31 23:53:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:53:52] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:54:02] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25740 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:54:15] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-31 23:54:15] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55995ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56000ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56624 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-60a-LTLFireability-06
Product exploration explored 100000 steps with 2230 reset in 290 ms.
Product exploration explored 100000 steps with 2193 reset in 328 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 458 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (887 resets) in 500 ms. (79 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (166 resets) in 430 ms. (92 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (201 resets) in 507 ms. (78 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (205 resets) in 576 ms. (69 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (181 resets) in 328 ms. (121 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (173 resets) in 383 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (201 resets) in 379 ms. (105 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (204 resets) in 318 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (187 resets) in 330 ms. (120 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 417542 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 8
Probabilistic random walk after 417542 steps, saw 71642 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
[2024-05-31 23:54:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 4/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 71/81 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 204/285 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6/291 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 295/586 variables, 291/349 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf5 is UNSAT
At refinement iteration 11 (OVERLAPS) 62/648 variables, 61/410 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 1 solved, 7 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 4/10 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 71/81 variables, 30/33 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 204/285 variables, 23/56 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-31 23:54:48] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-31 23:54:48] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 6/291 variables, 2/60 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 295/586 variables, 291/351 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 1/352 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/586 variables, 0/352 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 62/648 variables, 61/413 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 6/419 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/419 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/648 variables, 0/419 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 419 constraints, problems are : Problem set: 1 solved, 7 unsolved in 1905 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 2649ms problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 15772 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 352 transition count 294
Applied a total of 7 rules in 19 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (549 resets) in 1325 ms. (30 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (90 resets) in 307 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (88 resets) in 348 ms. (114 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (105 resets) in 383 ms. (104 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (92 resets) in 383 ms. (104 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (88 resets) in 339 ms. (117 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (101 resets) in 333 ms. (119 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (93 resets) in 299 ms. (133 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 400386 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 7
Probabilistic random walk after 400386 steps, saw 59063 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-31 23:55:10] [INFO ] Computed 60 invariants in 4 ms
[2024-05-31 23:55:10] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 4/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 77/87 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 207/294 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 294/588 variables, 294/354 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 58/646 variables, 58/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 414 constraints, problems are : Problem set: 0 solved, 7 unsolved in 588 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 4/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 77/87 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 207/294 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 294/588 variables, 294/354 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:55:11] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 58/646 variables, 58/416 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 6/422 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:55:11] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/646 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/646 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 423 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2091 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 2707ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 18477 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 7 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-31 23:55:31] [INFO ] Invariant cache hit.
[2024-05-31 23:55:31] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-31 23:55:31] [INFO ] Invariant cache hit.
[2024-05-31 23:55:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:55:32] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2024-05-31 23:55:32] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-31 23:55:32] [INFO ] Invariant cache hit.
[2024-05-31 23:55:32] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:55:41] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:55:42] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:55:49] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:56:06] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:56:06] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-31 23:56:06] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/418 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/713 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 713 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 6/6 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60946 ms. Remains : 352/352 places, 294/294 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 428 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 47 ms :[true, (AND (NOT p0) (NOT p2))]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-31 23:56:32] [INFO ] Computed 58 invariants in 7 ms
[2024-05-31 23:56:33] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-31 23:56:33] [INFO ] Invariant cache hit.
[2024-05-31 23:56:33] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2024-05-31 23:56:33] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-05-31 23:56:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:56:40] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:56:50] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 26097 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:57:03] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-31 23:57:03] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 56354ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56357ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57160 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (899 resets) in 923 ms. (43 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (184 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (200 resets) in 265 ms. (150 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (202 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 787992 steps, run timeout after 3008 ms. (steps per millisecond=261 ) properties seen :0 out of 3
Probabilistic random walk after 787992 steps, saw 118621 distinct states, run finished after 3008 ms. (steps per millisecond=261 ) properties seen :0
[2024-05-31 23:57:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 71/81 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 204/285 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/291 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 295/586 variables, 291/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 62/648 variables, 61/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 3 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 71/81 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 204/285 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:57:34] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-31 23:57:34] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/291 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 295/586 variables, 291/351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:57:34] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-31 23:57:34] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/586 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 62/648 variables, 61/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/648 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 417 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2168 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 2497ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 5437 steps, including 53 resets, run visited all 3 properties in 69 ms. (steps per millisecond=78 )
Parikh walk visited 3 properties in 1427 ms.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2)))
Knowledge based reduction with 11 factoid took 321 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLFireability-06 finished in 232642 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((X(p0)||(p0 U (p1 U X(!p2)))))))'
Support contains 8 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 12 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-31 23:57:38] [INFO ] Invariant cache hit.
[2024-05-31 23:57:38] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-31 23:57:38] [INFO ] Invariant cache hit.
[2024-05-31 23:57:38] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-31 23:57:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:57:44] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:57:54] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 24964 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 23:58:07] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:58:07] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55215ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55219ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55845 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false]
Running random walk in product with property : DES-PT-60a-LTLFireability-07
Product exploration explored 100000 steps with 33312 reset in 372 ms.
Product exploration explored 100000 steps with 33459 reset in 424 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 140 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 9 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 432 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (887 resets) in 1571 ms. (25 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (183 resets) in 318 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (179 resets) in 350 ms. (113 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (177 resets) in 374 ms. (106 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (169 resets) in 346 ms. (115 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (199 resets) in 405 ms. (98 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (255 resets) in 265 ms. (150 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (253 resets) in 390 ms. (102 steps per ms) remains 7/7 properties
[2024-05-31 23:58:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 66/81 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:58:36] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 205/286 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 3/289 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf1 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 10 (OVERLAPS) 295/584 variables, 289/348 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/348 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 64/648 variables, 63/411 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/648 variables, 0/411 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 411 constraints, problems are : Problem set: 2 solved, 5 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 66/81 variables, 28/33 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 205/286 variables, 24/58 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 3/289 variables, 1/59 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 295/584 variables, 289/348 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 1/349 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 0/349 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 64/648 variables, 63/412 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 4/416 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/416 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/648 variables, 0/416 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 416 constraints, problems are : Problem set: 2 solved, 5 unsolved in 2416 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 3341ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 8141 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 352 transition count 294
Applied a total of 7 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (533 resets) in 649 ms. (61 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (101 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (95 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 730685 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 2
Probabilistic random walk after 730685 steps, saw 104977 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-31 23:58:51] [INFO ] Computed 60 invariants in 10 ms
[2024-05-31 23:58:51] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 30/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) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 2 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:58:52] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 203/292 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 294/586 variables, 292/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:58:52] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 60/646 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/646 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 419 constraints, problems are : Problem set: 0 solved, 2 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1272ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 4872 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 7 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-31 23:58:57] [INFO ] Invariant cache hit.
[2024-05-31 23:58:58] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-31 23:58:58] [INFO ] Invariant cache hit.
[2024-05-31 23:58:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 23:58:58] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2024-05-31 23:58:58] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-31 23:58:58] [INFO ] Invariant cache hit.
[2024-05-31 23:58:58] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:59:10] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:59:14] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (OVERLAPS) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 23:59:30] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/711 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 711 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints]
After SMT, in 60302ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60307ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61000 ms. Remains : 352/352 places, 294/294 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 352 transition count 294
Applied a total of 1 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-31 23:59:58] [INFO ] Computed 60 invariants in 13 ms
[2024-05-31 23:59:58] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:59:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-31 23:59:58] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:59:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-31 23:59:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-31 23:59:59] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:59:59] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:59:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
TRAPS : Iteration 1
[2024-05-31 23:59:59] [INFO ] After 553ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:59:59] [INFO ] After 761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 914 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p2) (NOT p0) (NOT p1))), (G (OR (NOT p2) p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) p0 p1))), (F p2), (F p0), (F p1), (F (NOT (OR (NOT p2) p0 p1)))]
Knowledge based reduction with 22 factoid took 447 ms. Reduced automaton from 9 states, 30 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-06-01 00:00:00] [INFO ] Computed 58 invariants in 7 ms
[2024-06-01 00:00:00] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-01 00:00:00] [INFO ] Invariant cache hit.
[2024-06-01 00:00:01] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-06-01 00:00:01] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-01 00:00:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:00:07] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:00:18] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 26811 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:00:32] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:00:32] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 57052ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 57055ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57651 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (OR (NOT p2) p0)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 217 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (893 resets) in 1053 ms. (37 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40002 steps (183 resets) in 343 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (250 resets) in 291 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (214 resets) in 313 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (207 resets) in 307 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (175 resets) in 326 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (257 resets) in 310 ms. (128 steps per ms) remains 6/6 properties
[2024-06-01 00:00:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 66/81 variables, 28/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) 205/286 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3/289 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 1 solved, 5 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 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/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 66/81 variables, 28/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) 205/286 variables, 24/57 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3/289 variables, 1/58 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 1/348 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 00:01:01] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 1/349 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 0/349 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 64/648 variables, 63/412 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 4/416 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/416 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/648 variables, 0/416 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 416 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2374 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 3158ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 20264 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 352 transition count 294
Applied a total of 7 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (549 resets) in 1033 ms. (38 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (92 resets) in 281 ms. (141 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (133 resets) in 290 ms. (137 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (136 resets) in 283 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (97 resets) in 239 ms. (166 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (289 resets) in 272 ms. (146 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 544436 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 5
Probabilistic random walk after 544436 steps, saw 78153 distinct states, run finished after 3003 ms. (steps per millisecond=181 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:01:26] [INFO ] Computed 60 invariants in 9 ms
[2024-06-01 00:01:26] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 5 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 00:01:28] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 00:01:28] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/586 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 60/646 variables, 60/418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/646 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/646 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 422 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2625 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 3464ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 26708 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 7 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-01 00:01:57] [INFO ] Invariant cache hit.
[2024-06-01 00:01:57] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-06-01 00:01:57] [INFO ] Invariant cache hit.
[2024-06-01 00:01:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 00:01:57] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-06-01 00:01:57] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-01 00:01:57] [INFO ] Invariant cache hit.
[2024-06-01 00:01:57] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:02:09] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:02:14] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (OVERLAPS) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:02:30] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/711 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 711 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60950 ms. Remains : 352/352 places, 294/294 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (OR (NOT p2) p0)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0)]
Knowledge based reduction with 23 factoid took 221 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Product exploration explored 100000 steps with 33334 reset in 426 ms.
Product exploration explored 100000 steps with 33415 reset in 412 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 7 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-06-01 00:02:59] [INFO ] Computed 58 invariants in 9 ms
[2024-06-01 00:02:59] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-01 00:02:59] [INFO ] Invariant cache hit.
[2024-06-01 00:03:00] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2024-06-01 00:03:00] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-01 00:03:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:03:06] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:03:16] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25886 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:03:30] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:03:30] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 56123ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56127ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56778 ms. Remains : 352/352 places, 296/296 transitions.
Treatment of property DES-PT-60a-LTLFireability-07 finished in 378508 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(G(p0))&&(X(p2)||p1)))))'
Support contains 4 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 8 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 353 cols
[2024-06-01 00:03:56] [INFO ] Computed 58 invariants in 5 ms
[2024-06-01 00:03:56] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-06-01 00:03:56] [INFO ] Invariant cache hit.
[2024-06-01 00:03:57] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-06-01 00:03:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 296 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/353 variables, 33/397 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 13/411 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 297/650 variables, 353/764 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 00:04:10] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 00:04:16] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 00:04:17] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-06-01 00:04:19] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 2/768 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 650/650 variables, and 768 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30015 ms.
Refiners :[Domain max(s): 353/353 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 1/353 variables, 33/397 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 13/411 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 00:04:30] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:04:32] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:04:32] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 297/650 variables, 353/771 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 296/1067 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/650 variables, and 1067 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30027 ms.
Refiners :[Domain max(s): 353/353 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 7/7 constraints]
After SMT, in 60264ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Finished structural reductions in LTL mode , in 1 iterations and 61312 ms. Remains : 353/353 places, 297/297 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-60a-LTLFireability-08
Product exploration explored 100000 steps with 2219 reset in 225 ms.
Product exploration explored 100000 steps with 2213 reset in 253 ms.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 95 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 117 steps (0 resets) in 5 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 353 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 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 10 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-01 00:04:58] [INFO ] Invariant cache hit.
[2024-06-01 00:04:59] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-06-01 00:04:59] [INFO ] Invariant cache hit.
[2024-06-01 00:04:59] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
[2024-06-01 00:04:59] [INFO ] Redundant transitions in 1 ms returned []
Running 296 sub problems to find dead transitions.
[2024-06-01 00:04:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 296 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/353 variables, 33/397 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 13/411 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 297/650 variables, 353/764 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 00:05:12] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 00:05:18] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 00:05:20] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-06-01 00:05:22] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 2/768 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 650/650 variables, and 768 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30016 ms.
Refiners :[Domain max(s): 353/353 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 1/353 variables, 33/397 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 13/411 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 00:05:32] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:05:34] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:05:34] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 297/650 variables, 353/771 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 296/1067 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/650 variables, and 1067 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30012 ms.
Refiners :[Domain max(s): 353/353 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 7/7 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61323 ms. Remains : 353/353 places, 297/297 transitions.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 89 steps (1 resets) in 7 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2213 reset in 232 ms.
Product exploration explored 100000 steps with 2223 reset in 252 ms.
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-01 00:06:01] [INFO ] Invariant cache hit.
[2024-06-01 00:06:01] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-06-01 00:06:01] [INFO ] Invariant cache hit.
[2024-06-01 00:06:02] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2024-06-01 00:06:02] [INFO ] Redundant transitions in 1 ms returned []
Running 296 sub problems to find dead transitions.
[2024-06-01 00:06:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 296 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/353 variables, 33/397 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 13/411 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 297/650 variables, 353/764 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 00:06:15] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 00:06:21] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 00:06:22] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:06:24] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 2/768 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 650/650 variables, and 768 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30019 ms.
Refiners :[Domain max(s): 353/353 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 352/352 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 1/353 variables, 33/397 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 13/411 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 00:06:34] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:06:36] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:06:36] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 297/650 variables, 353/771 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 296/1067 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/650 variables, and 1067 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30014 ms.
Refiners :[Domain max(s): 353/353 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 7/7 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61387 ms. Remains : 353/353 places, 297/297 transitions.
Treatment of property DES-PT-60a-LTLFireability-08 finished in 185870 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 U !p1)))&&F(p2)))'
Support contains 6 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 14 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-06-01 00:07:02] [INFO ] Computed 58 invariants in 6 ms
[2024-06-01 00:07:02] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-01 00:07:02] [INFO ] Invariant cache hit.
[2024-06-01 00:07:03] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-06-01 00:07:03] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-01 00:07:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:07:09] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:07:19] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25188 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:07:32] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:07:32] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55452ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55455ms
Starting structural reductions in SI_LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56108 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) p1), p1, (NOT p2), p1]
Running random walk in product with property : DES-PT-60a-LTLFireability-09
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA DES-PT-60a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-09 finished in 56298 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((G(p1)&&F(p2)&&p0))))'
Support contains 5 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 7 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-06-01 00:07:58] [INFO ] Invariant cache hit.
[2024-06-01 00:07:58] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-01 00:07:59] [INFO ] Invariant cache hit.
[2024-06-01 00:07:59] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-06-01 00:07:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:08:05] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:08:16] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 26286 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:08:29] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:08:29] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 56512ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56515ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57176 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DES-PT-60a-LTLFireability-10
Product exploration explored 100000 steps with 2220 reset in 255 ms.
Product exploration explored 100000 steps with 2224 reset in 266 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p1)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 127 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (888 resets) in 188 ms. (211 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (256 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
[2024-06-01 00:08:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/79 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/79 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:08:57] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/289 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 295/584 variables, 289/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 64/648 variables, 63/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 652ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 499 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 352 transition count 294
Applied a total of 7 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (524 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (286 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1250212 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :0 out of 1
Probabilistic random walk after 1250212 steps, saw 174784 distinct states, run finished after 3001 ms. (steps per millisecond=416 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:09:01] [INFO ] Computed 60 invariants in 10 ms
[2024-06-01 00:09:01] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/88 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/88 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:09:01] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 294/586 variables, 292/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 60/646 variables, 60/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 664ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 490 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-01 00:09:02] [INFO ] Invariant cache hit.
[2024-06-01 00:09:02] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-01 00:09:02] [INFO ] Invariant cache hit.
[2024-06-01 00:09:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 00:09:03] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2024-06-01 00:09:03] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-01 00:09:03] [INFO ] Invariant cache hit.
[2024-06-01 00:09:03] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:09:15] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:09:19] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (OVERLAPS) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:09:35] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/711 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 711 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60994 ms. Remains : 352/352 places, 294/294 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 352 transition count 294
Applied a total of 1 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:10:03] [INFO ] Computed 60 invariants in 8 ms
[2024-06-01 00:10:03] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:10:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 00:10:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2024-06-01 00:10:03] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:10:03] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:10:03] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 477 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p1)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 302 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-06-01 00:10:04] [INFO ] Computed 58 invariants in 5 ms
[2024-06-01 00:10:04] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 00:10:04] [INFO ] Invariant cache hit.
[2024-06-01 00:10:05] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-06-01 00:10:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:10:11] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:10:22] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 26926 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:10:36] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:10:36] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 57176ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 57180ms
Finished structural reductions in LTL mode , in 1 iterations and 57803 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X p1), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 124 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (890 resets) in 408 ms. (97 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40001 steps (250 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
[2024-06-01 00:11:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/79 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/79 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:11:03] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/289 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 295/584 variables, 289/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 64/648 variables, 63/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 1 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 695ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 512 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 352 transition count 294
Applied a total of 7 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (553 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (288 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1203214 steps, run timeout after 3001 ms. (steps per millisecond=400 ) properties seen :0 out of 1
Probabilistic random walk after 1203214 steps, saw 168516 distinct states, run finished after 3001 ms. (steps per millisecond=400 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:11:07] [INFO ] Computed 60 invariants in 7 ms
[2024-06-01 00:11:07] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/88 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/88 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:11:07] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 294/586 variables, 292/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 60/646 variables, 60/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 688ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 511 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-01 00:11:08] [INFO ] Invariant cache hit.
[2024-06-01 00:11:08] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-01 00:11:08] [INFO ] Invariant cache hit.
[2024-06-01 00:11:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 00:11:09] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2024-06-01 00:11:09] [INFO ] Redundant transitions in 2 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-01 00:11:09] [INFO ] Invariant cache hit.
[2024-06-01 00:11:09] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:11:20] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:11:25] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (OVERLAPS) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:11:41] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/711 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 711 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61002 ms. Remains : 352/352 places, 294/294 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 352 transition count 294
Applied a total of 1 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:12:09] [INFO ] Computed 60 invariants in 5 ms
[2024-06-01 00:12:09] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:12:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 00:12:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:12:09] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:12:09] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:12:09] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 426 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X p1), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 286 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 2229 reset in 253 ms.
Product exploration explored 100000 steps with 2244 reset in 277 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-01 00:12:11] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-06-01 00:12:11] [INFO ] Computed 58 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:12:17] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:12:20] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:12:20] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:12:24] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 414 constraints, problems are : Problem set: 0 solved, 295 unsolved in 21960 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 52205ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 52208ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52227 ms. Remains : 352/352 places, 296/296 transitions.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 3 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-01 00:13:03] [INFO ] Invariant cache hit.
[2024-06-01 00:13:03] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 00:13:03] [INFO ] Invariant cache hit.
[2024-06-01 00:13:04] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-06-01 00:13:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:13:10] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:13:21] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 26221 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:13:34] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:13:34] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 56472ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56475ms
Finished structural reductions in LTL mode , in 1 iterations and 57085 ms. Remains : 352/352 places, 296/296 transitions.
Treatment of property DES-PT-60a-LTLFireability-10 finished in 362090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U X(p1))||G(p2)))))'
Support contains 6 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 11 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-06-01 00:14:00] [INFO ] Invariant cache hit.
[2024-06-01 00:14:01] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-06-01 00:14:01] [INFO ] Invariant cache hit.
[2024-06-01 00:14:01] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-06-01 00:14:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:14:18] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 26574 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:14:32] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:14:32] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 56794ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56798ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57457 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 376 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-60a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-11 finished in 57863 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||X(G(p1))) U X(!p2))))'
Support contains 7 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 11 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-06-01 00:14:58] [INFO ] Invariant cache hit.
[2024-06-01 00:14:58] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-01 00:14:58] [INFO ] Invariant cache hit.
[2024-06-01 00:14:59] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-06-01 00:14:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:15:05] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:15:15] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25308 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:15:28] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:15:28] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55550ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55554ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56159 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 233 ms :[p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : DES-PT-60a-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 351 ms.
Product exploration explored 100000 steps with 33333 reset in 361 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLFireability-12 finished in 57145 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 U p1)||p0)) U !F(X(p2))))'
Support contains 6 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 11 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-06-01 00:15:55] [INFO ] Invariant cache hit.
[2024-06-01 00:15:56] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 00:15:56] [INFO ] Invariant cache hit.
[2024-06-01 00:15:56] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-06-01 00:15:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:16:02] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:16:12] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25424 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:16:25] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:16:25] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55663ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55667ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56251 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 141 ms :[p2, p2, true, p2]
Running random walk in product with property : DES-PT-60a-LTLFireability-13
Product exploration explored 100000 steps with 2229 reset in 323 ms.
Product exploration explored 100000 steps with 2197 reset in 324 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1))))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1)))))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 156 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[p2, true, p2]
RANDOM walk for 40000 steps (885 resets) in 488 ms. (81 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (254 resets) in 277 ms. (143 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (233 resets) in 420 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (256 resets) in 519 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (229 resets) in 420 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (196 resets) in 340 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (201 resets) in 449 ms. (88 steps per ms) remains 6/6 properties
[2024-06-01 00:16:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 62/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/284 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/290 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 295/585 variables, 290/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 63/648 variables, 62/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 6 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/284 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/290 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 295/585 variables, 290/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 63/648 variables, 62/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/648 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 416 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2498 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3142ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 29831 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 352 transition count 294
Applied a total of 6 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (537 resets) in 1439 ms. (27 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (288 resets) in 358 ms. (111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (274 resets) in 407 ms. (98 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (290 resets) in 337 ms. (118 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (129 resets) in 393 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (82 resets) in 348 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (93 resets) in 348 ms. (114 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 484501 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 6
Probabilistic random walk after 484501 steps, saw 69704 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:17:31] [INFO ] Computed 60 invariants in 3 ms
[2024-06-01 00:17:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 71/89 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/293 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 294/587 variables, 293/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 59/646 variables, 59/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 414 constraints, problems are : Problem set: 0 solved, 6 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/293 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 294/587 variables, 293/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 59/646 variables, 59/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 6/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/646 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 420 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1810 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2416ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 22829 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-01 00:17:56] [INFO ] Invariant cache hit.
[2024-06-01 00:17:56] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-01 00:17:56] [INFO ] Invariant cache hit.
[2024-06-01 00:17:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:17:57] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-06-01 00:17:57] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-01 00:17:57] [INFO ] Invariant cache hit.
[2024-06-01 00:17:57] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:18:04] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:18:08] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:18:09] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (OVERLAPS) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 26709 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:18:26] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:18:26] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/712 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 713 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 6/6 constraints]
After SMT, in 56951ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 56955ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57576 ms. Remains : 352/352 places, 294/294 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1))))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND p2 p0) (AND p2 (NOT p1)))))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 16 factoid took 231 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 93 ms :[p2, true, p2]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-06-01 00:18:54] [INFO ] Computed 58 invariants in 5 ms
[2024-06-01 00:18:54] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 00:18:54] [INFO ] Invariant cache hit.
[2024-06-01 00:18:55] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2024-06-01 00:18:55] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-01 00:18:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:19:01] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:19:12] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 26937 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 57202ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 57206ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57817 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1)))))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 164 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[p2, true, p2]
RANDOM walk for 40000 steps (907 resets) in 1254 ms. (31 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (254 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (232 resets) in 384 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (257 resets) in 422 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (229 resets) in 529 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (211 resets) in 411 ms. (97 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (203 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
[2024-06-01 00:19:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 62/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/284 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/290 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 295/585 variables, 290/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 63/648 variables, 62/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 6 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/284 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/290 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 295/585 variables, 290/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 63/648 variables, 62/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/648 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 416 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2459 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3125ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 19900 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 352 transition count 294
Applied a total of 6 rules in 21 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (558 resets) in 1561 ms. (25 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (291 resets) in 295 ms. (135 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (275 resets) in 295 ms. (135 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (291 resets) in 311 ms. (128 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (140 resets) in 382 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (76 resets) in 304 ms. (131 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (94 resets) in 476 ms. (83 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 457789 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 6
Probabilistic random walk after 457789 steps, saw 66339 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:20:21] [INFO ] Computed 60 invariants in 3 ms
[2024-06-01 00:20:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 71/89 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/293 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 294/587 variables, 293/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 59/646 variables, 59/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 414 constraints, problems are : Problem set: 0 solved, 6 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 204/293 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 294/587 variables, 293/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 59/646 variables, 59/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 6/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/646 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 420 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2417ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 13255 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-01 00:20:36] [INFO ] Invariant cache hit.
[2024-06-01 00:20:37] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 00:20:37] [INFO ] Invariant cache hit.
[2024-06-01 00:20:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:20:37] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-06-01 00:20:37] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-01 00:20:37] [INFO ] Invariant cache hit.
[2024-06-01 00:20:37] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:20:44] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:20:49] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:20:50] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (OVERLAPS) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 26048 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:21:05] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:21:06] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/712 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 713 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 6/6 constraints]
After SMT, in 56281ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 56283ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56965 ms. Remains : 352/352 places, 294/294 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 (NOT p1)))))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 16 factoid took 170 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 70 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 61 ms :[p2, true, p2]
Product exploration explored 100000 steps with 2219 reset in 283 ms.
Product exploration explored 100000 steps with 2208 reset in 320 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-06-01 00:21:34] [INFO ] Computed 58 invariants in 7 ms
[2024-06-01 00:21:35] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 00:21:35] [INFO ] Invariant cache hit.
[2024-06-01 00:21:35] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2024-06-01 00:21:35] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-01 00:21:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:21:41] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25688 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:22:05] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:22:05] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55901ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55904ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56536 ms. Remains : 352/352 places, 296/296 transitions.
Treatment of property DES-PT-60a-LTLFireability-13 finished in 395601 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 5 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 7 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-06-01 00:22:31] [INFO ] Invariant cache hit.
[2024-06-01 00:22:31] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-01 00:22:31] [INFO ] Invariant cache hit.
[2024-06-01 00:22:32] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-06-01 00:22:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:22:38] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:22:48] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25526 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:23:01] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:23:01] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55749ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55753ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56414 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-14
Product exploration explored 100000 steps with 2238 reset in 229 ms.
Product exploration explored 100000 steps with 2235 reset in 255 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (898 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (171 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1229580 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :0 out of 1
Probabilistic random walk after 1229580 steps, saw 174748 distinct states, run finished after 3001 ms. (steps per millisecond=409 ) properties seen :0
[2024-06-01 00:23:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:23:32] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 64/648 variables, 63/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:23:32] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-06-01 00:23:32] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 414 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1433ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1041 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 8 place count 352 transition count 294
Applied a total of 8 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (519 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (71 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1302382 steps, run timeout after 3001 ms. (steps per millisecond=433 ) properties seen :0 out of 1
Probabilistic random walk after 1302382 steps, saw 180963 distinct states, run finished after 3001 ms. (steps per millisecond=433 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:23:37] [INFO ] Computed 60 invariants in 7 ms
[2024-06-01 00:23:37] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/86 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 206/292 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/86 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 206/292 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:23:37] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 294/586 variables, 292/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:23:38] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-06-01 00:23:38] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-06-01 00:23:38] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-06-01 00:23:38] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-06-01 00:23:38] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 5/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 60/646 variables, 60/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/646 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1412 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1779ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 916 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-01 00:23:39] [INFO ] Invariant cache hit.
[2024-06-01 00:23:40] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 00:23:40] [INFO ] Invariant cache hit.
[2024-06-01 00:23:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 00:23:40] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2024-06-01 00:23:40] [INFO ] Redundant transitions in 0 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-01 00:23:40] [INFO ] Invariant cache hit.
[2024-06-01 00:23:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:23:52] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:23:59] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:24:12] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 00:24:14] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:24:14] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/713 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:24:38] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2024-06-01 00:24:38] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 715 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 7/7 constraints]
After SMT, in 60251ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60946 ms. Remains : 352/352 places, 294/294 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 352 transition count 294
Applied a total of 1 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:24:40] [INFO ] Computed 60 invariants in 6 ms
[2024-06-01 00:24:40] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:24:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-06-01 00:24:41] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:24:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:24:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2024-06-01 00:24:41] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:24:41] [INFO ] After 344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:24:41] [INFO ] After 570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 699 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-06-01 00:24:41] [INFO ] Computed 58 invariants in 3 ms
[2024-06-01 00:24:42] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-01 00:24:42] [INFO ] Invariant cache hit.
[2024-06-01 00:24:42] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2024-06-01 00:24:42] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-01 00:24:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:24:48] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:24:59] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25683 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:25:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 00:25:12] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55940ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55942ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56642 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (888 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (173 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1313592 steps, run timeout after 3001 ms. (steps per millisecond=437 ) properties seen :0 out of 1
Probabilistic random walk after 1313592 steps, saw 185756 distinct states, run finished after 3001 ms. (steps per millisecond=437 ) properties seen :0
[2024-06-01 00:25:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/80 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:25:42] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 64/648 variables, 63/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:25:42] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-06-01 00:25:42] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 414 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1060 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1435ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1027 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 8 place count 352 transition count 294
Applied a total of 8 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (538 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (65 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1294758 steps, run timeout after 3001 ms. (steps per millisecond=431 ) properties seen :0 out of 1
Probabilistic random walk after 1294758 steps, saw 180118 distinct states, run finished after 3001 ms. (steps per millisecond=431 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:25:47] [INFO ] Computed 60 invariants in 13 ms
[2024-06-01 00:25:47] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/86 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 206/292 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/86 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 206/292 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:25:47] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 294/586 variables, 292/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:25:48] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:25:48] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2024-06-01 00:25:48] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-06-01 00:25:48] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:25:48] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 5/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 60/646 variables, 60/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/646 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1306 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1704ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 914 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-01 00:25:49] [INFO ] Invariant cache hit.
[2024-06-01 00:25:50] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 00:25:50] [INFO ] Invariant cache hit.
[2024-06-01 00:25:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 00:25:50] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2024-06-01 00:25:50] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-01 00:25:50] [INFO ] Invariant cache hit.
[2024-06-01 00:25:50] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:26:02] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:26:10] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:26:22] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 00:26:24] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:26:24] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/713 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:26:48] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-06-01 00:26:48] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 715 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 7/7 constraints]
After SMT, in 60272ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60275ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60986 ms. Remains : 352/352 places, 294/294 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 352 transition count 294
Applied a total of 1 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:26:50] [INFO ] Computed 60 invariants in 4 ms
[2024-06-01 00:26:51] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-06-01 00:26:51] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-06-01 00:26:51] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:26:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:26:51] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2024-06-01 00:26:51] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:26:51] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:26:51] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 709 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 2233 reset in 236 ms.
Product exploration explored 100000 steps with 2226 reset in 256 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-06-01 00:26:52] [INFO ] Computed 58 invariants in 5 ms
[2024-06-01 00:26:52] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 00:26:52] [INFO ] Invariant cache hit.
[2024-06-01 00:26:52] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2024-06-01 00:26:52] [INFO ] Redundant transitions in 0 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-01 00:26:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:26:58] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:27:09] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25630 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:27:22] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:27:22] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55845ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55848ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56529 ms. Remains : 352/352 places, 296/296 transitions.
Treatment of property DES-PT-60a-LTLFireability-14 finished in 317394 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)))'
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 6 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-06-01 00:27:48] [INFO ] Invariant cache hit.
[2024-06-01 00:27:49] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 00:27:49] [INFO ] Invariant cache hit.
[2024-06-01 00:27:49] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-06-01 00:27:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:28:06] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25613 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:28:19] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:28:19] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55856ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55858ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56557 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 406 ms.
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLFireability-15 finished in 57471 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((X(X(F(p0)))&&G(p1))))'
Found a Shortening insensitive property : DES-PT-60a-LTLFireability-00
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 6 out of 353 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 21 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-06-01 00:28:46] [INFO ] Invariant cache hit.
[2024-06-01 00:28:46] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-06-01 00:28:46] [INFO ] Invariant cache hit.
[2024-06-01 00:28:47] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-06-01 00:28:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:28:53] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:29:03] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25110 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:29:16] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:29:16] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55319ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55321ms
Starting structural reductions in LI_LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 56071 ms. Remains : 352/353 places, 296/297 transitions.
Running random walk in product with property : DES-PT-60a-LTLFireability-00
Product exploration explored 100000 steps with 4132 reset in 226 ms.
Product exploration explored 100000 steps with 4176 reset in 248 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 63 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (897 resets) in 318 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (255 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (256 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 741160 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 2
Probabilistic random walk after 741160 steps, saw 113061 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
[2024-06-01 00:29:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/81 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 202/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 2 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/81 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 202/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:29:47] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:29:47] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 64/648 variables, 63/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 414 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1825 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2140ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 1706 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 352 transition count 294
Applied a total of 7 rules in 19 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (559 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (293 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1274275 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :0 out of 1
Probabilistic random walk after 1274275 steps, saw 177785 distinct states, run finished after 3001 ms. (steps per millisecond=424 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:29:53] [INFO ] Computed 60 invariants in 3 ms
[2024-06-01 00:29:53] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/89 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/89 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:29:53] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:29:54] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 294/586 variables, 292/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 60/646 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 958ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 896 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-01 00:29:55] [INFO ] Invariant cache hit.
[2024-06-01 00:29:55] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-06-01 00:29:55] [INFO ] Invariant cache hit.
[2024-06-01 00:29:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 00:29:56] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2024-06-01 00:29:56] [INFO ] Redundant transitions in 0 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-01 00:29:56] [INFO ] Invariant cache hit.
[2024-06-01 00:29:56] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:30:07] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:30:12] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (OVERLAPS) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:30:28] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/711 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 711 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61020 ms. Remains : 352/352 places, 294/294 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 352 transition count 294
Applied a total of 1 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:30:56] [INFO ] Computed 60 invariants in 3 ms
[2024-06-01 00:30:56] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:30:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 00:30:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:30:56] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:30:56] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:30:56] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 424 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-06-01 00:30:57] [INFO ] Computed 58 invariants in 3 ms
[2024-06-01 00:30:57] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-01 00:30:57] [INFO ] Invariant cache hit.
[2024-06-01 00:30:57] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-06-01 00:30:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:31:03] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:31:13] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 24960 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:31:26] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:31:26] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55190ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55193ms
Finished structural reductions in LTL mode , in 1 iterations and 55830 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (873 resets) in 644 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (258 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (254 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 730510 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 2
Probabilistic random walk after 730510 steps, saw 111645 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
[2024-06-01 00:31:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/81 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 202/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 2 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/81 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 202/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:31:57] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:31:57] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 64/648 variables, 63/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 414 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1856 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2139ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 1839 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 352 transition count 294
Applied a total of 7 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (541 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (292 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1297076 steps, run timeout after 3001 ms. (steps per millisecond=432 ) properties seen :0 out of 1
Probabilistic random walk after 1297076 steps, saw 180359 distinct states, run finished after 3001 ms. (steps per millisecond=432 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:32:03] [INFO ] Computed 60 invariants in 10 ms
[2024-06-01 00:32:03] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/89 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/89 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 294/586 variables, 292/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 60/646 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 877ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 868 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-01 00:32:05] [INFO ] Invariant cache hit.
[2024-06-01 00:32:05] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 00:32:05] [INFO ] Invariant cache hit.
[2024-06-01 00:32:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 00:32:06] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2024-06-01 00:32:06] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-01 00:32:06] [INFO ] Invariant cache hit.
[2024-06-01 00:32:06] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:32:17] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:32:22] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (OVERLAPS) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 29575 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:32:37] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/711 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 711 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints]
After SMT, in 59835ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 59838ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60464 ms. Remains : 352/352 places, 294/294 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 352 transition count 294
Applied a total of 1 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:33:05] [INFO ] Computed 60 invariants in 10 ms
[2024-06-01 00:33:05] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:33:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 00:33:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:33:06] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:33:06] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:33:06] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 443 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 4187 reset in 226 ms.
Product exploration explored 100000 steps with 4095 reset in 246 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-01 00:33:07] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-06-01 00:33:07] [INFO ] Computed 58 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:33:13] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:33:16] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:33:16] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:33:20] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/648 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 414 constraints, problems are : Problem set: 0 solved, 295 unsolved in 21458 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 51730ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 51732ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51750 ms. Remains : 352/352 places, 296/296 transitions.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 3 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-01 00:33:59] [INFO ] Invariant cache hit.
[2024-06-01 00:33:59] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 00:33:59] [INFO ] Invariant cache hit.
[2024-06-01 00:33:59] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-06-01 00:34:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:34:16] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 25002 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:34:28] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:34:29] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55227ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55232ms
Finished structural reductions in LTL mode , in 1 iterations and 55829 ms. Remains : 352/352 places, 296/296 transitions.
Treatment of property DES-PT-60a-LTLFireability-00 finished in 368963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||(p0 U (p1 U X(!p2)))))))'
Found a Lengthening insensitive property : DES-PT-60a-LTLFireability-07
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false]
Support contains 8 out of 353 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 16 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-06-01 00:34:55] [INFO ] Invariant cache hit.
[2024-06-01 00:34:55] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 00:34:55] [INFO ] Invariant cache hit.
[2024-06-01 00:34:56] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-06-01 00:34:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:35:02] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:35:12] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 24956 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:35:25] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:35:25] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 55179ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55184ms
Starting structural reductions in LI_LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 55763 ms. Remains : 352/353 places, 296/297 transitions.
Running random walk in product with property : DES-PT-60a-LTLFireability-07
Product exploration explored 100000 steps with 33255 reset in 338 ms.
Product exploration explored 100000 steps with 33331 reset in 355 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 153 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 9 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (884 resets) in 1388 ms. (28 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40003 steps (184 resets) in 363 ms. (109 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (182 resets) in 305 ms. (130 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (177 resets) in 388 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (186 resets) in 458 ms. (87 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (202 resets) in 404 ms. (98 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (254 resets) in 473 ms. (84 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (253 resets) in 254 ms. (156 steps per ms) remains 7/7 properties
[2024-06-01 00:35:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 66/81 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 00:35:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 205/286 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 3/289 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf1 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 10 (OVERLAPS) 295/584 variables, 289/348 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/348 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 64/648 variables, 63/411 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/648 variables, 0/411 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 411 constraints, problems are : Problem set: 2 solved, 5 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 66/81 variables, 28/33 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 205/286 variables, 24/58 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 3/289 variables, 1/59 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 295/584 variables, 289/348 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 1/349 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 0/349 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 64/648 variables, 63/412 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 4/416 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/416 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/648 variables, 0/416 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 416 constraints, problems are : Problem set: 2 solved, 5 unsolved in 2248 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 3042ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 19674 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 352 transition count 294
Applied a total of 7 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (551 resets) in 880 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (94 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (96 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (102 resets) in 304 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (136 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 567137 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 4
Probabilistic random walk after 567137 steps, saw 81515 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:36:20] [INFO ] Computed 60 invariants in 8 ms
[2024-06-01 00:36:20] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 71/89 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 4 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 00:36:21] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-06-01 00:36:21] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 294/586 variables, 292/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 60/646 variables, 60/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/646 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 421 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1455 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 2043ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 21462 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 352/352 places, 294/294 transitions.
RANDOM walk for 40000 steps (538 resets) in 531 ms. (75 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (89 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (94 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 794171 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 2
Probabilistic random walk after 794171 steps, saw 113660 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
[2024-06-01 00:36:47] [INFO ] Invariant cache hit.
[2024-06-01 00:36:47] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 30/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) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 2 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 30/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) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:36:47] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 60/646 variables, 60/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 418 constraints, problems are : Problem set: 0 solved, 2 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1270ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 5063 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 7 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-01 00:36:53] [INFO ] Invariant cache hit.
[2024-06-01 00:36:53] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 00:36:53] [INFO ] Invariant cache hit.
[2024-06-01 00:36:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 00:36:54] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2024-06-01 00:36:54] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-01 00:36:54] [INFO ] Invariant cache hit.
[2024-06-01 00:36:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:37:05] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:37:09] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (OVERLAPS) 0/646 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 417 constraints, problems are : Problem set: 0 solved, 293 unsolved in 29596 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:37:25] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 294/646 variables, 352/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 293/711 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 711 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 3/3 constraints]
After SMT, in 59855ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 59860ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60492 ms. Remains : 352/352 places, 294/294 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p2) (NOT p0) (NOT p1))), (G (OR (NOT p2) p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) p0 p1))), (F p2), (F p0), (F p1), (F (NOT (OR (NOT p2) p0 p1)))]
Knowledge based reduction with 22 factoid took 372 ms. Reduced automaton from 9 states, 30 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-06-01 00:37:54] [INFO ] Computed 58 invariants in 5 ms
[2024-06-01 00:37:54] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-01 00:37:54] [INFO ] Invariant cache hit.
[2024-06-01 00:37:55] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-06-01 00:37:55] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-01 00:37:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/648 variables, 352/410 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:38:01] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:38:11] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/648 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 0/648 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 412 constraints, problems are : Problem set: 0 solved, 295 unsolved in 24380 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 00:38:23] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:38:23] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 296/648 variables, 352/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 295/709 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 709 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 4/4 constraints]
After SMT, in 54614ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 54618ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55211 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (OR (NOT p2) p0)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 109 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (906 resets) in 1219 ms. (32 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (185 resets) in 326 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (260 resets) in 421 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (203 resets) in 402 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (200 resets) in 274 ms. (145 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (176 resets) in 451 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (252 resets) in 358 ms. (111 steps per ms) remains 6/6 properties
[2024-06-01 00:38:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 66/81 variables, 28/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) 205/286 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3/289 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 1 solved, 5 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 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/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 66/81 variables, 28/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) 205/286 variables, 24/57 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3/289 variables, 1/58 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 1/348 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 00:38:52] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 1/349 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 0/349 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 64/648 variables, 63/412 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 4/416 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/416 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/648 variables, 0/416 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 416 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2210 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 2905ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 20298 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
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 352 transition count 294
Applied a total of 7 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (531 resets) in 1232 ms. (32 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (81 resets) in 253 ms. (157 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (134 resets) in 313 ms. (127 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (146 resets) in 391 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (103 resets) in 299 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (293 resets) in 367 ms. (108 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 562622 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 5
Probabilistic random walk after 562622 steps, saw 80884 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-06-01 00:39:18] [INFO ] Computed 60 invariants in 4 ms
[2024-06-01 00:39:18] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 5 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 71/89 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 203/292 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 00:39:19] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 00:39:20] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/586 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 60/646 variables, 60/418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/646 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/646 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 422 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2517 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 3211ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 25548 ms.
Support contains 8 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-01 00:39:47] [INFO ] Invariant cache hit.
[2024-06-01 00:39:47] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 00:39:47] [INFO ] Invariant cache hit.
[2024-06-01 00:39:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 00:39:47] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2024-06-01 00:39:47] [INFO ] Redundant transitions in 2 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-01 00:39:47] [INFO ] Invariant cache hit.
[2024-06-01 00:39:47] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/646 variables, 352/412 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:39:59] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-01 00:40:03] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.

BK_TIME_CONFINEMENT_REACHED

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

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-60a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-60a, 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 r480-tall-171624189900748"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60a.tgz
mv DES-PT-60a 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;