MCC'2024- Execution of r092-tall-171624189800700

About the Execution of ITS-Tools for DES-PT-30a

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16188.827	3600000.00	6488836.00	8013.70	TFFFTT?TTFFFFFFF	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r092-tall-171624189800700.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-30a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189800700
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:38 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 70K 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-30a-LTLFireability-00
FORMULA_NAME DES-PT-30a-LTLFireability-01
FORMULA_NAME DES-PT-30a-LTLFireability-02
FORMULA_NAME DES-PT-30a-LTLFireability-03
FORMULA_NAME DES-PT-30a-LTLFireability-04
FORMULA_NAME DES-PT-30a-LTLFireability-05
FORMULA_NAME DES-PT-30a-LTLFireability-06
FORMULA_NAME DES-PT-30a-LTLFireability-07
FORMULA_NAME DES-PT-30a-LTLFireability-08
FORMULA_NAME DES-PT-30a-LTLFireability-09
FORMULA_NAME DES-PT-30a-LTLFireability-10
FORMULA_NAME DES-PT-30a-LTLFireability-11
FORMULA_NAME DES-PT-30a-LTLFireability-12
FORMULA_NAME DES-PT-30a-LTLFireability-13
FORMULA_NAME DES-PT-30a-LTLFireability-14
FORMULA_NAME DES-PT-30a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716350099232

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-30a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 03:55:00] [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 03:55:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:55:00] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-22 03:55:00] [INFO ] Transformed 234 places.
[2024-05-22 03:55:00] [INFO ] Transformed 191 transitions.
[2024-05-22 03:55:00] [INFO ] Found NUPN structural information;
[2024-05-22 03:55:00] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 181 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 4 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-30a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 177/177 transitions.
Applied a total of 0 rules in 33 ms. Remains 234 /234 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 234 cols
[2024-05-22 03:55:00] [INFO ] Computed 59 invariants in 28 ms
[2024-05-22 03:55:01] [INFO ] Implicit Places using invariants in 356 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 384 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/234 places, 177/177 transitions.
Applied a total of 0 rules in 14 ms. Remains 233 /233 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 446 ms. Remains : 233/234 places, 177/177 transitions.
Support contains 53 out of 233 places after structural reductions.
[2024-05-22 03:55:01] [INFO ] Flatten gal took : 45 ms
[2024-05-22 03:55:01] [INFO ] Flatten gal took : 20 ms
[2024-05-22 03:55:01] [INFO ] Input system was already deterministic with 177 transitions.
Support contains 50 out of 233 places (down from 53) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (891 resets) in 2388 ms. (16 steps per ms) remains 16/32 properties
BEST_FIRST walk for 4004 steps (19 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (18 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (23 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (15 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (18 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (16 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (19 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (17 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (18 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (24 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (18 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (19 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (17 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
// Phase 1: matrix 177 rows 233 cols
[2024-05-22 03:55:02] [INFO ] Computed 58 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 10/32 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 62/94 variables, 26/64 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 62/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 104/198 variables, 25/151 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 104/255 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 3/201 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 176/377 variables, 201/460 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 03:55:03] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 14 ms to minimize.
[2024-05-22 03:55:03] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-22 03:55:03] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-22 03:55:03] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/377 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 03:55:04] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-22 03:55:04] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 03:55:04] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/377 variables, 3/467 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/377 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 33/410 variables, 32/499 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/410 variables, 32/531 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/410 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (OVERLAPS) 0/410 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 531 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3835 ms.
Refiners :[Domain max(s): 233/233 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 10/32 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 62/94 variables, 26/64 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 62/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 104/198 variables, 25/152 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 104/256 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 3/201 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 176/377 variables, 201/467 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/377 variables, 5/472 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/377 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 33/410 variables, 32/504 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/410 variables, 32/536 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/410 variables, 11/547 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/410 variables, and 547 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5009 ms.
Refiners :[Domain max(s): 233/233 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 7/7 constraints]
After SMT, in 8920ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 177/177 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 232 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 232 transition count 175
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 7 place count 232 transition count 175
Applied a total of 7 rules in 37 ms. Remains 232 /233 variables (removed 1) and now considering 175/177 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 232/233 places, 175/177 transitions.
RANDOM walk for 40000 steps (651 resets) in 651 ms. (61 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (26 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (27 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (11 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 639467 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 16
Probabilistic random walk after 639467 steps, saw 89635 distinct states, run finished after 3004 ms. (steps per millisecond=212 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 03:55:14] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 03:55:14] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 10/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 66/98 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 102/200 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 3/203 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 175/378 variables, 203/262 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 03:55:15] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-22 03:55:15] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 29/407 variables, 29/295 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 0/407 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 295 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1675 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 10/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 66/98 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 102/200 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 3/203 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 175/378 variables, 203/264 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 29/407 variables, 29/300 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 11/311 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 03:55:19] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/407 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 03:55:20] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-22 03:55:21] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/407 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/407 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 0/407 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 314 constraints, problems are : Problem set: 0 solved, 16 unsolved in 9701 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints]
After SMT, in 11404ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 2681 ms.
Support contains 22 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 11 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-22 03:55:28] [INFO ] Invariant cache hit.
[2024-05-22 03:55:29] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 03:55:29] [INFO ] Invariant cache hit.
[2024-05-22 03:55:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:55:29] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-05-22 03:55:29] [INFO ] Redundant transitions in 6 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-22 03:55:29] [INFO ] Invariant cache hit.
[2024-05-22 03:55:29] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 03:55:30] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-22 03:55:31] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 175/407 variables, 232/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 03:55:32] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-22 03:55:33] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 03:55:33] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/407 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 298 constraints, problems are : Problem set: 0 solved, 174 unsolved in 8500 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 03:55:38] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-22 03:55:39] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-22 03:55:39] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/407 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 174/475 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 03:55:49] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:55:49] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:55:49] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 03:56:01] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 479 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 12/12 constraints]
After SMT, in 38617ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 38620ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39136 ms. Remains : 232/232 places, 175/175 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 16 properties.
[2024-05-22 03:56:08] [INFO ] Invariant cache hit.
[2024-05-22 03:56:08] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-22 03:56:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 03:56:08] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-22 03:56:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-22 03:56:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 03:56:08] [INFO ] After 465ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-05-22 03:56:09] [INFO ] After 965ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2024-05-22 03:56:09] [INFO ] After 1697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Over-approximation ignoring read arcs solved 0 properties in 1902 ms.
FORMULA DES-PT-30a-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 136 stabilizing places and 131 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' '!(!(!p0 U (X(p0)&&p1)))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 10 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 03:56:10] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 03:56:10] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 03:56:10] [INFO ] Invariant cache hit.
[2024-05-22 03:56:10] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 03:56:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 03:56:13] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-22 03:56:13] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:56:14] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 03:56:14] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-22 03:56:14] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:56:14] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-22 03:56:14] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-22 03:56:14] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:56:14] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7345 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37454ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37457ms
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37914 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND p0 p1), p0, true]
Running random walk in product with property : DES-PT-30a-LTLFireability-00
Product exploration explored 100000 steps with 3049 reset in 316 ms.
Product exploration explored 100000 steps with 3040 reset in 288 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND p0 p1), p0, true]
RANDOM walk for 40000 steps (900 resets) in 332 ms. (120 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (181 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
[2024-05-22 03:56:49] [INFO ] Invariant cache hit.
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) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 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) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 03:56:49] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 13 ms to minimize.
[2024-05-22 03:56:50] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/408 variables, 33/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 659ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1556 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=389 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 6 factoid took 199 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND p0 p1), p0, true]
Stuttering acceptance computed with spot in 100 ms :[(AND p0 p1), p0, true]
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 03:56:50] [INFO ] Invariant cache hit.
[2024-05-22 03:56:50] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 03:56:50] [INFO ] Invariant cache hit.
[2024-05-22 03:56:50] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 03:56:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 03:56:53] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-22 03:56:54] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:56:54] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:56:54] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:56:54] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-22 03:56:54] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-22 03:56:54] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-22 03:56:55] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-22 03:56:55] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7702 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37806ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37811ms
Finished structural reductions in LTL mode , in 1 iterations and 38159 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND p0 p1), p0, true]
RANDOM walk for 40000 steps (885 resets) in 218 ms. (182 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (182 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2024-05-22 03:57:29] [INFO ] Invariant cache hit.
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) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 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) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 03:57:29] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-22 03:57:29] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/408 variables, 33/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 473ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1623 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=147 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 6 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND p0 p1), p0, true]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 p1), p0, true]
Stuttering acceptance computed with spot in 86 ms :[(AND p0 p1), p0, true]
Product exploration explored 100000 steps with 3049 reset in 193 ms.
Product exploration explored 100000 steps with 3050 reset in 336 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 104 ms :[(AND p0 p1), p0, true]
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 03:57:30] [INFO ] Redundant transitions in 5 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-22 03:57:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 03:57:33] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-22 03:57:34] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:57:34] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-22 03:57:34] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:57:34] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-05-22 03:57:34] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-22 03:57:34] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 03:57:34] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-22 03:57:35] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7500 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37608ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37610ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37641 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin4253389114143838447
[2024-05-22 03:58:08] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4253389114143838447
Running compilation step : cd /tmp/ltsmin4253389114143838447;'/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 469 ms.
Running link step : cd /tmp/ltsmin4253389114143838447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4253389114143838447;'/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/stateBased8953330999113449688.hoa' '--buchi-type=spotba'
LTSmin run took 4865 ms.
FORMULA DES-PT-30a-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30a-LTLFireability-00 finished in 123738 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))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 22 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 03:58:13] [INFO ] Invariant cache hit.
[2024-05-22 03:58:14] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 03:58:14] [INFO ] Invariant cache hit.
[2024-05-22 03:58:14] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-22 03:58:14] [INFO ] Redundant transitions in 3 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-22 03:58:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 03:58:17] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-22 03:58:17] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 5 ms to minimize.
[2024-05-22 03:58:17] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 03:58:17] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-22 03:58:17] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-22 03:58:17] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-22 03:58:18] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 03:58:18] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-22 03:58:18] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7391 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37509ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37511ms
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37947 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-01
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-01 finished in 38049 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((G(p0)||F(G(p1))))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 7 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 03:58:51] [INFO ] Invariant cache hit.
[2024-05-22 03:58:52] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-22 03:58:52] [INFO ] Invariant cache hit.
[2024-05-22 03:58:52] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 03:58:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 03:58:55] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-22 03:58:55] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-22 03:58:55] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:58:55] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-05-22 03:58:56] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-22 03:58:56] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-22 03:58:56] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-22 03:58:56] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:58:56] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7537 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37638ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37639ms
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38135 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30a-LTLFireability-02
Product exploration explored 100000 steps with 2224 reset in 309 ms.
Product exploration explored 100000 steps with 2199 reset in 290 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
RANDOM walk for 153 steps (2 resets) in 4 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 111 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 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Support contains 2 out of 232 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 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-22 03:59:31] [INFO ] Invariant cache hit.
[2024-05-22 03:59:31] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-22 03:59:31] [INFO ] Invariant cache hit.
[2024-05-22 03:59:31] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-05-22 03:59:31] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-22 03:59:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 03:59:34] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-05-22 03:59:34] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-22 03:59:34] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 03:59:35] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-22 03:59:35] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-22 03:59:35] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-22 03:59:35] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-22 03:59:35] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2024-05-22 03:59:35] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7584 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37671ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37673ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38145 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
RANDOM walk for 191 steps (3 resets) in 6 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 88 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 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2255 reset in 196 ms.
Product exploration explored 100000 steps with 2216 reset in 239 ms.
Built C files in :
/tmp/ltsmin8264369625318216540
[2024-05-22 04:00:10] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2024-05-22 04:00:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:00:10] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2024-05-22 04:00:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:00:10] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2024-05-22 04:00:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:00:10] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8264369625318216540
Running compilation step : cd /tmp/ltsmin8264369625318216540;'/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 428 ms.
Running link step : cd /tmp/ltsmin8264369625318216540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8264369625318216540;'/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/stateBased16278828172677498444.hoa' '--buchi-type=spotba'
LTSmin run took 2587 ms.
FORMULA DES-PT-30a-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30a-LTLFireability-02 finished in 81298 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' '!(((!p0 U (G(!p0)||(!p0&&(!p1 U (p2||G(!p1))))))||(G(p3)&&F(p4))))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 15 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 04:00:13] [INFO ] Invariant cache hit.
[2024-05-22 04:00:13] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 04:00:13] [INFO ] Invariant cache hit.
[2024-05-22 04:00:13] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-22 04:00:13] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-22 04:00:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 04:00:16] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-22 04:00:16] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:00:17] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-22 04:00:17] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-22 04:00:17] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-22 04:00:17] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-22 04:00:17] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-22 04:00:17] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:00:17] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7396 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37496ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37498ms
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37848 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 501 ms :[true, (OR (NOT p3) (NOT p4)), (OR (AND p0 p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p2) (NOT p4))), (AND (NOT p2) p1 p0 (NOT p3)), (NOT p3), (AND p0 (NOT p3)), (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4))), (AND (NOT p3) (NOT p2) p1), p0, (OR (AND p0 (NOT p3)) (AND p0 (NOT p4))), (AND p0 (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-03
Product exploration explored 100000 steps with 2246 reset in 280 ms.
Product exploration explored 100000 steps with 2244 reset in 323 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/5 atomic propositions.
Knowledge obtained : [(AND p3 p4 (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND p3 p4 (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) p0))), (X p4), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (AND p3 (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 p4 p0))), (X (NOT (AND p3 (NOT p4) p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) p1 (NOT p0)))), (X (AND p3 p4)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p3 p4 (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 p4 (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 p4 (NOT p2) p1 p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) p1 p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X p3), (X (NOT (AND p3 (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p3 p4 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1))))), (X (X p4)), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 p4 p0)))), (X (X (NOT (AND p3 (NOT p4) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1 (NOT p0))))), (X (X (AND p3 p4))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p3 p4 (NOT p2) p1)))), (X (X (NOT (AND p3 p4 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 p4 (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 p4 (NOT p2) p1 p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1 p0)))), (X (X (AND p3 p4 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X p3)), (X (X (NOT (AND p3 (NOT p2) (NOT p1) p0)))), (X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 76 factoid took 222 ms. Reduced automaton from 12 states, 60 edges and 5 AP (stutter insensitive) to 17 states, 118 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 690 ms :[true, (AND (NOT p3) p0 p1 (NOT p2)), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2) p0), (NOT p3), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0), (AND (NOT p3) p1 (NOT p2)), p0, (AND p0 (NOT p3))]
RANDOM walk for 40000 steps (884 resets) in 646 ms. (61 steps per ms) remains 23/32 properties
BEST_FIRST walk for 4003 steps (18 resets) in 52 ms. (75 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (17 resets) in 55 ms. (71 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (15 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (18 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (17 resets) in 65 ms. (60 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (20 resets) in 57 ms. (69 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (18 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (20 resets) in 53 ms. (74 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (21 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (21 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (16 resets) in 79 ms. (50 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (20 resets) in 63 ms. (62 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (19 resets) in 77 ms. (51 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (15 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (18 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (16 resets) in 55 ms. (71 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (18 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (18 resets) in 44 ms. (88 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (16 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (18 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 60 ms. (65 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
[2024-05-22 04:00:53] [INFO ] Invariant cache hit.
Problem apf8 is UNSAT
Problem apf14 is UNSAT
Problem apf15 is UNSAT
Problem apf20 is UNSAT
Problem apf26 is UNSAT
Problem apf29 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 70/80 variables, 30/32 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 116/196 variables, 25/57 constraints. Problems are: Problem set: 6 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/57 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 3/199 variables, 1/58 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 6 solved, 17 unsolved
Problem apf6 is UNSAT
Problem apf13 is UNSAT
Problem apf17 is UNSAT
Problem apf22 is UNSAT
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 10 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 10 solved, 13 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 70/80 variables, 30/32 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 116/196 variables, 25/57 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/57 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 3/199 variables, 1/58 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 10 solved, 13 unsolved
Problem apf12 is UNSAT
Problem apf24 is UNSAT
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 12 solved, 11 unsolved
[2024-05-22 04:00:55] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/258 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/258 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 34/408 variables, 33/291 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 11/302 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/302 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/302 constraints. Problems are: Problem set: 12 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 302 constraints, problems are : Problem set: 12 solved, 11 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/23 constraints, Known Traps: 1/1 constraints]
After SMT, in 2588ms problems are : Problem set: 12 solved, 11 unsolved
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 21660 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 7 place count 232 transition count 175
Applied a total of 7 rules in 15 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 232/232 places, 175/176 transitions.
RANDOM walk for 40000 steps (667 resets) in 659 ms. (60 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (123 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (119 resets) in 211 ms. (188 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (106 resets) in 258 ms. (154 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (95 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (120 resets) in 162 ms. (245 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (121 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (124 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (120 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (128 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (121 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (100 resets) in 143 ms. (277 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 533424 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 11
Probabilistic random walk after 533424 steps, saw 75124 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 04:01:21] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 04:01:21] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 72/82 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 117/199 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 3/202 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 175/377 variables, 202/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 30/407 variables, 30/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 11 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 72/82 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 117/199 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 3/202 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 175/377 variables, 202/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 04:01:23] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:01:23] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 30/407 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 11/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/407 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 307 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints]
After SMT, in 2405ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 9 different solutions.
Finished Parikh walk after 5604 steps, including 17 resets, run visited all 2 properties in 64 ms. (steps per millisecond=87 )
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 )
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 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 11 properties in 4550 ms.
Found 12 invariant AP formulas.
Knowledge obtained : [(AND p3 p4 (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND p3 p4 (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) p0))), (X p4), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (AND p3 (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 p4 p0))), (X (NOT (AND p3 (NOT p4) p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) p1 (NOT p0)))), (X (AND p3 p4)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p3 p4 (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 p4 (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 p4 (NOT p2) p1 p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) p1 p0))), (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X p3), (X (NOT (AND p3 (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p3 p4 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1))))), (X (X p4)), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 p4 p0)))), (X (X (NOT (AND p3 (NOT p4) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1 (NOT p0))))), (X (X (AND p3 p4))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p3 p4 (NOT p2) p1)))), (X (X (NOT (AND p3 p4 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 p4 (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 p4 (NOT p2) p1 p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) p1 p0)))), (X (X (AND p3 p4 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p4) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X p3)), (X (X (NOT (AND p3 (NOT p2) (NOT p1) p0)))), (X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) p1 (NOT p2) p3)), (G (OR p0 p1 p2 p3)), (G (OR p0 (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) p1 p2 p3)), (G (OR (NOT p0) (NOT p1) (NOT p2) p3)), (G (OR (NOT p0) p1 (NOT p2) (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (OR p0 p1 (NOT p2) (NOT p3))), (G (OR (NOT p0) p3)), (G (OR p1 p2 p3)), (G (OR (NOT p0) (NOT p1) p2 p3))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 p3))), (F p2), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT p3)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2))), (F p1), (F p0)]
Knowledge based reduction with 88 factoid took 2086 ms. Reduced automaton from 17 states, 118 edges and 4 AP (stutter insensitive) to 20 states, 66 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1023 ms :[true, (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), p1, (AND p0 p1), (AND (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3)), false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 934 ms :[true, (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), p1, (AND p0 p1), (AND (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3)), false, false, false, false, false, false, false, false, false, false, false]
Support contains 5 out of 232 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 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 04:01:32] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 04:01:33] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 04:01:33] [INFO ] Invariant cache hit.
[2024-05-22 04:01:33] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-22 04:01:33] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-22 04:01:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 04:01:36] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:01:36] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:01:36] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:01:36] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-22 04:01:36] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:01:36] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:01:36] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:01:37] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 04:01:37] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7416 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37501ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37503ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37863 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND p0 p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3)))), (X (AND (NOT p0) (NOT p1) p3)), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p1) p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 52 factoid took 171 ms. Reduced automaton from 20 states, 66 edges and 4 AP (stutter insensitive) to 20 states, 74 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 933 ms :[true, (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), p0, p0, (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3)), p1, (AND p0 p1), p1, p1, false, false, false, false, false, false, false]
RANDOM walk for 40000 steps (889 resets) in 782 ms. (51 steps per ms) remains 18/25 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (18 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (23 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (16 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (15 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (19 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (14 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (21 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (16 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (18 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (19 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
[2024-05-22 04:02:12] [INFO ] Invariant cache hit.
Problem apf6 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 70/80 variables, 30/32 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 116/196 variables, 25/57 constraints. Problems are: Problem set: 2 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/57 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 3/199 variables, 1/58 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 16 unsolved
Problem apf5 is UNSAT
Problem apf10 is UNSAT
Problem apf15 is UNSAT
Problem apf17 is UNSAT
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 6 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 6 solved, 12 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 70/80 variables, 30/32 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 116/196 variables, 25/57 constraints. Problems are: Problem set: 6 solved, 12 unsolved
[2024-05-22 04:02:13] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/58 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/58 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 3/199 variables, 1/59 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/59 constraints. Problems are: Problem set: 6 solved, 12 unsolved
Problem apf18 is UNSAT
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/258 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/258 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 34/408 variables, 33/291 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 11/302 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/302 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/302 constraints. Problems are: Problem set: 7 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 302 constraints, problems are : Problem set: 7 solved, 11 unsolved in 1564 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/18 constraints, Known Traps: 1/1 constraints]
After SMT, in 2372ms problems are : Problem set: 7 solved, 11 unsolved
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 7 properties in 13732 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 7 place count 232 transition count 175
Applied a total of 7 rules in 12 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 232/232 places, 175/176 transitions.
RANDOM walk for 40000 steps (654 resets) in 479 ms. (83 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (121 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (101 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (117 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (127 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 729706 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 4
Probabilistic random walk after 729706 steps, saw 100011 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 04:02:31] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 04:02:31] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 72/82 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 117/199 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/202 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 175/377 variables, 202/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 04:02:32] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:02:32] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:02:32] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 30/407 variables, 30/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/407 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 297 constraints, problems are : Problem set: 0 solved, 4 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 72/82 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 117/199 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 175/377 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 30/407 variables, 30/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/407 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 301 constraints, problems are : Problem set: 0 solved, 4 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 1255ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 5928 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-22 04:02:38] [INFO ] Invariant cache hit.
[2024-05-22 04:02:39] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 04:02:39] [INFO ] Invariant cache hit.
[2024-05-22 04:02:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 04:02:39] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-05-22 04:02:39] [INFO ] Redundant transitions in 0 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-22 04:02:39] [INFO ] Invariant cache hit.
[2024-05-22 04:02:39] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/407 variables, 232/291 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6458 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:02:47] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:02:47] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-22 04:02:47] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-22 04:02:48] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:02:49] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 175/407 variables, 232/296 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 174/473 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:02:56] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-22 04:02:58] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 475 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 7/7 constraints]
After SMT, in 36550ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 36552ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36961 ms. Remains : 232/232 places, 175/175 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 232 transition count 175
Applied a total of 1 rules in 11 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 04:03:15] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 04:03:15] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 04:03:15] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 15 ms returned sat
[2024-05-22 04:03:16] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 04:03:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 04:03:16] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-22 04:03:16] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 04:03:16] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 04:03:16] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 593 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND p0 p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3)))), (X (AND (NOT p0) (NOT p1) p3)), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p1) p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (AND (OR (NOT p0) (NOT p1) p3) (OR (NOT p0) p2 p3))), (G (OR (NOT p0) p1 (NOT p2) (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (OR (NOT p0) p1 (NOT p2) p3)), (G (OR p0 p1 p2 p3)), (G (OR (NOT p0) p1 p2 p3)), (G (OR (NOT p0) p3))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p3)))), (F p1), (F (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) p2) (AND (NOT p1) p3)))), (F p0), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F (NOT (AND (NOT p1) p3))), (F (NOT (OR p0 p1 (NOT p2) p3)))]
Knowledge based reduction with 59 factoid took 954 ms. Reduced automaton from 20 states, 74 edges and 4 AP (stutter insensitive) to 17 states, 56 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 779 ms :[true, (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), p0, (AND p0 (NOT p3)), p1, (AND p0 p1), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 789 ms :[true, (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), p0, (AND p0 (NOT p3)), p1, (AND p0 p1), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 800 ms :[true, (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), p0, (AND p0 (NOT p3)), p1, (AND p0 p1), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 2228 reset in 266 ms.
Product exploration explored 100000 steps with 2240 reset in 285 ms.
Built C files in :
/tmp/ltsmin1482110599738631255
[2024-05-22 04:03:20] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2024-05-22 04:03:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:03:20] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2024-05-22 04:03:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:03:20] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2024-05-22 04:03:20] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:03:20] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1482110599738631255
Running compilation step : cd /tmp/ltsmin1482110599738631255;'/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 456 ms.
Running link step : cd /tmp/ltsmin1482110599738631255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1482110599738631255;'/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/stateBased3999377205859046023.hoa' '--buchi-type=spotba'
LTSmin run took 935 ms.
FORMULA DES-PT-30a-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30a-LTLFireability-03 finished in 188582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((!p1 U (G(!p1)||(!p1&&(p2 U p3))))))))'
Support contains 8 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 7 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 04:03:21] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 04:03:22] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 04:03:22] [INFO ] Invariant cache hit.
[2024-05-22 04:03:22] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 04:03:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 04:03:25] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-22 04:03:25] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:03:25] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-05-22 04:03:25] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:03:25] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:03:25] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:03:25] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:03:26] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:03:26] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7684 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37779ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37781ms
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38135 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Running random walk in product with property : DES-PT-30a-LTLFireability-06
Product exploration explored 100000 steps with 2230 reset in 323 ms.
Product exploration explored 100000 steps with 2233 reset in 265 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 218 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
RANDOM walk for 40000 steps (881 resets) in 527 ms. (75 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40003 steps (261 resets) in 224 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (181 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (180 resets) in 168 ms. (236 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (254 resets) in 170 ms. (233 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (140 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (221 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (252 resets) in 207 ms. (192 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (253 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (178 resets) in 205 ms. (194 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (219 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (184 resets) in 187 ms. (212 steps per ms) remains 11/11 properties
[2024-05-22 04:04:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 176/376 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 32/408 variables, 32/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 11 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 176/376 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 32/408 variables, 32/292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 9/301 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 301 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 1910ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 15116 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
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 6 place count 232 transition count 175
Applied a total of 6 rules in 15 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 232/232 places, 175/176 transitions.
RANDOM walk for 40000 steps (884 resets) in 562 ms. (71 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (337 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (179 resets) in 155 ms. (256 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (180 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (332 resets) in 180 ms. (221 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (152 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (286 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (340 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (336 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (179 resets) in 162 ms. (245 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (293 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (149 resets) in 192 ms. (207 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 592321 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 11
Probabilistic random walk after 592321 steps, saw 83164 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 04:04:22] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 04:04:22] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 32/407 variables, 32/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 11 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 04:04:23] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 32/407 variables, 32/297 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 04:04:24] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/407 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 307 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1947 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints]
After SMT, in 2519ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 12056 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-22 04:04:37] [INFO ] Invariant cache hit.
[2024-05-22 04:04:37] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 04:04:37] [INFO ] Invariant cache hit.
[2024-05-22 04:04:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 04:04:37] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-05-22 04:04:37] [INFO ] Redundant transitions in 0 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-22 04:04:37] [INFO ] Invariant cache hit.
[2024-05-22 04:04:37] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/407 variables, 232/291 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5468 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:04:44] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-22 04:04:44] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-22 04:04:44] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-22 04:04:44] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-22 04:04:45] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-05-22 04:04:45] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:04:45] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:04:45] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/407 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 174/476 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:04:51] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
[2024-05-22 04:04:51] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:04:52] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:04:52] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:04:53] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:04:56] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:04:56] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:05:01] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 484 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 16/16 constraints]
After SMT, in 35556ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 35558ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35944 ms. Remains : 232/232 places, 175/175 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 11 properties.
[2024-05-22 04:05:13] [INFO ] Invariant cache hit.
[2024-05-22 04:05:13] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-22 04:05:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 04:05:13] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 04:05:14] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-05-22 04:05:14] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:05:14] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-05-22 04:05:14] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:05:14] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:05:14] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:05:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 325 ms
[2024-05-22 04:05:14] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:05:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
TRAPS : Iteration 1
[2024-05-22 04:05:15] [INFO ] After 1591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2024-05-22 04:05:15] [INFO ] After 2090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Over-approximation ignoring read arcs solved 0 properties in 2201 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR p1 (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 23 factoid took 503 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 04:05:16] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 04:05:16] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 04:05:16] [INFO ] Invariant cache hit.
[2024-05-22 04:05:16] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 04:05:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 04:05:19] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:05:20] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:05:20] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:05:20] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-22 04:05:20] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:05:20] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-22 04:05:20] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-22 04:05:21] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-22 04:05:21] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7462 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37555ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37557ms
Finished structural reductions in LTL mode , in 1 iterations and 37897 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 254 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
RANDOM walk for 40000 steps (893 resets) in 329 ms. (121 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40003 steps (174 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (249 resets) in 193 ms. (206 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (251 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (260 resets) in 143 ms. (277 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (144 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (183 resets) in 210 ms. (189 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (253 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (218 resets) in 242 ms. (164 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (219 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (177 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (173 resets) in 164 ms. (242 steps per ms) remains 11/11 properties
[2024-05-22 04:05:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 176/376 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 32/408 variables, 32/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 11 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 04:05:56] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/200 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 176/376 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 32/408 variables, 32/293 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 9/302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/408 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 302 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1814 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 2449ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 16973 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
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 6 place count 232 transition count 175
Applied a total of 6 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 232/232 places, 175/176 transitions.
RANDOM walk for 40000 steps (863 resets) in 491 ms. (81 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (176 resets) in 133 ms. (298 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (331 resets) in 191 ms. (208 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (327 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (339 resets) in 201 ms. (198 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (159 resets) in 143 ms. (277 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (177 resets) in 213 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (332 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (281 resets) in 224 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (284 resets) in 194 ms. (205 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (174 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (180 resets) in 145 ms. (274 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 551441 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 11
Probabilistic random walk after 551441 steps, saw 77943 distinct states, run finished after 3003 ms. (steps per millisecond=183 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 04:06:19] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 04:06:19] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 32/407 variables, 32/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 11 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 04:06:20] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 32/407 variables, 32/297 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/407 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 306 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1674 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 2291ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 11725 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-22 04:06:33] [INFO ] Invariant cache hit.
[2024-05-22 04:06:33] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 04:06:33] [INFO ] Invariant cache hit.
[2024-05-22 04:06:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 04:06:33] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-22 04:06:33] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-22 04:06:33] [INFO ] Invariant cache hit.
[2024-05-22 04:06:33] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/407 variables, 232/291 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5472 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:06:39] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:06:39] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-22 04:06:39] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-22 04:06:40] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:06:40] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:06:40] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:06:40] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:06:41] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/407 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 174/476 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:06:46] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-22 04:06:47] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:06:48] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:06:48] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:06:49] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:06:51] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:06:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-22 04:06:56] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 484 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 16/16 constraints]
After SMT, in 35582ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 35584ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35966 ms. Remains : 232/232 places, 175/175 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 11 properties.
[2024-05-22 04:07:09] [INFO ] Invariant cache hit.
[2024-05-22 04:07:09] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 04:07:09] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 04:07:09] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-22 04:07:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 04:07:09] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 04:07:09] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-05-22 04:07:09] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-22 04:07:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-22 04:07:10] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:07:10] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:07:10] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:07:10] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:07:10] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:07:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 387 ms
TRAPS : Iteration 1
[2024-05-22 04:07:10] [INFO ] After 1588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2024-05-22 04:07:11] [INFO ] After 2108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Over-approximation ignoring read arcs solved 0 properties in 2242 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3) p0))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 23 factoid took 469 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Product exploration explored 100000 steps with 2189 reset in 245 ms.
Product exploration explored 100000 steps with 2234 reset in 254 ms.
Built C files in :
/tmp/ltsmin17690277924929507945
[2024-05-22 04:07:12] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17690277924929507945
Running compilation step : cd /tmp/ltsmin17690277924929507945;'/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 388 ms.
Running link step : cd /tmp/ltsmin17690277924929507945;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17690277924929507945;'/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/stateBased1256776508656535431.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 04:07:27] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 04:07:28] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 04:07:28] [INFO ] Invariant cache hit.
[2024-05-22 04:07:28] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 04:07:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 04:07:30] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:07:31] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:07:31] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:07:31] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:07:31] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:07:31] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-22 04:07:31] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:07:32] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:07:32] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7337 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37428ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37430ms
Finished structural reductions in LTL mode , in 1 iterations and 37782 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin11659861031206469278
[2024-05-22 04:08:05] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11659861031206469278
Running compilation step : cd /tmp/ltsmin11659861031206469278;'/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 391 ms.
Running link step : cd /tmp/ltsmin11659861031206469278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11659861031206469278;'/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/stateBased4463987865145454618.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 04:08:20] [INFO ] Flatten gal took : 17 ms
[2024-05-22 04:08:20] [INFO ] Flatten gal took : 16 ms
[2024-05-22 04:08:20] [INFO ] Time to serialize gal into /tmp/LTL11292342004221919371.gal : 3 ms
[2024-05-22 04:08:20] [INFO ] Time to serialize properties into /tmp/LTL11056557998004291226.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/LTL11292342004221919371.gal' '-t' 'CGAL' '-hoa' '/tmp/aut261004768842056239.hoa' '-atoms' '/tmp/LTL11056557998004291226.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/LTL11056557998004291226.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut261004768842056239.hoa
Detected timeout of ITS tools.
[2024-05-22 04:08:35] [INFO ] Flatten gal took : 14 ms
[2024-05-22 04:08:35] [INFO ] Flatten gal took : 14 ms
[2024-05-22 04:08:35] [INFO ] Time to serialize gal into /tmp/LTL7570299157305817212.gal : 4 ms
[2024-05-22 04:08:36] [INFO ] Time to serialize properties into /tmp/LTL3696569479406827901.ltl : 7 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/LTL7570299157305817212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3696569479406827901.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((!("(((p14==1)&&(p152==1))&&(p154==1))"))U((G(!("(((p14==1)&&(p152==1))&&(p154==1))")))||((!("(((p14==1)&&(p152==1))&&(p154==1...264
Formula 0 simplified : G(!"((p103==0)||(p124==0))" | X((!"((p136==1)&&(p137==1))" R !"(((p22==1)&&(p152==1))&&(p154==1))") U "(((p14==1)&&(p152==1))&&(p154...163
Detected timeout of ITS tools.
[2024-05-22 04:08:51] [INFO ] Flatten gal took : 19 ms
[2024-05-22 04:08:51] [INFO ] Applying decomposition
[2024-05-22 04:08:51] [INFO ] Flatten gal took : 14 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/graph9647783082673441523.txt' '-o' '/tmp/graph9647783082673441523.bin' '-w' '/tmp/graph9647783082673441523.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9647783082673441523.bin' '-l' '-1' '-v' '-w' '/tmp/graph9647783082673441523.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:08:51] [INFO ] Decomposing Gal with order
[2024-05-22 04:08:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:08:51] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 04:08:51] [INFO ] Flatten gal took : 43 ms
[2024-05-22 04:08:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-22 04:08:51] [INFO ] Time to serialize gal into /tmp/LTL122008627433497298.gal : 5 ms
[2024-05-22 04:08:51] [INFO ] Time to serialize properties into /tmp/LTL12012233343217293436.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/LTL122008627433497298.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12012233343217293436.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((!("(((u14.p14==1)&&(u14.p152==1))&&(u14.p154==1))"))U((G(!("(((u14.p14==1)&&(u14.p152==1))&&(u14.p154==1))")))||((!("(((u14.p...342
Formula 0 simplified : G(!"((i1.u2.p103==0)||(i1.u2.p124==0))" | X((!"((i0.i1.u6.p136==1)&&(i0.i0.u7.p137==1))" R !"(((u14.p22==1)&&(u14.p152==1))&&(u14.p1...217
Reverse transition relation is NOT exact ! Due to transitions t1, t136, t137, t170, u13.t129, u14.t11, u48.t5, u48.t40, i0.i0.t0, i0.i0.t168, i0.i0.t174, i...629
Computing Next relation with stutter on 1.99965e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-30a-LTLFireability-06 finished in 344465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 9 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 04:09:06] [INFO ] Invariant cache hit.
[2024-05-22 04:09:06] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 04:09:06] [INFO ] Invariant cache hit.
[2024-05-22 04:09:06] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 04:09:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 04:09:09] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:09:09] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:09:10] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:09:10] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-22 04:09:10] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:09:10] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:09:10] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:09:10] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-22 04:09:10] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7549 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37642ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37644ms
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37991 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-30a-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Product exploration explored 100000 steps with 50000 reset in 319 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-08 finished in 38744 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(G(!p0)) U p1)))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 10 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 04:09:45] [INFO ] Invariant cache hit.
[2024-05-22 04:09:45] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 04:09:45] [INFO ] Invariant cache hit.
[2024-05-22 04:09:45] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-22 04:09:45] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-22 04:09:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 04:09:48] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-22 04:09:48] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-22 04:09:48] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:09:48] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:09:49] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-22 04:09:49] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:09:49] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-22 04:09:49] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 04:09:49] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7648 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37747ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37749ms
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38104 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), p0, (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-09
Product exploration explored 100000 steps with 2200 reset in 189 ms.
Product exploration explored 100000 steps with 2194 reset in 215 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), p0, (NOT p1)]
RANDOM walk for 478 steps (8 resets) in 5 ms. (79 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), p0, (NOT p1)]
[2024-05-22 04:10:24] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-09 finished in 39686 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&&X(X(F(p1)))))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 7 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 04:10:24] [INFO ] Invariant cache hit.
[2024-05-22 04:10:24] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 04:10:24] [INFO ] Invariant cache hit.
[2024-05-22 04:10:25] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 04:10:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 04:10:27] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-22 04:10:28] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:10:28] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-22 04:10:28] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-22 04:10:28] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-22 04:10:28] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-05-22 04:10:29] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-22 04:10:29] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:10:29] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7720 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37820ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37822ms
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38244 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30a-LTLFireability-10
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA DES-PT-30a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-10 finished in 38505 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((((!p1 U G(!p2))||X(p3))&&p0)))'
Support contains 8 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 233 /233 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 233 cols
[2024-05-22 04:11:03] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 04:11:03] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-22 04:11:03] [INFO ] Invariant cache hit.
[2024-05-22 04:11:03] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-22 04:11:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 232/232 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 12/244 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 176 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/233 variables, 32/276 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 14/291 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 177/410 variables, 233/524 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-22 04:11:07] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:11:08] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:11:08] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:11:08] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:11:08] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 5/529 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-22 04:11:11] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/410 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (OVERLAPS) 0/410 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 530 constraints, problems are : Problem set: 0 solved, 176 unsolved in 13891 ms.
Refiners :[Domain max(s): 233/233 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 232/232 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 12/244 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 1/233 variables, 32/276 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 14/291 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-22 04:11:19] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-22 04:11:19] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (OVERLAPS) 177/410 variables, 233/532 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 176/708 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/410 variables, and 708 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30016 ms.
Refiners :[Domain max(s): 233/233 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 8/8 constraints]
After SMT, in 43982ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 43985ms
Finished structural reductions in LTL mode , in 1 iterations and 44620 ms. Remains : 233/233 places, 177/177 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), true, (NOT p3), (AND p2 (NOT p3)), (AND p2 (NOT p3)), p2, p2]
Running random walk in product with property : DES-PT-30a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-11 finished in 44887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((p1&&X((p1 U (!p2||G(p1)))))))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 3 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 04:11:48] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 04:11:48] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 04:11:48] [INFO ] Invariant cache hit.
[2024-05-22 04:11:48] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 04:11:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 04:11:51] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-05-22 04:11:51] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:11:52] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-22 04:11:52] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:11:52] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-22 04:11:52] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-22 04:11:52] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:11:52] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-22 04:11:52] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7732 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37824ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37826ms
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38240 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-12
Product exploration explored 100000 steps with 2227 reset in 210 ms.
Product exploration explored 100000 steps with 2207 reset in 227 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 235 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (885 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (177 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1616229 steps, run timeout after 3001 ms. (steps per millisecond=538 ) properties seen :0 out of 1
Probabilistic random walk after 1616229 steps, saw 223136 distinct states, run finished after 3001 ms. (steps per millisecond=538 ) properties seen :0
[2024-05-22 04:12:30] [INFO ] Invariant cache hit.
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) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/199 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/374 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/408 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 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) 3/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/77 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/195 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:12:30] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/199 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 175/374 variables, 199/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/408 variables, 33/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 412ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 213 ms.
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 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 232 transition count 174
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 232 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 231 transition count 173
Applied a total of 9 rules in 25 ms. Remains 231 /232 variables (removed 1) and now considering 173/176 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 231/232 places, 173/176 transitions.
RANDOM walk for 40000 steps (538 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (91 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1545844 steps, run timeout after 3001 ms. (steps per millisecond=515 ) properties seen :0 out of 1
Probabilistic random walk after 1545844 steps, saw 216480 distinct states, run finished after 3001 ms. (steps per millisecond=515 ) properties seen :0
// Phase 1: matrix 173 rows 231 cols
[2024-05-22 04:12:34] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 04:12:34] [INFO ] State equation strengthened by 2 read => feed constraints.
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
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 122/127 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/158 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/183 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/190 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 140/330 variables, 190/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/342 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/342 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/342 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/343 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/343 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/343 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/375 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 29/404 variables, 29/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/404 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/404 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 231/231 constraints, ReadFeed: 2/2 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) 122/127 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/158 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/183 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/190 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 140/330 variables, 190/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/342 variables, 8/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/342 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/342 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/343 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/343 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/343 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 32/375 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/375 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 29/404 variables, 29/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/404 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/404 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 231/231 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 495ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13780 steps, including 25 resets, run visited all 1 properties in 36 ms. (steps per millisecond=382 )
Parikh walk visited 1 properties in 35 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 11 factoid took 301 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-12 finished in 46735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(F(p0))&&F(p1))) U (p2 U p3)))'
Support contains 8 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 12 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 04:12:34] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 04:12:35] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 04:12:35] [INFO ] Invariant cache hit.
[2024-05-22 04:12:35] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-05-22 04:12:35] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-22 04:12:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 04:12:38] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-22 04:12:38] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-22 04:12:38] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:12:38] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
[2024-05-22 04:12:38] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-22 04:12:38] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-22 04:12:38] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:12:39] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-22 04:12:39] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7457 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37549ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37551ms
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37920 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 418 ms :[(NOT p3), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DES-PT-30a-LTLFireability-14
Stuttering criterion allowed to conclude after 44 steps with 1 reset in 1 ms.
FORMULA DES-PT-30a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-14 finished in 38365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((!p1 U (G(!p1)||(!p1&&(p2 U p3))))))))'
Found a Shortening insensitive property : DES-PT-30a-LTLFireability-06
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 8 out of 233 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 13 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-22 04:13:13] [INFO ] Invariant cache hit.
[2024-05-22 04:13:13] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-22 04:13:13] [INFO ] Invariant cache hit.
[2024-05-22 04:13:13] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 04:13:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 04:13:16] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-22 04:13:17] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:13:17] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:13:17] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:13:17] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-05-22 04:13:17] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-22 04:13:17] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:13:18] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-22 04:13:18] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7488 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37569ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37571ms
Starting structural reductions in LI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 37912 ms. Remains : 232/233 places, 176/177 transitions.
Running random walk in product with property : DES-PT-30a-LTLFireability-06
Product exploration explored 100000 steps with 2189 reset in 238 ms.
Product exploration explored 100000 steps with 2252 reset in 261 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 243 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
RANDOM walk for 40000 steps (903 resets) in 187 ms. (212 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40002 steps (255 resets) in 200 ms. (199 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (168 resets) in 201 ms. (198 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (175 resets) in 272 ms. (146 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (251 resets) in 318 ms. (125 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (149 resets) in 389 ms. (102 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (217 resets) in 354 ms. (112 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (256 resets) in 340 ms. (117 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (256 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (184 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (216 resets) in 319 ms. (125 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (179 resets) in 338 ms. (118 steps per ms) remains 11/11 properties
[2024-05-22 04:13:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 176/376 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 32/408 variables, 32/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 11 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 176/376 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 32/408 variables, 32/292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 9/301 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/408 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 301 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1298 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 1884ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 14676 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
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 6 place count 232 transition count 175
Applied a total of 6 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 232/232 places, 175/176 transitions.
RANDOM walk for 40000 steps (883 resets) in 1491 ms. (26 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (331 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (175 resets) in 268 ms. (148 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (183 resets) in 434 ms. (91 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (330 resets) in 217 ms. (183 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (154 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (286 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (337 resets) in 345 ms. (115 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (331 resets) in 327 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (167 resets) in 186 ms. (213 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (288 resets) in 175 ms. (227 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (160 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 270611 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 11
Probabilistic random walk after 270611 steps, saw 40154 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 04:14:14] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 04:14:14] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 32/407 variables, 32/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 11 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 04:14:15] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 32/407 variables, 32/297 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 04:14:16] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/407 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 307 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2032 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints]
After SMT, in 2648ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 20964 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-22 04:14:38] [INFO ] Invariant cache hit.
[2024-05-22 04:14:38] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 04:14:38] [INFO ] Invariant cache hit.
[2024-05-22 04:14:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 04:14:38] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-22 04:14:38] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-22 04:14:38] [INFO ] Invariant cache hit.
[2024-05-22 04:14:38] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/407 variables, 232/291 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5497 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:14:45] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 04:14:45] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-22 04:14:45] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-22 04:14:45] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-22 04:14:46] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:14:46] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:14:46] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:14:47] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/407 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 174/476 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:14:52] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:14:52] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:14:53] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:14:54] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:14:54] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:14:57] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2024-05-22 04:14:57] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:15:02] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 484 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 16/16 constraints]
After SMT, in 35598ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 35601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36022 ms. Remains : 232/232 places, 175/175 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 11 properties.
[2024-05-22 04:15:14] [INFO ] Invariant cache hit.
[2024-05-22 04:15:14] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-22 04:15:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 04:15:14] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 04:15:15] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-05-22 04:15:15] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:15:15] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:15:15] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:15:15] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:15:15] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:15:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 347 ms
[2024-05-22 04:15:15] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:15:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
TRAPS : Iteration 1
[2024-05-22 04:15:16] [INFO ] After 1614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2024-05-22 04:15:16] [INFO ] After 2106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Over-approximation ignoring read arcs solved 0 properties in 2213 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR p1 (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 23 factoid took 538 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 04:15:17] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 04:15:17] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 04:15:17] [INFO ] Invariant cache hit.
[2024-05-22 04:15:17] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 04:15:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 04:15:20] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:15:21] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:15:21] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:15:21] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-22 04:15:21] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:15:21] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:15:21] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:15:22] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-22 04:15:22] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7504 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37600ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37602ms
Finished structural reductions in LTL mode , in 1 iterations and 37941 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 245 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
RANDOM walk for 40000 steps (894 resets) in 603 ms. (66 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40004 steps (176 resets) in 258 ms. (154 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (253 resets) in 221 ms. (180 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (255 resets) in 269 ms. (148 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (255 resets) in 293 ms. (136 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (150 resets) in 336 ms. (118 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (192 resets) in 382 ms. (104 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (255 resets) in 350 ms. (113 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (216 resets) in 291 ms. (137 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (213 resets) in 271 ms. (147 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (174 resets) in 241 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (180 resets) in 394 ms. (101 steps per ms) remains 11/11 properties
[2024-05-22 04:15:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/200 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 176/376 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 32/408 variables, 32/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 290 constraints, problems are : Problem set: 0 solved, 11 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 68/81 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/199 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 04:15:58] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/200 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 176/376 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 32/408 variables, 32/293 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 9/302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/408 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 302 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1784 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 2412ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 33471 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 175
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 6 place count 232 transition count 175
Applied a total of 6 rules in 21 ms. Remains 232 /232 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 232/232 places, 175/176 transitions.
RANDOM walk for 40000 steps (882 resets) in 1018 ms. (39 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (170 resets) in 349 ms. (114 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (337 resets) in 236 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (333 resets) in 345 ms. (115 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (332 resets) in 340 ms. (117 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (157 resets) in 316 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (168 resets) in 345 ms. (115 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (320 resets) in 455 ms. (87 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (281 resets) in 321 ms. (124 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (287 resets) in 396 ms. (100 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (174 resets) in 263 ms. (151 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (174 resets) in 267 ms. (149 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 403345 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 11
Probabilistic random walk after 403345 steps, saw 59163 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
// Phase 1: matrix 175 rows 232 cols
[2024-05-22 04:16:37] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 04:16:37] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 32/407 variables, 32/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 11 unsolved in 588 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 76/89 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/200 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 175/375 variables, 200/259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 04:16:39] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 32/407 variables, 32/297 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/407 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 306 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1762 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 2384ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 21447 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 232/232 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-22 04:17:01] [INFO ] Invariant cache hit.
[2024-05-22 04:17:01] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-22 04:17:01] [INFO ] Invariant cache hit.
[2024-05-22 04:17:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 04:17:02] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-22 04:17:02] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-22 04:17:02] [INFO ] Invariant cache hit.
[2024-05-22 04:17:02] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/407 variables, 232/291 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 294 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5480 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:17:08] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-22 04:17:08] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-22 04:17:08] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-22 04:17:09] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-22 04:17:09] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:17:09] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:17:09] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:17:10] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/407 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 174/476 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 04:17:15] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-22 04:17:16] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-22 04:17:17] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:17:17] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-22 04:17:18] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:17:20] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:17:21] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-22 04:17:26] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 484 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 232/232 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 16/16 constraints]
After SMT, in 35576ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 35579ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36004 ms. Remains : 232/232 places, 175/175 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3) p0))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 23 factoid took 513 ms. Reduced automaton from 4 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) p1), p1, (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Product exploration explored 100000 steps with 2234 reset in 236 ms.
Product exploration explored 100000 steps with 2205 reset in 255 ms.
Built C files in :
/tmp/ltsmin6861997379480600596
[2024-05-22 04:17:39] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6861997379480600596
Running compilation step : cd /tmp/ltsmin6861997379480600596;'/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 398 ms.
Running link step : cd /tmp/ltsmin6861997379480600596;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6861997379480600596;'/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/stateBased7939485869332916826.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2024-05-22 04:17:54] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 04:17:54] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 04:17:54] [INFO ] Invariant cache hit.
[2024-05-22 04:17:54] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 04:17:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/408 variables, 232/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 04:17:57] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-22 04:17:58] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:17:58] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:17:58] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:17:58] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
[2024-05-22 04:17:58] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:17:58] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:17:59] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-22 04:17:59] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 299 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7558 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/408 variables, 232/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 175/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints]
After SMT, in 37641ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37643ms
Finished structural reductions in LTL mode , in 1 iterations and 37991 ms. Remains : 232/232 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin2053039769542625001
[2024-05-22 04:18:32] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2053039769542625001
Running compilation step : cd /tmp/ltsmin2053039769542625001;'/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 395 ms.
Running link step : cd /tmp/ltsmin2053039769542625001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2053039769542625001;'/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/stateBased3374955511884455008.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 04:18:47] [INFO ] Flatten gal took : 20 ms
[2024-05-22 04:18:47] [INFO ] Flatten gal took : 12 ms
[2024-05-22 04:18:47] [INFO ] Time to serialize gal into /tmp/LTL6448810621307981771.gal : 2 ms
[2024-05-22 04:18:47] [INFO ] Time to serialize properties into /tmp/LTL980428856314730860.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/LTL6448810621307981771.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12538186097171649883.hoa' '-atoms' '/tmp/LTL980428856314730860.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...317
Loading property file /tmp/LTL980428856314730860.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12538186097171649883.hoa
Detected timeout of ITS tools.
[2024-05-22 04:19:02] [INFO ] Flatten gal took : 12 ms
[2024-05-22 04:19:02] [INFO ] Flatten gal took : 11 ms
[2024-05-22 04:19:02] [INFO ] Time to serialize gal into /tmp/LTL11300348469059849883.gal : 3 ms
[2024-05-22 04:19:02] [INFO ] Time to serialize properties into /tmp/LTL2385183502696744352.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/LTL11300348469059849883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2385183502696744352.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((!("(((p14==1)&&(p152==1))&&(p154==1))"))U((G(!("(((p14==1)&&(p152==1))&&(p154==1))")))||((!("(((p14==1)&&(p152==1))&&(p154==1...264
Formula 0 simplified : G(!"((p103==0)||(p124==0))" | X((!"((p136==1)&&(p137==1))" R !"(((p22==1)&&(p152==1))&&(p154==1))") U "(((p14==1)&&(p152==1))&&(p154...163
Detected timeout of ITS tools.
[2024-05-22 04:19:17] [INFO ] Flatten gal took : 16 ms
[2024-05-22 04:19:17] [INFO ] Applying decomposition
[2024-05-22 04:19:17] [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/graph15358361911900611058.txt' '-o' '/tmp/graph15358361911900611058.bin' '-w' '/tmp/graph15358361911900611058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15358361911900611058.bin' '-l' '-1' '-v' '-w' '/tmp/graph15358361911900611058.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:19:17] [INFO ] Decomposing Gal with order
[2024-05-22 04:19:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:19:18] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-22 04:19:18] [INFO ] Flatten gal took : 19 ms
[2024-05-22 04:19:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 4 ms.
[2024-05-22 04:19:18] [INFO ] Time to serialize gal into /tmp/LTL17046030708777525683.gal : 4 ms
[2024-05-22 04:19:18] [INFO ] Time to serialize properties into /tmp/LTL2363676135183155605.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/LTL17046030708777525683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2363676135183155605.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 : !((F((X((!("(((i3.u13.p14==1)&&(i3.u13.p152==1))&&(i3.u14.p154==1))"))U((G(!("(((i3.u13.p14==1)&&(i3.u13.p152==1))&&(i3.u14.p154==1))"...378
Formula 0 simplified : G(!"((i0.u2.p103==0)||(i0.u2.p124==0))" | X((!"((i1.i1.u6.p136==1)&&(i1.i0.u7.p137==1))" R !"(((i3.u13.p22==1)&&(i3.u13.p152==1))&&(...235
Detected timeout of ITS tools.
Treatment of property DES-PT-30a-LTLFireability-06 finished in 379819 ms.
[2024-05-22 04:19:33] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin298498506938794173
[2024-05-22 04:19:33] [INFO ] Applying decomposition
[2024-05-22 04:19:33] [INFO ] Computing symmetric may disable matrix : 177 transitions.
[2024-05-22 04:19:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:19:33] [INFO ] Computing symmetric may enable matrix : 177 transitions.
[2024-05-22 04:19:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:19:33] [INFO ] Flatten gal took : 9 ms
[2024-05-22 04:19:33] [INFO ] Computing Do-Not-Accords matrix : 177 transitions.
[2024-05-22 04:19:33] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:19:33] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin298498506938794173
Running compilation step : cd /tmp/ltsmin298498506938794173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
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/graph5285719050587281983.txt' '-o' '/tmp/graph5285719050587281983.bin' '-w' '/tmp/graph5285719050587281983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5285719050587281983.bin' '-l' '-1' '-v' '-w' '/tmp/graph5285719050587281983.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:19:33] [INFO ] Decomposing Gal with order
[2024-05-22 04:19:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:19:33] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 04:19:33] [INFO ] Flatten gal took : 14 ms
[2024-05-22 04:19:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 04:19:33] [INFO ] Time to serialize gal into /tmp/LTLFireability1825312124171479770.gal : 3 ms
[2024-05-22 04:19:33] [INFO ] Time to serialize properties into /tmp/LTLFireability6374309607473231641.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/LTLFireability1825312124171479770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6374309607473231641.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...276
Read 1 LTL properties
Checking formula 0 : !((F(("((i0.u2.p103==0)||(i0.u2.p124==0))")&&(X((!("(((u14.p14==1)&&(u14.p152==1))&&(u14.p154==1))"))U((G(!("(((u14.p14==1)&&(u14.p152...342
Formula 0 simplified : G(!"((i0.u2.p103==0)||(i0.u2.p124==0))" | X((!"((i1.i1.u6.p136==1)&&(i1.i0.u7.p137==1))" R !"(((u14.p22==1)&&(u14.p152==1))&&(u14.p1...217
Compilation finished in 463 ms.
Running link step : cd /tmp/ltsmin298498506938794173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin298498506938794173;'/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' '--ltl' '<>(((LTLAPp0==true)&&X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&((LTLAPp2==true) U (LTLAPp3==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t136, t137, t170, u13.t129, u14.t11, u48.t5, u48.t40, i0.u2.t8, i0.u2.t70, i0.u2.t74, i0....639
Computing Next relation with stutter on 2.19322e+06 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.019: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.023: LTL layer: formula: <>(((LTLAPp0==true)&&X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&((LTLAPp2==true) U (LTLAPp3==true))))))))
pins2lts-mc-linux64( 3/ 8), 0.023: "<>(((LTLAPp0==true)&&X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&((LTLAPp2==true) U (LTLAPp3==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.023: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.080: There are 182 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.080: State length is 234, there are 203 groups
pins2lts-mc-linux64( 0/ 8), 0.080: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.080: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.080: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.081: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.101: [Blue] ~37 levels ~960 states ~2968 transitions
pins2lts-mc-linux64( 0/ 8), 0.123: [Blue] ~60 levels ~1920 states ~6184 transitions
pins2lts-mc-linux64( 0/ 8), 0.149: [Blue] ~60 levels ~3840 states ~14656 transitions
pins2lts-mc-linux64( 0/ 8), 0.201: [Blue] ~60 levels ~7680 states ~34152 transitions
pins2lts-mc-linux64( 0/ 8), 0.308: [Blue] ~60 levels ~15360 states ~72648 transitions
pins2lts-mc-linux64( 0/ 8), 0.479: [Blue] ~60 levels ~30720 states ~160072 transitions
pins2lts-mc-linux64( 7/ 8), 0.835: [Blue] ~61 levels ~61440 states ~318536 transitions
pins2lts-mc-linux64( 0/ 8), 1.442: [Blue] ~60 levels ~122880 states ~769184 transitions
pins2lts-mc-linux64( 2/ 8), 2.483: [Blue] ~502 levels ~245760 states ~1397136 transitions
pins2lts-mc-linux64( 2/ 8), 4.131: [Blue] ~671 levels ~491520 states ~2695368 transitions
pins2lts-mc-linux64( 5/ 8), 6.583: [Blue] ~1275 levels ~983040 states ~5160816 transitions
pins2lts-mc-linux64( 2/ 8), 11.266: [Blue] ~1492 levels ~1966080 states ~10424432 transitions
pins2lts-mc-linux64( 5/ 8), 21.755: [Blue] ~2054 levels ~3932160 states ~21839936 transitions
pins2lts-mc-linux64( 5/ 8), 41.679: [Blue] ~2054 levels ~7864320 states ~46176256 transitions
pins2lts-mc-linux64( 5/ 8), 79.087: [Blue] ~2054 levels ~15728640 states ~97520368 transitions
pins2lts-mc-linux64( 5/ 8), 156.896: [Blue] ~2750 levels ~31457280 states ~207177144 transitions
pins2lts-mc-linux64( 4/ 8), 303.596: [Blue] ~2981 levels ~62914560 states ~416426304 transitions
pins2lts-mc-linux64( 4/ 8), 622.897: [Blue] ~2981 levels ~125829120 states ~894041816 transitions
pins2lts-mc-linux64( 5/ 8), 735.259: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 735.333:
pins2lts-mc-linux64( 0/ 8), 735.333: Explored 135032678 states 1016958142 transitions, fanout: 7.531
pins2lts-mc-linux64( 0/ 8), 735.333: Total exploration time 735.240 sec (735.150 sec minimum, 735.199 sec on average)
pins2lts-mc-linux64( 0/ 8), 735.333: States per second: 183658, Transitions per second: 1383165
pins2lts-mc-linux64( 0/ 8), 735.333:
pins2lts-mc-linux64( 0/ 8), 735.333: State space has 134217330 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 735.333: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 735.334: blue states: 135032678 (100.61%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 735.334: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 735.334: all-red states: 5554038 (4.14%), bogus 9020 (0.01%)
pins2lts-mc-linux64( 0/ 8), 735.334:
pins2lts-mc-linux64( 0/ 8), 735.334: Total memory used for local state coloring: 0.6MB
pins2lts-mc-linux64( 0/ 8), 735.334:
pins2lts-mc-linux64( 0/ 8), 735.334: Queue width: 8B, total height: 37240, memory: 0.28MB
pins2lts-mc-linux64( 0/ 8), 735.334: Tree memory: 1039.8MB, 8.1 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 735.334: Tree fill ratio (roots/leafs): 99.0%/6.0%
pins2lts-mc-linux64( 0/ 8), 735.334: Stored 177 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 735.334: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 735.334: Est. total memory use: 1040.1MB (~1024.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin298498506938794173;'/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' '--ltl' '<>(((LTLAPp0==true)&&X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&((LTLAPp2==true) U (LTLAPp3==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin298498506938794173;'/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' '--ltl' '<>(((LTLAPp0==true)&&X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&((LTLAPp2==true) U (LTLAPp3==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-22 04:35:30] [INFO ] Applying decomposition
[2024-05-22 04:35:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 04:35:30] [INFO ] Decomposing Gal with order
[2024-05-22 04:35:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:35:30] [INFO ] Removed a total of 221 redundant transitions.
[2024-05-22 04:35:30] [INFO ] Flatten gal took : 18 ms
[2024-05-22 04:35:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 4 ms.
[2024-05-22 04:35:30] [INFO ] Time to serialize gal into /tmp/LTLFireability5225185702784681506.gal : 3 ms
[2024-05-22 04:35:30] [INFO ] Time to serialize properties into /tmp/LTLFireability2922023900450486354.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/LTLFireability5225185702784681506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2922023900450486354.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...276
Read 1 LTL properties
Checking formula 0 : !((F(("((u4.p103==0)||(u7.p124==0))")&&(X((!("(((u1.p14==1)&&(u20.p152==1))&&(u21.p154==1))"))U((G(!("(((u1.p14==1)&&(u20.p152==1))&&(...322
Formula 0 simplified : G(!"((u4.p103==0)||(u7.p124==0))" | X((!"((u12.p136==1)&&(u13.p137==1))" R !"(((u1.p22==1)&&(u20.p152==1))&&(u21.p154==1))") U "(((u...199

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-30a"
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-30a, 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-171624189800700"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30a.tgz
mv DES-PT-30a 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 ;