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.r092-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 itstools
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 r092-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 1716362616111

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 07:23:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 07:23:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:23:37] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-22 07:23:37] [INFO ] Transformed 354 places.
[2024-05-22 07:23:37] [INFO ] Transformed 311 transitions.
[2024-05-22 07:23:37] [INFO ] Found NUPN structural information;
[2024-05-22 07:23:37] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 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 49 ms. Remains 354 /354 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 354 cols
[2024-05-22 07:23:37] [INFO ] Computed 59 invariants in 36 ms
[2024-05-22 07:23:38] [INFO ] Implicit Places using invariants in 476 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 506 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 11 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 583 ms. Remains : 353/354 places, 297/297 transitions.
Support contains 45 out of 353 places after structural reductions.
[2024-05-22 07:23:38] [INFO ] Flatten gal took : 62 ms
[2024-05-22 07:23:38] [INFO ] Flatten gal took : 30 ms
[2024-05-22 07:23:38] [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 (912 resets) in 2370 ms. (16 steps per ms) remains 21/29 properties
BEST_FIRST walk for 4003 steps (24 resets) in 44 ms. (88 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (23 resets) in 44 ms. (88 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (19 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (18 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (16 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (18 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (21 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (13 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (18 resets) in 20 ms. (190 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 4004 steps (23 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (18 resets) in 44 ms. (88 steps per ms) remains 21/21 properties
// Phase 1: matrix 297 rows 353 cols
[2024-05-22 07:23:39] [INFO ] Computed 58 invariants in 14 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 5016 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 5008 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 10143ms 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 60 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 60 ms. Remains : 352/353 places, 294/297 transitions.
RANDOM walk for 40000 steps (532 resets) in 797 ms. (50 steps per ms) remains 18/21 properties
BEST_FIRST walk for 4003 steps (29 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (28 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (11 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (26 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (27 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (28 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (10 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 07:23:50] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 07:23:50] [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-22 07:23:51] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 22 ms to minimize.
[2024-05-22 07:23:51] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:23:51] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-22 07:23:51] [INFO ] Deduced a trap composed of 9 places in 82 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-22 07:23:52] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:23:53] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:23:53] [INFO ] Deduced a trap composed of 11 places in 68 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-22 07:23:54] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:23:54] [INFO ] Deduced a trap composed of 7 places in 75 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 6061 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-22 07:23:57] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:23:58] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:23:58] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-22 07:23:58] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-22 07:23:58] [INFO ] Deduced a trap composed of 20 places in 66 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
At refinement iteration 17 (INCLUDED_ONLY) 0/646 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 07:24:20] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/646 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 07:24:28] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 3 ms to minimize.
[2024-05-22 07:24:28] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/646 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/646 variables, 0/449 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 449 constraints, problems are : Problem set: 0 solved, 18 unsolved in 45011 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: 17/17 constraints]
After SMT, in 51124ms 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 22 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 22 ms. Remains : 352/352 places, 294/294 transitions.
RANDOM walk for 40000 steps (538 resets) in 337 ms. (118 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (25 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (28 resets) in 11 ms. (333 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 4004 steps (10 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (26 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (28 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (28 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (28 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 518255 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 18
Probabilistic random walk after 518255 steps, saw 74171 distinct states, run finished after 3009 ms. (steps per millisecond=172 ) properties seen :0
[2024-05-22 07:24:44] [INFO ] Invariant cache hit.
[2024-05-22 07:24:44] [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-22 07:24:45] [INFO ] Deduced a trap composed of 23 places in 75 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-22 07:24:46] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-22 07:24:46] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:24:46] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-22 07:24:46] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:24:46] [INFO ] Deduced a trap composed of 12 places in 77 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-22 07:24:48] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:24:48] [INFO ] Deduced a trap composed of 7 places in 52 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
[2024-05-22 07:24:49] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/646 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/646 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (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 7195 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, 8/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 294/591 variables, 297/366 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 07:24:53] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 07:24:55] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 55/646 variables, 55/429 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/646 variables, 14/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/646 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 07:25:09] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/646 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/646 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 07:25:24] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/646 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 07:25:32] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/646 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/646 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (OVERLAPS) 0/646 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 446 constraints, problems are : Problem set: 0 solved, 18 unsolved in 65374 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: 14/14 constraints]
After SMT, in 72618ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 6894 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 13 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 13 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 13 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 07:26:04] [INFO ] Invariant cache hit.
[2024-05-22 07:26:04] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-22 07:26:04] [INFO ] Invariant cache hit.
[2024-05-22 07:26:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:26:04] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-22 07:26:04] [INFO ] Redundant transitions in 22 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 07:26:04] [INFO ] Invariant cache hit.
[2024-05-22 07:26:04] [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-22 07:26:11] [INFO ] Deduced a trap composed of 7 places in 59 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-22 07:26:16] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:26:17] [INFO ] Deduced a trap composed of 13 places in 42 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 27215 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-22 07:26:34] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-22 07:26:34] [INFO ] Deduced a trap composed of 9 places in 40 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-22 07:26:57] [INFO ] Deduced a trap composed of 12 places in 46 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 30020 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 57532ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 57538ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58128 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 10 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 07:27:02] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 07:27:02] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 07:27:02] [INFO ] Invariant cache hit.
[2024-05-22 07:27:02] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 07:27:02] [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-22 07:27:08] [INFO ] Deduced a trap composed of 12 places in 73 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-22 07:27:19] [INFO ] Deduced a trap composed of 9 places in 59 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 25307 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-22 07:27:32] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
[2024-05-22 07:27:32] [INFO ] Deduced a trap composed of 12 places in 27 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 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 55589ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55594ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56144 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 280 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 4257 reset in 352 ms.
Product exploration explored 100000 steps with 4187 reset in 284 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 122 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 127 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (891 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (252 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (258 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1004413 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :0 out of 2
Probabilistic random walk after 1004413 steps, saw 143571 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
[2024-05-22 07:28:02] [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 282 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-22 07:28:03] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-22 07:28:03] [INFO ] Deduced a trap composed of 17 places in 80 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 1844 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 2136ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 1086 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 22 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 (541 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (289 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1589332 steps, run timeout after 3001 ms. (steps per millisecond=529 ) properties seen :0 out of 1
Probabilistic random walk after 1589332 steps, saw 222238 distinct states, run finished after 3001 ms. (steps per millisecond=529 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 07:28:09] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 07:28:09] [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 288 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-22 07:28:09] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:28:09] [INFO ] Deduced a trap composed of 11 places in 59 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 503 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 809ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 570 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 10 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 07:28:10] [INFO ] Invariant cache hit.
[2024-05-22 07:28:10] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-22 07:28:10] [INFO ] Invariant cache hit.
[2024-05-22 07:28:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 07:28:11] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2024-05-22 07:28:11] [INFO ] Redundant transitions in 11 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 07:28:11] [INFO ] Invariant cache hit.
[2024-05-22 07:28:11] [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-22 07:28:22] [INFO ] Deduced a trap composed of 9 places in 38 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-05-22 07:28:27] [INFO ] Deduced a trap composed of 10 places in 47 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 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-05-22 07:28:43] [INFO ] Deduced a trap composed of 6 places in 18 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 60280ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60283ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60875 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 18 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-22 07:29:11] [INFO ] Computed 60 invariants in 12 ms
[2024-05-22 07:29:11] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:29:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 07:29:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2024-05-22 07:29:11] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 07:29:11] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 07:29:11] [INFO ] After 382ms 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 p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 100 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 140 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)]
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 4 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 07:29:12] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 07:29:12] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-22 07:29:12] [INFO ] Invariant cache hit.
[2024-05-22 07:29:12] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 07:29:12] [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-22 07:29:18] [INFO ] Deduced a trap composed of 12 places in 81 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-05-22 07:29:29] [INFO ] Deduced a trap composed of 9 places in 60 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 25721 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-22 07:29:42] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
[2024-05-22 07:29:42] [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 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 55982ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55986ms
Finished structural reductions in LTL mode , in 1 iterations and 56541 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 68 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)]
RANDOM walk for 40000 steps (897 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (258 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (250 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 823703 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 2
Probabilistic random walk after 823703 steps, saw 123143 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
[2024-05-22 07:30:12] [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 289 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-22 07:30:13] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-22 07:30:13] [INFO ] Deduced a trap composed of 17 places in 109 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 2064 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 2370ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 1184 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 (529 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (291 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1439000 steps, run timeout after 3001 ms. (steps per millisecond=479 ) properties seen :0 out of 1
Probabilistic random walk after 1439000 steps, saw 200863 distinct states, run finished after 3001 ms. (steps per millisecond=479 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 07:30:18] [INFO ] Computed 60 invariants in 15 ms
[2024-05-22 07:30: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 270 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-22 07:30:19] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-22 07:30:19] [INFO ] Deduced a trap composed of 11 places in 56 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 546 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 838ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 579 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-22 07:30:20] [INFO ] Invariant cache hit.
[2024-05-22 07:30:20] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-22 07:30:20] [INFO ] Invariant cache hit.
[2024-05-22 07:30:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 07:30:20] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2024-05-22 07:30:20] [INFO ] Redundant transitions in 3 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 07:30:20] [INFO ] Invariant cache hit.
[2024-05-22 07:30:20] [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-22 07:30:32] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 8 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 07:30:37] [INFO ] Deduced a trap composed of 10 places in 49 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 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: 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-22 07:30:53] [INFO ] Deduced a trap composed of 6 places in 15 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 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: 3/3 constraints]
After SMT, in 60242ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60808 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 16 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-22 07:31:21] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 07:31:21] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:31:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 07:31:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 07:31:21] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 07:31:21] [INFO ] After 209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 07:31:21] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 425 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 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 149 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 123 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 4105 reset in 221 ms.
Product exploration explored 100000 steps with 4136 reset in 240 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 149 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 27 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 07:31:22] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 07:31:22] [INFO ] Computed 58 invariants in 4 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-22 07:31:28] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-22 07:31:31] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:31:31] [INFO ] Deduced a trap composed of 9 places in 55 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-22 07:31:35] [INFO ] Deduced a trap composed of 12 places in 43 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 22046 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 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 52310ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 52313ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52351 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin1463097516204448529
[2024-05-22 07:32:15] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1463097516204448529
Running compilation step : cd /tmp/ltsmin1463097516204448529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 682 ms.
Running link step : cd /tmp/ltsmin1463097516204448529;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1463097516204448529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6678250855800948525.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 18 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 07:32:30] [INFO ] Invariant cache hit.
[2024-05-22 07:32:30] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 07:32:30] [INFO ] Invariant cache hit.
[2024-05-22 07:32:30] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 07:32:30] [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-22 07:32:36] [INFO ] Deduced a trap composed of 12 places in 86 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-05-22 07:32:47] [INFO ] Deduced a trap composed of 9 places in 57 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 25343 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-22 07:33:00] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 07:33:00] [INFO ] Deduced a trap composed of 12 places in 20 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 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 55580ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55584ms
Finished structural reductions in LTL mode , in 1 iterations and 56116 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin16002911583459577920
[2024-05-22 07:33:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16002911583459577920
Running compilation step : cd /tmp/ltsmin16002911583459577920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 588 ms.
Running link step : cd /tmp/ltsmin16002911583459577920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16002911583459577920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14394532571282136381.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 07:33:41] [INFO ] Flatten gal took : 23 ms
[2024-05-22 07:33:41] [INFO ] Flatten gal took : 22 ms
[2024-05-22 07:33:41] [INFO ] Time to serialize gal into /tmp/LTL11123624569499308544.gal : 5 ms
[2024-05-22 07:33:41] [INFO ] Time to serialize properties into /tmp/LTL3702084331279503504.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11123624569499308544.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3168876535260264396.hoa' '-atoms' '/tmp/LTL3702084331279503504.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3702084331279503504.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3168876535260264396.hoa
Detected timeout of ITS tools.
[2024-05-22 07:33:56] [INFO ] Flatten gal took : 21 ms
[2024-05-22 07:33:56] [INFO ] Flatten gal took : 18 ms
[2024-05-22 07:33:56] [INFO ] Time to serialize gal into /tmp/LTL159305245948024739.gal : 4 ms
[2024-05-22 07:33:56] [INFO ] Time to serialize properties into /tmp/LTL17769412397664573753.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL159305245948024739.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17769412397664573753.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((p188==0)||(p244==0))||((p10==0)||(p272==0)))||(p274==0))"))))&&(G("((p199!=1)||(p244!=1))")))))
Formula 0 simplified : G(XXG!"((((p188==0)||(p244==0))||((p10==0)||(p272==0)))||(p274==0))" | F!"((p199!=1)||(p244!=1))")
Detected timeout of ITS tools.
[2024-05-22 07:34:11] [INFO ] Flatten gal took : 18 ms
[2024-05-22 07:34:11] [INFO ] Applying decomposition
[2024-05-22 07:34:11] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16999005410652062035.txt' '-o' '/tmp/graph16999005410652062035.bin' '-w' '/tmp/graph16999005410652062035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16999005410652062035.bin' '-l' '-1' '-v' '-w' '/tmp/graph16999005410652062035.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:34:12] [INFO ] Decomposing Gal with order
[2024-05-22 07:34:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:34:12] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-22 07:34:12] [INFO ] Flatten gal took : 56 ms
[2024-05-22 07:34:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 7 ms.
[2024-05-22 07:34:12] [INFO ] Time to serialize gal into /tmp/LTL17583590077623014204.gal : 5 ms
[2024-05-22 07:34:12] [INFO ] Time to serialize properties into /tmp/LTL11551575529335934389.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17583590077623014204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11551575529335934389.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((u2.p188==0)||(u2.p244==0))||((i3.u14.p10==0)||(i3.u13.p272==0)))||(i3.u14.p274==0))"))))&&(G("((u2.p199!=1)||(u2.p244...166
Formula 0 simplified : G(XXG!"((((u2.p188==0)||(u2.p244==0))||((i3.u14.p10==0)||(i3.u13.p272==0)))||(i3.u14.p274==0))" | F!"((u2.p199!=1)||(u2.p244!=1))")
Detected timeout of ITS tools.
Treatment of property DES-PT-60a-LTLFireability-00 finished in 444880 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 25 ms. Remains 351 /353 variables (removed 2) and now considering 295/297 (removed 2) transitions.
// Phase 1: matrix 295 rows 351 cols
[2024-05-22 07:34:27] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 07:34:27] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 07:34:27] [INFO ] Invariant cache hit.
[2024-05-22 07:34:27] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-22 07:34:27] [INFO ] Redundant transitions in 1 ms returned []
Running 292 sub problems to find dead transitions.
[2024-05-22 07:34:27] [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-22 07:34:37] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 5 ms to minimize.
[2024-05-22 07:34:37] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-22 07:34:37] [INFO ] Deduced a trap composed of 11 places in 41 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-22 07:34:45] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:34:45] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:34:45] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:34:45] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-22 07:34:45] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:34:47] [INFO ] Deduced a trap composed of 12 places in 76 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-22 07:34:54] [INFO ] Deduced a trap composed of 8 places in 85 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 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 30016 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 60267ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
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 60841 ms. Remains : 351/353 places, 295/297 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-01
Product exploration explored 100000 steps with 2283 reset in 205 ms.
Product exploration explored 100000 steps with 2262 reset in 204 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 83 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 (904 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (190 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1446880 steps, run timeout after 3001 ms. (steps per millisecond=482 ) properties seen :0 out of 1
Probabilistic random walk after 1446880 steps, saw 202548 distinct states, run finished after 3001 ms. (steps per millisecond=482 ) properties seen :0
[2024-05-22 07:35:31] [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 275 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 471 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 752ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 531 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 21 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 21 ms. Remains : 351/351 places, 293/295 transitions.
RANDOM walk for 40000 steps (651 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (111 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1428112 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :0 out of 1
Probabilistic random walk after 1428112 steps, saw 200735 distinct states, run finished after 3001 ms. (steps per millisecond=475 ) properties seen :0
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 07:35:36] [INFO ] Computed 60 invariants in 15 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 261 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-22 07:35:36] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 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 482 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 761ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2726 steps, including 1 resets, run visited all 1 properties in 13 ms. (steps per millisecond=209 )
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 108 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 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 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 16 ms. Remains 351 /351 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 351 cols
[2024-05-22 07:35:37] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 07:35:37] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 07:35:37] [INFO ] Invariant cache hit.
[2024-05-22 07:35:37] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-05-22 07:35:37] [INFO ] Redundant transitions in 1 ms returned []
Running 292 sub problems to find dead transitions.
[2024-05-22 07:35:37] [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-22 07:35:46] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:35:47] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-22 07:35:47] [INFO ] Deduced a trap composed of 11 places in 33 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-22 07:35:54] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:35:54] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:35:54] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-22 07:35:54] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-22 07:35:54] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:35:56] [INFO ] Deduced a trap composed of 12 places in 68 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-22 07:36:04] [INFO ] Deduced a trap composed of 8 places in 85 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
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 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 30021 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 60261ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60264ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60819 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 76 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 (912 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (176 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1476478 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :0 out of 1
Probabilistic random walk after 1476478 steps, saw 206387 distinct states, run finished after 3001 ms. (steps per millisecond=491 ) properties seen :0
[2024-05-22 07:36:41] [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 270 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 502 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 780ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 510 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 15 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 15 ms. Remains : 351/351 places, 293/295 transitions.
RANDOM walk for 40000 steps (658 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (107 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1447400 steps, run timeout after 3001 ms. (steps per millisecond=482 ) properties seen :0 out of 1
Probabilistic random walk after 1447400 steps, saw 203559 distinct states, run finished after 3001 ms. (steps per millisecond=482 ) properties seen :0
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 07:36:45] [INFO ] Computed 60 invariants in 11 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 280 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-22 07:36:46] [INFO ] Deduced a trap composed of 5 places in 42 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 497 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 808ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2711 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=387 )
Parikh walk visited 1 properties in 7 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 109 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2263 reset in 189 ms.
Product exploration explored 100000 steps with 2303 reset in 235 ms.
Built C files in :
/tmp/ltsmin12224112091217299069
[2024-05-22 07:36:47] [INFO ] Computing symmetric may disable matrix : 295 transitions.
[2024-05-22 07:36:47] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:36:47] [INFO ] Computing symmetric may enable matrix : 295 transitions.
[2024-05-22 07:36:47] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:36:47] [INFO ] Computing Do-Not-Accords matrix : 295 transitions.
[2024-05-22 07:36:47] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:36:47] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12224112091217299069
Running compilation step : cd /tmp/ltsmin12224112091217299069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 786 ms.
Running link step : cd /tmp/ltsmin12224112091217299069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12224112091217299069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3279929093091506359.hoa' '--buchi-type=spotba'
LTSmin run took 8503 ms.
FORMULA DES-PT-60a-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60a-LTLFireability-01 finished in 149398 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 7 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 07:36:56] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 07:36:56] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 07:36:56] [INFO ] Invariant cache hit.
[2024-05-22 07:36:57] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 07:36: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-05-22 07:37:03] [INFO ] Deduced a trap composed of 12 places in 82 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-05-22 07:37:13] [INFO ] Deduced a trap composed of 9 places in 60 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 26257 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-22 07:37:27] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-22 07:37:27] [INFO ] Deduced a trap composed of 12 places in 26 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 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 56479ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56487ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56979 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 124 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 38 steps with 0 reset in 1 ms.
FORMULA DES-PT-60a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-04 finished in 57117 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 11 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 07:37:53] [INFO ] Invariant cache hit.
[2024-05-22 07:37:53] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 07:37:53] [INFO ] Invariant cache hit.
[2024-05-22 07:37:54] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 07:37:54] [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-22 07:38:00] [INFO ] Deduced a trap composed of 12 places in 81 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-05-22 07:38:10] [INFO ] Deduced a trap composed of 9 places in 54 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 25754 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-22 07:38:23] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-22 07:38:23] [INFO ] Deduced a trap composed of 12 places in 21 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 55976ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55981ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56475 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 136 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 2239 reset in 256 ms.
Product exploration explored 100000 steps with 2219 reset in 284 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 448 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 74 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (886 resets) in 249 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (181 resets) in 428 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (202 resets) in 482 ms. (82 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (201 resets) in 524 ms. (76 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (186 resets) in 282 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (163 resets) in 341 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (205 resets) in 266 ms. (149 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (203 resets) in 324 ms. (123 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (187 resets) in 375 ms. (106 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 347449 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 8
Probabilistic random walk after 347449 steps, saw 61681 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2024-05-22 07:38:55] [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 715 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-22 07:38:56] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:38:56] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 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 1850 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 2593ms problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 11443 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 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 21 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (533 resets) in 1239 ms. (32 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (91 resets) in 241 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (96 resets) in 401 ms. (99 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (96 resets) in 327 ms. (121 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (87 resets) in 396 ms. (100 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (85 resets) in 414 ms. (96 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (88 resets) in 245 ms. (162 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (90 resets) in 315 ms. (126 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 583095 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 7
Probabilistic random walk after 583095 steps, saw 83917 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 07:39:13] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 07:39:13] [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 535 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-22 07:39:14] [INFO ] Deduced a trap composed of 7 places in 39 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-22 07:39:15] [INFO ] Deduced a trap composed of 6 places in 38 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 2046 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 2604ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 16840 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 8 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 7 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 07:39:33] [INFO ] Invariant cache hit.
[2024-05-22 07:39:33] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 07:39:33] [INFO ] Invariant cache hit.
[2024-05-22 07:39:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:39:33] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2024-05-22 07:39:33] [INFO ] Redundant transitions in 0 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 07:39:33] [INFO ] Invariant cache hit.
[2024-05-22 07:39:33] [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-22 07:39:42] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-22 07:39:43] [INFO ] Deduced a trap composed of 7 places in 45 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-22 07:39:51] [INFO ] Deduced a trap composed of 16 places in 62 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 30023 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-22 07:40:07] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-22 07:40:07] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-22 07:40:08] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 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 30014 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 60314ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60317ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60891 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 429 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 52 ms :[true, (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 57 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-22 07:40:34] [INFO ] Computed 58 invariants in 10 ms
[2024-05-22 07:40:34] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 07:40:34] [INFO ] Invariant cache hit.
[2024-05-22 07:40:35] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2024-05-22 07:40:35] [INFO ] Redundant transitions in 3 ms returned []
Running 295 sub problems to find dead transitions.
[2024-05-22 07:40: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-05-22 07:40:41] [INFO ] Deduced a trap composed of 12 places in 79 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-22 07:40:52] [INFO ] Deduced a trap composed of 9 places in 61 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 26398 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-22 07:41:05] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-22 07:41:05] [INFO ] Deduced a trap composed of 12 places in 24 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 56641ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56644ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57191 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 182 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 65 ms :[true, (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (877 resets) in 823 ms. (48 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (177 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (202 resets) in 245 ms. (162 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (204 resets) in 233 ms. (170 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 649049 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :0 out of 3
Probabilistic random walk after 649049 steps, saw 101559 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
[2024-05-22 07:41:35] [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 314 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-22 07:41:35] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-22 07:41:36] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 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-22 07:41:36] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-22 07:41:36] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 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 2047 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 2371ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7123 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 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 (529 resets) in 745 ms. (53 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (90 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (97 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (91 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 717095 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :0 out of 3
Probabilistic random walk after 717095 steps, saw 103092 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 07:41:48] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 07:41:48] [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, 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) 77/87 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 207/294 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 294/588 variables, 294/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 58/646 variables, 58/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 414 constraints, problems are : Problem set: 0 solved, 3 unsolved in 351 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: 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) 77/87 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 207/294 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 294/588 variables, 294/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:41:49] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:41:49] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-22 07:41:49] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-22 07:41:49] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 58/646 variables, 58/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/646 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 421 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1197 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: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 1570ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3231 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 10 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 10 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-22 07:41:53] [INFO ] Invariant cache hit.
[2024-05-22 07:41:53] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 07:41:53] [INFO ] Invariant cache hit.
[2024-05-22 07:41:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 07:41:53] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-22 07:41:53] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 07:41:53] [INFO ] Invariant cache hit.
[2024-05-22 07:41:53] [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-22 07:42:03] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:42:03] [INFO ] Deduced a trap composed of 7 places in 45 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-22 07:42:12] [INFO ] Deduced a trap composed of 16 places in 48 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 30016 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-22 07:42:27] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-22 07:42:27] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-22 07:42:28] [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 30023 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 60288ms 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 60849 ms. Remains : 352/352 places, 294/294 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-22 07:42:54] [INFO ] Invariant cache hit.
[2024-05-22 07:42:54] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 07:42:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 07:42:54] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 07:42:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 07:42:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 07:42:54] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 07:42:54] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:42:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
TRAPS : Iteration 1
[2024-05-22 07:42:54] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:42:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
TRAPS : Iteration 2
[2024-05-22 07:42:55] [INFO ] After 845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 07:42:55] [INFO ] After 1092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1210 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 : []
Knowledge based reduction with 11 factoid took 212 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 57 ms :[true, (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 49 ms :[true, (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 52 ms :[true, (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2222 reset in 209 ms.
Product exploration explored 100000 steps with 2235 reset in 229 ms.
Built C files in :
/tmp/ltsmin9251979452084768920
[2024-05-22 07:42:56] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 07:42:56] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:42:56] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 07:42:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:42:56] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 07:42:56] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:42:56] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9251979452084768920
Running compilation step : cd /tmp/ltsmin9251979452084768920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 807 ms.
Running link step : cd /tmp/ltsmin9251979452084768920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9251979452084768920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17937381656035547346.hoa' '--buchi-type=spotba'
LTSmin run took 1624 ms.
FORMULA DES-PT-60a-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60a-LTLFireability-06 finished in 304996 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 7 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 07:42:58] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 07:42:58] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 07:42:58] [INFO ] Invariant cache hit.
[2024-05-22 07:42:59] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 07:42: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-05-22 07:43:05] [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-05-22 07:43:16] [INFO ] Deduced a trap composed of 9 places in 62 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 26098 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-22 07:43:29] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-22 07:43:29] [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 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 56362ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56367ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56908 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 196 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 33410 reset in 331 ms.
Product exploration explored 100000 steps with 33290 reset in 384 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 138 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 348 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 (895 resets) in 1282 ms. (31 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (170 resets) in 305 ms. (130 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (187 resets) in 339 ms. (117 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (174 resets) in 182 ms. (218 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (182 resets) in 406 ms. (98 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (202 resets) in 305 ms. (130 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (261 resets) in 229 ms. (173 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (255 resets) in 216 ms. (184 steps per ms) remains 7/7 properties
[2024-05-22 07:43:58] [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-22 07:43:58] [INFO ] Deduced a trap composed of 11 places in 18 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 805 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 2355 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 3174ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 16800 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 24 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 24 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (541 resets) in 1125 ms. (35 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (91 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (99 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (87 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (132 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 587610 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 4
Probabilistic random walk after 587610 steps, saw 84574 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 07:44:21] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 07:44:21] [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 586 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-05-22 07:44:22] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-22 07:44:22] [INFO ] Deduced a trap composed of 12 places in 62 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, 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 1467 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 2075ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 6234 steps, including 32 resets, run visited all 4 properties in 158 ms. (steps per millisecond=39 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 5616 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 (NOT (OR (NOT p2) (NOT p0)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p0), (F p1), (F (NOT (OR (NOT p2) p0 p1)))]
Knowledge based reduction with 22 factoid took 499 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 194 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 170 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 14 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 07:44:30] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 07:44:30] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 07:44:30] [INFO ] Invariant cache hit.
[2024-05-22 07:44:30] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-22 07:44:30] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-05-22 07:44:30] [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-22 07:44:37] [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-05-22 07:44:47] [INFO ] Deduced a trap composed of 9 places in 61 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 26193 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-22 07:45:01] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-22 07:45:01] [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 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 56417ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56420ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56946 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 134 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 251 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 (897 resets) in 1341 ms. (29 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (181 resets) in 341 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (252 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (209 resets) in 379 ms. (105 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (209 resets) in 306 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (171 resets) in 447 ms. (89 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (255 resets) in 325 ms. (122 steps per ms) remains 6/6 properties
[2024-05-22 07:45:28] [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 695 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-05-22 07:45:30] [INFO ] Deduced a trap composed of 13 places in 72 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 2364 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 3072ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 18228 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 (540 resets) in 1171 ms. (34 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (89 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (138 resets) in 316 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (139 resets) in 375 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (103 resets) in 350 ms. (113 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (289 resets) in 348 ms. (114 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 617712 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 5
Probabilistic random walk after 617712 steps, saw 88764 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 07:45:54] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 07:45:54] [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 780 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-05-22 07:45:55] [INFO ] Deduced a trap composed of 7 places in 50 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-05-22 07:45:55] [INFO ] Deduced a trap composed of 7 places in 81 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 2655 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 3457ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 23312 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 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 07:46:20] [INFO ] Invariant cache hit.
[2024-05-22 07:46:21] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 07:46:21] [INFO ] Invariant cache hit.
[2024-05-22 07:46:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 07:46:21] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2024-05-22 07:46:21] [INFO ] Redundant transitions in 2 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 07:46:21] [INFO ] Invariant cache hit.
[2024-05-22 07:46: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-22 07:46:33] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/646 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 07:46:37] [INFO ] Deduced a trap composed of 10 places in 48 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 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: 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-22 07:46:53] [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, 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 60246ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60826 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 227 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 211 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), false, false]
Product exploration explored 100000 steps with 33389 reset in 379 ms.
Product exploration explored 100000 steps with 33356 reset in 372 ms.
Built C files in :
/tmp/ltsmin3121654163858134471
[2024-05-22 07:47:23] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 07:47:23] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:47:23] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 07:47:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:47:23] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 07:47:23] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:47:23] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3121654163858134471
Running compilation step : cd /tmp/ltsmin3121654163858134471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 753 ms.
Running link step : cd /tmp/ltsmin3121654163858134471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3121654163858134471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9661395085910986041.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 8 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 07:47:38] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 07:47:38] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 07:47:38] [INFO ] Invariant cache hit.
[2024-05-22 07:47:39] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-05-22 07:47:39] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-05-22 07:47:39] [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-22 07:47:45] [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-05-22 07:47:56] [INFO ] Deduced a trap composed of 9 places in 60 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 26614 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-22 07:48:09] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 07:48:09] [INFO ] Deduced a trap composed of 12 places in 31 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 56848ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56854ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57410 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin17788501695849017814
[2024-05-22 07:48:36] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 07:48:36] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:48:36] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 07:48:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:48:36] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 07:48:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:48:36] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17788501695849017814
Running compilation step : cd /tmp/ltsmin17788501695849017814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 806 ms.
Running link step : cd /tmp/ltsmin17788501695849017814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17788501695849017814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1196991063010453847.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 07:48:51] [INFO ] Flatten gal took : 16 ms
[2024-05-22 07:48:51] [INFO ] Flatten gal took : 14 ms
[2024-05-22 07:48:51] [INFO ] Time to serialize gal into /tmp/LTL11017168544959439499.gal : 2 ms
[2024-05-22 07:48:51] [INFO ] Time to serialize properties into /tmp/LTL3701692257920090767.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11017168544959439499.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1068371940543088429.hoa' '-atoms' '/tmp/LTL3701692257920090767.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3701692257920090767.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1068371940543088429.hoa
Detected timeout of ITS tools.
[2024-05-22 07:49:06] [INFO ] Flatten gal took : 14 ms
[2024-05-22 07:49:06] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:49:06] [INFO ] Time to serialize gal into /tmp/LTL6547330597734720390.gal : 2 ms
[2024-05-22 07:49:06] [INFO ] Time to serialize properties into /tmp/LTL3947670674452945218.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6547330597734720390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3947670674452945218.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(((p261==1)&&(p266==1))&&(p268==1))"))||(("(((p261==1)&&(p266==1))&&(p268==1))")U(("((p221==1)&&(p244==1))")U(X(!("(((p8==1...190
Formula 0 simplified : GF(X!"(((p261==1)&&(p266==1))&&(p268==1))" & (!"(((p261==1)&&(p266==1))&&(p268==1))" R (!"((p221==1)&&(p244==1))" R X"(((p8==1)&&(p2...178
Detected timeout of ITS tools.
[2024-05-22 07:49:21] [INFO ] Flatten gal took : 12 ms
[2024-05-22 07:49:21] [INFO ] Applying decomposition
[2024-05-22 07:49:21] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph416777174084216894.txt' '-o' '/tmp/graph416777174084216894.bin' '-w' '/tmp/graph416777174084216894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph416777174084216894.bin' '-l' '-1' '-v' '-w' '/tmp/graph416777174084216894.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:49:21] [INFO ] Decomposing Gal with order
[2024-05-22 07:49:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:49:21] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-22 07:49:21] [INFO ] Flatten gal took : 23 ms
[2024-05-22 07:49:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 3 ms.
[2024-05-22 07:49:21] [INFO ] Time to serialize gal into /tmp/LTL14579860707137612306.gal : 4 ms
[2024-05-22 07:49:21] [INFO ] Time to serialize properties into /tmp/LTL16603531285952864563.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14579860707137612306.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16603531285952864563.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(((i0.i1.u7.p261==1)&&(i0.i0.u11.p266==1))&&(i0.i0.u12.p268==1))"))||(("(((i0.i1.u7.p261==1)&&(i0.i0.u11.p266==1))&&(i0.i0....275
Formula 0 simplified : GF(X!"(((i0.i1.u7.p261==1)&&(i0.i0.u11.p266==1))&&(i0.i0.u12.p268==1))" & (!"(((i0.i1.u7.p261==1)&&(i0.i0.u11.p266==1))&&(i0.i0.u12....263
Detected timeout of ITS tools.
Treatment of property DES-PT-60a-LTLFireability-07 finished in 397806 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 5 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 353 cols
[2024-05-22 07:49:36] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 07:49:36] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-22 07:49:36] [INFO ] Invariant cache hit.
[2024-05-22 07:49:37] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-05-22 07:49:37] [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-05-22 07:49:49] [INFO ] Deduced a trap composed of 10 places in 77 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-05-22 07:49:55] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-22 07:49:57] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-22 07:49:58] [INFO ] Deduced a trap composed of 13 places in 40 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 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: 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-05-22 07:50:09] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:50:11] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:50:11] [INFO ] Deduced a trap composed of 12 places in 33 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 30017 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 60268ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60274ms
Finished structural reductions in LTL mode , in 1 iterations and 61160 ms. Remains : 353/353 places, 297/297 transitions.
Stuttering acceptance computed with spot in 164 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 2213 reset in 206 ms.
Product exploration explored 100000 steps with 2243 reset in 230 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 90 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 37 ms :[(NOT p0)]
RANDOM walk for 156 steps (3 resets) in 4 ms. (31 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 119 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 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-05-22 07:50:38] [INFO ] Invariant cache hit.
[2024-05-22 07:50:38] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-22 07:50:38] [INFO ] Invariant cache hit.
[2024-05-22 07:50:39] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
[2024-05-22 07:50:39] [INFO ] Redundant transitions in 3 ms returned []
Running 296 sub problems to find dead transitions.
[2024-05-22 07:50:39] [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-05-22 07:50:51] [INFO ] Deduced a trap composed of 10 places in 84 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-05-22 07:50:57] [INFO ] Deduced a trap composed of 10 places in 47 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-05-22 07:50:59] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:51:00] [INFO ] Deduced a trap composed of 13 places in 47 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 30013 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-05-22 07:51:12] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:51:13] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-22 07:51:14] [INFO ] Deduced a trap composed of 12 places in 35 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 30017 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 60249ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61191 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 67 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 23 ms :[(NOT p0)]
RANDOM walk for 58 steps (0 resets) in 4 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 71 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2215 reset in 224 ms.
Product exploration explored 100000 steps with 2221 reset in 258 ms.
Built C files in :
/tmp/ltsmin14626136156281106885
[2024-05-22 07:51:40] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-05-22 07:51:40] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:51:40] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-05-22 07:51:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:51:40] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-05-22 07:51:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:51:40] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14626136156281106885
Running compilation step : cd /tmp/ltsmin14626136156281106885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 761 ms.
Running link step : cd /tmp/ltsmin14626136156281106885;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14626136156281106885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12433082796676015101.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 13 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-22 07:51:55] [INFO ] Invariant cache hit.
[2024-05-22 07:51:56] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-22 07:51:56] [INFO ] Invariant cache hit.
[2024-05-22 07:51:56] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
[2024-05-22 07:51:56] [INFO ] Redundant transitions in 1 ms returned []
Running 296 sub problems to find dead transitions.
[2024-05-22 07:51:56] [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-05-22 07:52:10] [INFO ] Deduced a trap composed of 10 places in 87 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-05-22 07:52:16] [INFO ] Deduced a trap composed of 10 places in 49 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-05-22 07:52:18] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:52:19] [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 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-05-22 07:52:29] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:52:31] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:52:31] [INFO ] Deduced a trap composed of 12 places in 37 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 30020 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 60239ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61322 ms. Remains : 353/353 places, 297/297 transitions.
Built C files in :
/tmp/ltsmin11122225788967828712
[2024-05-22 07:52:57] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-05-22 07:52:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:52:57] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-05-22 07:52:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:52:57] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-05-22 07:52:57] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:52:57] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11122225788967828712
Running compilation step : cd /tmp/ltsmin11122225788967828712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 771 ms.
Running link step : cd /tmp/ltsmin11122225788967828712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11122225788967828712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4085151874993062419.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 07:53:12] [INFO ] Flatten gal took : 12 ms
[2024-05-22 07:53:12] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:53:12] [INFO ] Time to serialize gal into /tmp/LTL15221346486336709325.gal : 3 ms
[2024-05-22 07:53:12] [INFO ] Time to serialize properties into /tmp/LTL13543016383484454092.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15221346486336709325.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2790653606591444304.hoa' '-atoms' '/tmp/LTL13543016383484454092.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13543016383484454092.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2790653606591444304.hoa
Detected timeout of ITS tools.
[2024-05-22 07:53:27] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:53:27] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:53:27] [INFO ] Time to serialize gal into /tmp/LTL7308498759779931982.gal : 3 ms
[2024-05-22 07:53:27] [INFO ] Time to serialize properties into /tmp/LTL15435827960408360430.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7308498759779931982.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15435827960408360430.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("((p277==0)||(p347==0))")))&&(("((p224==0)||(p244==0))")||(X("((p224==0)||(p244==0))")))))))
Formula 0 simplified : X(GF!"((p277==0)||(p347==0))" | G(!"((p224==0)||(p244==0))" & X!"((p224==0)||(p244==0))"))
Detected timeout of ITS tools.
[2024-05-22 07:53:42] [INFO ] Flatten gal took : 14 ms
[2024-05-22 07:53:42] [INFO ] Applying decomposition
[2024-05-22 07:53:42] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9652309736919387968.txt' '-o' '/tmp/graph9652309736919387968.bin' '-w' '/tmp/graph9652309736919387968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9652309736919387968.bin' '-l' '-1' '-v' '-w' '/tmp/graph9652309736919387968.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:53:42] [INFO ] Decomposing Gal with order
[2024-05-22 07:53:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:53:42] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-22 07:53:42] [INFO ] Flatten gal took : 20 ms
[2024-05-22 07:53:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 3 ms.
[2024-05-22 07:53:42] [INFO ] Time to serialize gal into /tmp/LTL14423277199179761548.gal : 3 ms
[2024-05-22 07:53:42] [INFO ] Time to serialize properties into /tmp/LTL14482877783823206379.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14423277199179761548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14482877783823206379.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("((i12.u15.p277==0)||(i12.u15.p347==0))")))&&(("((u2.p224==0)||(u2.p244==0))")||(X("((u2.p224==0)||(u2.p244==0))")))))))
Formula 0 simplified : X(GF!"((i12.u15.p277==0)||(i12.u15.p347==0))" | G(!"((u2.p224==0)||(u2.p244==0))" & X!"((u2.p224==0)||(u2.p244==0))"))
Detected timeout of ITS tools.
Treatment of property DES-PT-60a-LTLFireability-08 finished in 260993 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 10 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 07:53:57] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 07:53:57] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 07:53:57] [INFO ] Invariant cache hit.
[2024-05-22 07:53:58] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2024-05-22 07:53:58] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-05-22 07:53:58] [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-22 07:54:03] [INFO ] Deduced a trap composed of 12 places in 82 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-05-22 07:54:14] [INFO ] Deduced a trap composed of 9 places in 53 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 26267 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-22 07:54:28] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-22 07:54:28] [INFO ] Deduced a trap composed of 12 places in 22 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 30035 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 56524ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56527ms
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 57074 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 196 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 38 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-09 finished in 57292 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 13 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 07:54:54] [INFO ] Invariant cache hit.
[2024-05-22 07:54:54] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 07:54:54] [INFO ] Invariant cache hit.
[2024-05-22 07:54:55] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 07:54: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-05-22 07:55:01] [INFO ] Deduced a trap composed of 12 places in 85 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-05-22 07:55:12] [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 26312 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-22 07:55:25] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:55: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 30028 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 56574ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56578ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57131 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 182 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 2252 reset in 209 ms.
Product exploration explored 100000 steps with 2200 reset in 237 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 110 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 158 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 (882 resets) in 268 ms. (148 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (246 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
[2024-05-22 07:55:53] [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 178 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-05-22 07:55:53] [INFO ] Deduced a trap composed of 13 places in 38 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 419 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 602ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 306 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 (531 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (289 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1418006 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :0 out of 1
Probabilistic random walk after 1418006 steps, saw 198141 distinct states, run finished after 3001 ms. (steps per millisecond=472 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 07:55:57] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 07:55:57] [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 189 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-05-22 07:55:57] [INFO ] Deduced a trap composed of 11 places in 37 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 387 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 593ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 308 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-05-22 07:55:57] [INFO ] Invariant cache hit.
[2024-05-22 07:55:58] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 07:55:58] [INFO ] Invariant cache hit.
[2024-05-22 07:55:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 07:55:58] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2024-05-22 07:55:58] [INFO ] Redundant transitions in 2 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 07:55:58] [INFO ] Invariant cache hit.
[2024-05-22 07:55: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-22 07:56:10] [INFO ] Deduced a trap composed of 9 places in 36 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-22 07:56:14] [INFO ] Deduced a trap composed of 10 places in 52 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-22 07:56:30] [INFO ] Deduced a trap composed of 6 places in 16 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 30019 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 60254ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60257ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60862 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 13 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-22 07:56:58] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 07:56:58] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:56:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 07:56:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 07:56:59] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 07:56:59] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 07:56:59] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 397 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 263 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 173 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 150 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-05-22 07:56:59] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 07:56:59] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 07:56:59] [INFO ] Invariant cache hit.
[2024-05-22 07:57:00] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 07:57: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-05-22 07:57:06] [INFO ] Deduced a trap composed of 12 places in 85 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-05-22 07:57:17] [INFO ] Deduced a trap composed of 9 places in 53 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 26278 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-22 07:57:30] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-22 07:57:30] [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 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 56523ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56527ms
Finished structural reductions in LTL mode , in 1 iterations and 57034 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 111 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 170 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 (906 resets) in 700 ms. (57 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (249 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
[2024-05-22 07:57: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 190 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-05-22 07:57:57] [INFO ] Deduced a trap composed of 13 places in 34 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 414 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 614ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 312 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 17 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 17 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (532 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (288 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1433852 steps, run timeout after 3001 ms. (steps per millisecond=477 ) properties seen :0 out of 1
Probabilistic random walk after 1433852 steps, saw 200207 distinct states, run finished after 3002 ms. (steps per millisecond=477 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 07:58:01] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 07:58: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 176 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-05-22 07:58:01] [INFO ] Deduced a trap composed of 11 places in 35 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 377 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 563ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 313 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 5 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 07:58:02] [INFO ] Invariant cache hit.
[2024-05-22 07:58:02] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 07:58:02] [INFO ] Invariant cache hit.
[2024-05-22 07:58:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 07:58:02] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2024-05-22 07:58:02] [INFO ] Redundant transitions in 3 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 07:58:02] [INFO ] Invariant cache hit.
[2024-05-22 07:58:02] [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-22 07:58:14] [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-22 07:58:19] [INFO ] Deduced a trap composed of 10 places in 54 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-22 07:58:35] [INFO ] Deduced a trap composed of 6 places in 16 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 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: 3/3 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60845 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-05-22 07:59:03] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 07:59:03] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:59:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 07:59:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 07:59:03] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 07:59:03] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 07:59:03] [INFO ] After 316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 386 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 300 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 150 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 155 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 169 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 2273 reset in 206 ms.
Product exploration explored 100000 steps with 2245 reset in 228 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 172 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 8 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 07:59:05] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 07:59:05] [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-05-22 07:59:10] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-22 07:59:13] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:59:13] [INFO ] Deduced a trap composed of 9 places in 57 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-22 07:59:17] [INFO ] Deduced a trap composed of 12 places in 44 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 22045 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 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 52300ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 52303ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52318 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin13320251398486231548
[2024-05-22 07:59:57] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13320251398486231548
Running compilation step : cd /tmp/ltsmin13320251398486231548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 599 ms.
Running link step : cd /tmp/ltsmin13320251398486231548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13320251398486231548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13570605707154207918.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 11 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 08:00:12] [INFO ] Invariant cache hit.
[2024-05-22 08:00:12] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 08:00:12] [INFO ] Invariant cache hit.
[2024-05-22 08:00:13] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 08:00:13] [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-22 08:00:19] [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-05-22 08:00:29] [INFO ] Deduced a trap composed of 9 places in 52 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 25898 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-22 08:00:42] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-22 08:00:42] [INFO ] Deduced a trap composed of 12 places in 22 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 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 56147ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56151ms
Finished structural reductions in LTL mode , in 1 iterations and 56709 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin14383419265220700452
[2024-05-22 08:01:09] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14383419265220700452
Running compilation step : cd /tmp/ltsmin14383419265220700452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 609 ms.
Running link step : cd /tmp/ltsmin14383419265220700452;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14383419265220700452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17549372974712913371.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 08:01:24] [INFO ] Flatten gal took : 12 ms
[2024-05-22 08:01:24] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:01:24] [INFO ] Time to serialize gal into /tmp/LTL12611689096999126820.gal : 2 ms
[2024-05-22 08:01:24] [INFO ] Time to serialize properties into /tmp/LTL3104366456059601362.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12611689096999126820.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8059278991423971232.hoa' '-atoms' '/tmp/LTL3104366456059601362.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3104366456059601362.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8059278991423971232.hoa
Detected timeout of ITS tools.
[2024-05-22 08:01:39] [INFO ] Flatten gal took : 9 ms
[2024-05-22 08:01:39] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:01:39] [INFO ] Time to serialize gal into /tmp/LTL8643662884406419204.gal : 3 ms
[2024-05-22 08:01:39] [INFO ] Time to serialize properties into /tmp/LTL327228758347277755.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8643662884406419204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL327228758347277755.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((p215==0)||(p244==0))"))&&(F("((p235==0)||(p244==0))")))&&("(((p215==0)||(p244==0))&&((p245==0)||(p267==0)))")))))
Formula 0 simplified : XG(!"(((p215==0)||(p244==0))&&((p245==0)||(p267==0)))" | F!"((p215==0)||(p244==0))" | G!"((p235==0)||(p244==0))")
Detected timeout of ITS tools.
[2024-05-22 08:01:54] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:01:54] [INFO ] Applying decomposition
[2024-05-22 08:01:54] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15363673248931084512.txt' '-o' '/tmp/graph15363673248931084512.bin' '-w' '/tmp/graph15363673248931084512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15363673248931084512.bin' '-l' '-1' '-v' '-w' '/tmp/graph15363673248931084512.weights' '-q' '0' '-e' '0.001'
[2024-05-22 08:01:54] [INFO ] Decomposing Gal with order
[2024-05-22 08:01:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:01:54] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 08:01:54] [INFO ] Flatten gal took : 16 ms
[2024-05-22 08:01:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 08:01:54] [INFO ] Time to serialize gal into /tmp/LTL10747059737719193576.gal : 3 ms
[2024-05-22 08:01:54] [INFO ] Time to serialize properties into /tmp/LTL5815051836960288457.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10747059737719193576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5815051836960288457.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((u2.p215==0)||(u2.p244==0))"))&&(F("((u2.p235==0)||(u2.p244==0))")))&&("(((u2.p215==0)||(u2.p244==0))&&((u2.p245==0)||(i0...179
Formula 0 simplified : XG(!"(((u2.p215==0)||(u2.p244==0))&&((u2.p245==0)||(i0.i1.u12.p267==0)))" | F!"((u2.p215==0)||(u2.p244==0))" | G!"((u2.p235==0)||(u2...167
Detected timeout of ITS tools.
Treatment of property DES-PT-60a-LTLFireability-10 finished in 434815 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 10 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 08:02:09] [INFO ] Invariant cache hit.
[2024-05-22 08:02:09] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-22 08:02:09] [INFO ] Invariant cache hit.
[2024-05-22 08:02:10] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 08:02: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-22 08:02:16] [INFO ] Deduced a trap composed of 12 places in 78 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-22 08:02:26] [INFO ] Deduced a trap composed of 9 places in 56 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 25738 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-22 08:02:39] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-22 08:02:39] [INFO ] Deduced a trap composed of 12 places in 23 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 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 55989ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55992ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56486 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 315 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 56824 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 8 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 08:03:06] [INFO ] Invariant cache hit.
[2024-05-22 08:03:06] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 08:03:06] [INFO ] Invariant cache hit.
[2024-05-22 08:03:07] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 08:03:07] [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-22 08:03:12] [INFO ] Deduced a trap composed of 12 places in 78 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-05-22 08:03:23] [INFO ] Deduced a trap composed of 9 places in 58 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 25994 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-22 08:03:36] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-22 08:03:36] [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 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 56223ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56227ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56760 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 198 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 309 ms.
Product exploration explored 100000 steps with 33333 reset in 321 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 16 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 57706 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 12 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 08:04:04] [INFO ] Invariant cache hit.
[2024-05-22 08:04:04] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 08:04:04] [INFO ] Invariant cache hit.
[2024-05-22 08:04:04] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 08:04: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-05-22 08:04:10] [INFO ] Deduced a trap composed of 12 places in 82 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-22 08:04:21] [INFO ] Deduced a trap composed of 9 places in 56 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 26143 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-22 08:04:34] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-22 08:04:34] [INFO ] Deduced a trap composed of 12 places in 22 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 56387ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56390ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56879 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 130 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 282 ms.
Product exploration explored 100000 steps with 2244 reset in 297 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 143 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 81 ms :[p2, true, p2]
RANDOM walk for 40000 steps (906 resets) in 407 ms. (98 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (255 resets) in 536 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (235 resets) in 463 ms. (86 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (251 resets) in 549 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (230 resets) in 424 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (213 resets) in 436 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (201 resets) in 246 ms. (161 steps per ms) remains 6/6 properties
[2024-05-22 08:05:02] [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 603 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 2554 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 3175ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 28130 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 (525 resets) in 1427 ms. (28 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (291 resets) in 380 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (276 resets) in 539 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (286 resets) in 582 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (115 resets) in 288 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (92 resets) in 397 ms. (100 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (94 resets) in 457 ms. (87 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 604146 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 6
Probabilistic random walk after 604146 steps, saw 86888 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 08:05:38] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 08:05:38] [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 565 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 1843 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 2432ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 21432 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 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 08:06:02] [INFO ] Invariant cache hit.
[2024-05-22 08:06:02] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-22 08:06:02] [INFO ] Invariant cache hit.
[2024-05-22 08:06:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:06:02] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2024-05-22 08:06:02] [INFO ] Redundant transitions in 3 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 08:06:02] [INFO ] Invariant cache hit.
[2024-05-22 08:06:02] [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-22 08:06:09] [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, 1/415 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 08:06:14] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:06:15] [INFO ] Deduced a trap composed of 13 places in 54 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 27616 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-22 08:06:32] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-22 08:06:32] [INFO ] Deduced a trap composed of 9 places in 38 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-22 08:06:57] [INFO ] Deduced a trap composed of 12 places in 41 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 30024 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 57883ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 57888ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58485 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 215 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 95 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 114 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 10 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 08:07:01] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 08:07:01] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 08:07:01] [INFO ] Invariant cache hit.
[2024-05-22 08:07:01] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-05-22 08:07:01] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-05-22 08:07: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-05-22 08:07:07] [INFO ] Deduced a trap composed of 12 places in 80 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-05-22 08:07:18] [INFO ] Deduced a trap composed of 9 places in 61 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 25954 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-22 08:07:31] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 08:07:31] [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 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 56205ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56209ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56754 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 149 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 98 ms :[p2, true, p2]
RANDOM walk for 40000 steps (890 resets) in 1318 ms. (30 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (249 resets) in 341 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (238 resets) in 378 ms. (105 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (253 resets) in 418 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (224 resets) in 301 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (208 resets) in 411 ms. (97 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (202 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
[2024-05-22 08:07:59] [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 622 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 2493 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 3134ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 26777 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 16 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 16 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (546 resets) in 837 ms. (47 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (291 resets) in 477 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (274 resets) in 411 ms. (97 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (290 resets) in 456 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (130 resets) in 436 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (80 resets) in 185 ms. (215 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (101 resets) in 302 ms. (132 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 580859 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :0 out of 6
Probabilistic random walk after 580859 steps, saw 83578 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 08:08:33] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 08:08:33] [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 643 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 1807 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 2474ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 21994 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 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 08:08:57] [INFO ] Invariant cache hit.
[2024-05-22 08:08:58] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-22 08:08:58] [INFO ] Invariant cache hit.
[2024-05-22 08:08:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 08:08:58] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-05-22 08:08:58] [INFO ] Redundant transitions in 2 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 08:08:58] [INFO ] Invariant cache hit.
[2024-05-22 08:08:58] [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-22 08:09:05] [INFO ] Deduced a trap composed of 7 places in 58 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-22 08:09:10] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-22 08:09:11] [INFO ] Deduced a trap composed of 13 places in 52 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 27545 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-22 08:09:28] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-22 08:09:28] [INFO ] Deduced a trap composed of 9 places in 38 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-22 08:09:52] [INFO ] Deduced a trap composed of 12 places in 46 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 30012 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 57770ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 57774ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58314 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 198 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 85 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 73 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 85 ms :[p2, true, p2]
Product exploration explored 100000 steps with 2247 reset in 248 ms.
Product exploration explored 100000 steps with 2221 reset in 269 ms.
Built C files in :
/tmp/ltsmin13144948104389602051
[2024-05-22 08:09:57] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 08:09:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 08:09:57] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 08:09:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 08:09:57] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 08:09:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 08:09:57] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13144948104389602051
Running compilation step : cd /tmp/ltsmin13144948104389602051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 768 ms.
Running link step : cd /tmp/ltsmin13144948104389602051;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13144948104389602051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2466822507291632075.hoa' '--buchi-type=spotba'
LTSmin run took 8556 ms.
FORMULA DES-PT-60a-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60a-LTLFireability-13 finished in 362465 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 11 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 08:10:06] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 08:10:06] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 08:10:06] [INFO ] Invariant cache hit.
[2024-05-22 08:10:07] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 08:10:07] [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-22 08:10:13] [INFO ] Deduced a trap composed of 12 places in 79 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-22 08:10:23] [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 26145 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-22 08:10:37] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 08:10:37] [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 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 56388ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56391ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56887 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-14
Product exploration explored 100000 steps with 2208 reset in 212 ms.
Product exploration explored 100000 steps with 2215 reset in 234 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 93 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 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (892 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (193 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1455225 steps, run timeout after 3001 ms. (steps per millisecond=484 ) properties seen :0 out of 1
Probabilistic random walk after 1455225 steps, saw 203726 distinct states, run finished after 3001 ms. (steps per millisecond=484 ) properties seen :0
[2024-05-22 08:11:07] [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 333 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-05-22 08:11:07] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 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-05-22 08:11:08] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-22 08:11:08] [INFO ] Deduced a trap composed of 9 places in 74 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 1045 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 1386ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 659 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 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 (539 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (64 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1424078 steps, run timeout after 3001 ms. (steps per millisecond=474 ) properties seen :0 out of 1
Probabilistic random walk after 1424078 steps, saw 198903 distinct states, run finished after 3001 ms. (steps per millisecond=474 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 08:11:12] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 08:11:12] [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-05-22 08:11:12] [INFO ] Deduced a trap composed of 7 places in 37 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-05-22 08:11:13] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-22 08:11:13] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-22 08:11:13] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-22 08:11:13] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-22 08:11:13] [INFO ] Deduced a trap composed of 17 places in 66 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 1180 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 1523ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 593 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-05-22 08:11:14] [INFO ] Invariant cache hit.
[2024-05-22 08:11:14] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 08:11:14] [INFO ] Invariant cache hit.
[2024-05-22 08:11:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 08:11:15] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-05-22 08:11:15] [INFO ] Redundant transitions in 2 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 08:11:15] [INFO ] Invariant cache hit.
[2024-05-22 08:11:15] [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-05-22 08:11:27] [INFO ] Deduced a trap composed of 16 places in 55 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-22 08:11:35] [INFO ] Deduced a trap composed of 7 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
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 30020 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-05-22 08:11:47] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-22 08:11:48] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 08:11:49] [INFO ] Deduced a trap composed of 6 places in 22 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-05-22 08:12:12] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-22 08:12:13] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 3 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 60245ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60799 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-05-22 08:12:15] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 08:12:15] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 08:12:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 08:12:15] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 08:12:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 08:12:15] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2024-05-22 08:12:15] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 08:12:15] [INFO ] After 323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 08:12:15] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 619 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 93 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 55 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 49 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 8 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 08:12:16] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 08:12:16] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 08:12:16] [INFO ] Invariant cache hit.
[2024-05-22 08:12:16] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-05-22 08:12:16] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-05-22 08:12:16] [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-22 08:12:22] [INFO ] Deduced a trap composed of 12 places in 79 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-22 08:12:33] [INFO ] Deduced a trap composed of 9 places in 53 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 26154 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-22 08:12:46] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-22 08:12:46] [INFO ] Deduced a trap composed of 12 places in 23 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 56375ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56379ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56885 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 85 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 47 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (892 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (190 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1460663 steps, run timeout after 3001 ms. (steps per millisecond=486 ) properties seen :0 out of 1
Probabilistic random walk after 1460663 steps, saw 204418 distinct states, run finished after 3001 ms. (steps per millisecond=486 ) properties seen :0
[2024-05-22 08:13:16] [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 334 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-05-22 08:13:16] [INFO ] Deduced a trap composed of 13 places in 77 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-05-22 08:13:17] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-22 08:13:17] [INFO ] Deduced a trap composed of 9 places in 72 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 1018 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 1358ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 651 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 11 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 40000 steps (530 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (68 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1428033 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :0 out of 1
Probabilistic random walk after 1428033 steps, saw 199404 distinct states, run finished after 3001 ms. (steps per millisecond=475 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 08:13:21] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 08:13:21] [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 319 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-05-22 08:13:21] [INFO ] Deduced a trap composed of 7 places in 37 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-05-22 08:13:22] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-22 08:13:22] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-22 08:13:22] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-22 08:13:22] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-22 08:13:22] [INFO ] Deduced a trap composed of 17 places in 66 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 1173 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 1507ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 596 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-05-22 08:13:23] [INFO ] Invariant cache hit.
[2024-05-22 08:13:23] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 08:13:23] [INFO ] Invariant cache hit.
[2024-05-22 08:13:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 08:13:23] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-05-22 08:13:23] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 08:13:23] [INFO ] Invariant cache hit.
[2024-05-22 08:13:23] [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-05-22 08:13:36] [INFO ] Deduced a trap composed of 16 places in 41 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-22 08:13:43] [INFO ] Deduced a trap composed of 7 places in 74 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 30016 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-05-22 08:13:56] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-22 08:13:57] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 08:13:58] [INFO ] Deduced a trap composed of 6 places in 17 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-05-22 08:14:21] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-22 08:14:21] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 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 60240ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60780 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-05-22 08:14:24] [INFO ] Computed 60 invariants in 7 ms
[2024-05-22 08:14:24] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 08:14:24] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-22 08:14:24] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 08:14:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 08:14:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2024-05-22 08:14:24] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 08:14:24] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 08:14:24] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 613 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 88 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 49 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 2233 reset in 223 ms.
Product exploration explored 100000 steps with 2235 reset in 234 ms.
Built C files in :
/tmp/ltsmin9272237884382629205
[2024-05-22 08:14:25] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 08:14:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 08:14:25] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 08:14:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 08:14:25] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 08:14:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 08:14:25] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9272237884382629205
Running compilation step : cd /tmp/ltsmin9272237884382629205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 766 ms.
Running link step : cd /tmp/ltsmin9272237884382629205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9272237884382629205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4134800071995441953.hoa' '--buchi-type=spotba'
LTSmin run took 1766 ms.
FORMULA DES-PT-60a-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60a-LTLFireability-14 finished in 261561 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 17 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 08:14:28] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 08:14:28] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-22 08:14:28] [INFO ] Invariant cache hit.
[2024-05-22 08:14:28] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 08:14: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-22 08:14:34] [INFO ] Deduced a trap composed of 12 places in 76 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-05-22 08:14:45] [INFO ] Deduced a trap composed of 9 places in 59 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 25999 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-22 08:14:58] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-22 08:14:58] [INFO ] Deduced a trap composed of 12 places in 24 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 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 56223ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56226ms
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56809 ms. Remains : 352/353 places, 296/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-15
Product exploration explored 100000 steps with 50000 reset in 454 ms.
Product exploration explored 100000 steps with 50000 reset in 395 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 14 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 57757 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 145 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 13 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2024-05-22 08:15:26] [INFO ] Invariant cache hit.
[2024-05-22 08:15:26] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 08:15:26] [INFO ] Invariant cache hit.
[2024-05-22 08:15:26] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 08:15:26] [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-22 08:15:32] [INFO ] Deduced a trap composed of 12 places in 77 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-05-22 08:15:43] [INFO ] Deduced a trap composed of 9 places in 57 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 25411 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-22 08:15:55] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 08:15:55] [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 30010 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 55640ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55644ms
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 56157 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 4056 reset in 205 ms.
Product exploration explored 100000 steps with 4099 reset in 230 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 85 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 147 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (860 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (254 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (254 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 920080 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :0 out of 2
Probabilistic random walk after 920080 steps, saw 133692 distinct states, run finished after 3001 ms. (steps per millisecond=306 ) properties seen :0
[2024-05-22 08:16:26] [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 287 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-22 08:16:26] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-22 08:16:26] [INFO ] Deduced a trap composed of 17 places in 71 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 1826 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 2120ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 1083 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 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (289 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1428738 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :0 out of 1
Probabilistic random walk after 1428738 steps, saw 199494 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 08:16:32] [INFO ] Computed 60 invariants in 9 ms
[2024-05-22 08:16:32] [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 265 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-22 08:16:32] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-22 08:16:32] [INFO ] Deduced a trap composed of 11 places in 64 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 488 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 773ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 574 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 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 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 08:16:33] [INFO ] Invariant cache hit.
[2024-05-22 08:16:33] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 08:16:33] [INFO ] Invariant cache hit.
[2024-05-22 08:16:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 08:16:34] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-05-22 08:16:34] [INFO ] Redundant transitions in 1 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 08:16:34] [INFO ] Invariant cache hit.
[2024-05-22 08:16:34] [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-22 08:16:46] [INFO ] Deduced a trap composed of 9 places in 32 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-05-22 08:16:50] [INFO ] Deduced a trap composed of 10 places in 49 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 30010 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-22 08:17:06] [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 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 60256ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60826 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-22 08:17:34] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 08:17:34] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 08:17:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 08:17:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2024-05-22 08:17:34] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 08:17:34] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 08:17:35] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 432 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 119 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 284 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 127 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 8 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 08:17:35] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 08:17:35] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-22 08:17:35] [INFO ] Invariant cache hit.
[2024-05-22 08:17:36] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 08:17:36] [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-22 08:17:41] [INFO ] Deduced a trap composed of 12 places in 72 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-05-22 08:17:52] [INFO ] Deduced a trap composed of 9 places in 51 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 25279 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-22 08:18:05] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-22 08:18:05] [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 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 55494ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 55497ms
Finished structural reductions in LTL mode , in 1 iterations and 56013 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 167 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 134 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (887 resets) in 586 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (249 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (260 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 941941 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 2
Probabilistic random walk after 941941 steps, saw 136263 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
[2024-05-22 08:18:35] [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 283 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-22 08:18:35] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-22 08:18:35] [INFO ] Deduced a trap composed of 17 places in 68 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 1832 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 2121ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 1072 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 (537 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (289 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1424135 steps, run timeout after 3001 ms. (steps per millisecond=474 ) properties seen :0 out of 1
Probabilistic random walk after 1424135 steps, saw 198908 distinct states, run finished after 3001 ms. (steps per millisecond=474 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 08:18:41] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 08:18:41] [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 278 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-22 08:18:41] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 08:18:41] [INFO ] Deduced a trap composed of 11 places in 57 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 505 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 806ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 571 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-05-22 08:18:42] [INFO ] Invariant cache hit.
[2024-05-22 08:18:43] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 08:18:43] [INFO ] Invariant cache hit.
[2024-05-22 08:18:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 08:18:43] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2024-05-22 08:18:43] [INFO ] Redundant transitions in 2 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 08:18:43] [INFO ] Invariant cache hit.
[2024-05-22 08:18:43] [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-22 08:18:55] [INFO ] Deduced a trap composed of 9 places in 37 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-22 08:18:59] [INFO ] Deduced a trap composed of 10 places in 50 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 30013 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-22 08:19:15] [INFO ] Deduced a trap composed of 6 places in 16 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 30019 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 60264ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60846 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-05-22 08:19:43] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 08:19:43] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 08:19:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 08:19:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 08:19:44] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 08:19:44] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 08:19:44] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 422 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 113 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 125 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 4193 reset in 215 ms.
Product exploration explored 100000 steps with 4156 reset in 233 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 175 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 9 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 08:19:45] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 08:19:45] [INFO ] Computed 58 invariants in 4 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-22 08:19:51] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-22 08:19:54] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-22 08:19:54] [INFO ] Deduced a trap composed of 9 places in 58 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-22 08:19:58] [INFO ] Deduced a trap composed of 12 places in 41 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 22761 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 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 52986ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 52989ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53004 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin16892384675801365894
[2024-05-22 08:20:38] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16892384675801365894
Running compilation step : cd /tmp/ltsmin16892384675801365894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 602 ms.
Running link step : cd /tmp/ltsmin16892384675801365894;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16892384675801365894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4908026269550517427.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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-05-22 08:20:53] [INFO ] Invariant cache hit.
[2024-05-22 08:20:53] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 08:20:53] [INFO ] Invariant cache hit.
[2024-05-22 08:20:54] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 08:20:54] [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-22 08:20:59] [INFO ] Deduced a trap composed of 12 places in 82 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-22 08:21:10] [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 26111 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-22 08:21:24] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-22 08:21:24] [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 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 56346ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 56350ms
Finished structural reductions in LTL mode , in 1 iterations and 56873 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin17991675519441161389
[2024-05-22 08:21:50] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17991675519441161389
Running compilation step : cd /tmp/ltsmin17991675519441161389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 603 ms.
Running link step : cd /tmp/ltsmin17991675519441161389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17991675519441161389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3353325203459179362.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 08:22:05] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:22:05] [INFO ] Flatten gal took : 9 ms
[2024-05-22 08:22:05] [INFO ] Time to serialize gal into /tmp/LTL15660231978490738061.gal : 2 ms
[2024-05-22 08:22:05] [INFO ] Time to serialize properties into /tmp/LTL2338045375173125039.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15660231978490738061.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5395812448782421105.hoa' '-atoms' '/tmp/LTL2338045375173125039.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2338045375173125039.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5395812448782421105.hoa
Detected timeout of ITS tools.
[2024-05-22 08:22:20] [INFO ] Flatten gal took : 11 ms
[2024-05-22 08:22:20] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:22:20] [INFO ] Time to serialize gal into /tmp/LTL16217930118299713966.gal : 2 ms
[2024-05-22 08:22:20] [INFO ] Time to serialize properties into /tmp/LTL4376474476056764156.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16217930118299713966.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4376474476056764156.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((p188==0)||(p244==0))||((p10==0)||(p272==0)))||(p274==0))"))))&&(G("((p199!=1)||(p244!=1))")))))
Formula 0 simplified : G(XXG!"((((p188==0)||(p244==0))||((p10==0)||(p272==0)))||(p274==0))" | F!"((p199!=1)||(p244!=1))")
Detected timeout of ITS tools.
[2024-05-22 08:22:35] [INFO ] Flatten gal took : 12 ms
[2024-05-22 08:22:35] [INFO ] Applying decomposition
[2024-05-22 08:22:35] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8672041508781976940.txt' '-o' '/tmp/graph8672041508781976940.bin' '-w' '/tmp/graph8672041508781976940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8672041508781976940.bin' '-l' '-1' '-v' '-w' '/tmp/graph8672041508781976940.weights' '-q' '0' '-e' '0.001'
[2024-05-22 08:22:35] [INFO ] Decomposing Gal with order
[2024-05-22 08:22:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:22:35] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 08:22:35] [INFO ] Flatten gal took : 23 ms
[2024-05-22 08:22:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-22 08:22:35] [INFO ] Time to serialize gal into /tmp/LTL6826735145162392700.gal : 4 ms
[2024-05-22 08:22:35] [INFO ] Time to serialize properties into /tmp/LTL4177573139576917272.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6826735145162392700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4177573139576917272.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((u2.p188==0)||(u2.p244==0))||((u14.p10==0)||(u14.p272==0)))||(u14.p274==0))"))))&&(G("((u2.p199!=1)||(u2.p244!=1))")))...157
Formula 0 simplified : G(XXG!"((((u2.p188==0)||(u2.p244==0))||((u14.p10==0)||(u14.p272==0)))||(u14.p274==0))" | F!"((u2.p199!=1)||(u2.p244!=1))")
Detected timeout of ITS tools.
Treatment of property DES-PT-60a-LTLFireability-00 finished in 444960 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)))))))'
Found a Lengthening insensitive property : DES-PT-60a-LTLFireability-07
Stuttering acceptance computed with spot in 236 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-05-22 08:22:51] [INFO ] Invariant cache hit.
[2024-05-22 08:22:51] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 08:22:51] [INFO ] Invariant cache hit.
[2024-05-22 08:22:51] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 08:22:51] [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-22 08:22:57] [INFO ] Deduced a trap composed of 12 places in 100 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-22 08:23:08] [INFO ] Deduced a trap composed of 9 places in 71 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 26236 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-22 08:23:21] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-22 08:23:22] [INFO ] Deduced a trap composed of 12 places in 24 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

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r092-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 ;