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-171624189900740.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-50b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189900740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K 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 53K 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.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 204K Apr 12 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 08:05 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 127K 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-50b-LTLFireability-00
FORMULA_NAME DES-PT-50b-LTLFireability-01
FORMULA_NAME DES-PT-50b-LTLFireability-02
FORMULA_NAME DES-PT-50b-LTLFireability-03
FORMULA_NAME DES-PT-50b-LTLFireability-04
FORMULA_NAME DES-PT-50b-LTLFireability-05
FORMULA_NAME DES-PT-50b-LTLFireability-06
FORMULA_NAME DES-PT-50b-LTLFireability-07
FORMULA_NAME DES-PT-50b-LTLFireability-08
FORMULA_NAME DES-PT-50b-LTLFireability-09
FORMULA_NAME DES-PT-50b-LTLFireability-10
FORMULA_NAME DES-PT-50b-LTLFireability-11
FORMULA_NAME DES-PT-50b-LTLFireability-12
FORMULA_NAME DES-PT-50b-LTLFireability-13
FORMULA_NAME DES-PT-50b-LTLFireability-14
FORMULA_NAME DES-PT-50b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716359294203

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-50b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 06:28:15] [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 06:28:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:28:15] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-22 06:28:15] [INFO ] Transformed 479 places.
[2024-05-22 06:28:15] [INFO ] Transformed 430 transitions.
[2024-05-22 06:28:15] [INFO ] Found NUPN structural information;
[2024-05-22 06:28:15] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-50b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 430/430 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 476 transition count 430
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 453 transition count 407
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 453 transition count 407
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 441 transition count 395
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 441 transition count 395
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 441 transition count 387
Applied a total of 81 rules in 114 ms. Remains 441 /479 variables (removed 38) and now considering 387/430 (removed 43) transitions.
// Phase 1: matrix 387 rows 441 cols
[2024-05-22 06:28:15] [INFO ] Computed 62 invariants in 42 ms
[2024-05-22 06:28:16] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-22 06:28:16] [INFO ] Invariant cache hit.
[2024-05-22 06:28:16] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2024-05-22 06:28:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 386 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 387/828 variables, 441/503 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-22 06:28:26] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 27 ms to minimize.
[2024-05-22 06:28:27] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-22 06:28:27] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:28:27] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-22 06:28:30] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 5/508 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-22 06:28:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-22 06:28:39] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:28:39] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-22 06:28:39] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-22 06:28:40] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-22 06:28:40] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:28:40] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:28:40] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:28:40] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:28:40] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
[2024-05-22 06:28:40] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-22 06:28:40] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:28:40] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:28:41] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:28:41] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 3 ms to minimize.
[2024-05-22 06:28:41] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:28:41] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:28:41] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:28:41] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-22 06:28:41] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-05-22 06:28:41] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 20/529 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/828 variables, and 529 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 441/441 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 26/88 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-22 06:28:50] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:28:50] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:28:50] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:28:50] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:28:51] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:28:51] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:28:51] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-22 06:28:51] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 3 ms to minimize.
[2024-05-22 06:28:51] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:28:52] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:28:52] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:28:52] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:28:52] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:28:52] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2024-05-22 06:28:52] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:28:52] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:28:52] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 17/105 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-05-22 06:28:55] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:28:55] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-22 06:28:55] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-22 06:28:56] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-05-22 06:28:56] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-22 06:28:56] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:28:56] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:28:56] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:28:56] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-22 06:28:57] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:28:57] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 8 (OVERLAPS) 387/828 variables, 441/557 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/828 variables, 386/943 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/828 variables, and 943 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 441/441 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 54/54 constraints]
After SMT, in 60343ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Starting structural reductions in LTL mode, iteration 1 : 441/479 places, 387/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61529 ms. Remains : 441/479 places, 387/430 transitions.
Support contains 32 out of 441 places after structural reductions.
[2024-05-22 06:29:17] [INFO ] Flatten gal took : 66 ms
[2024-05-22 06:29:17] [INFO ] Flatten gal took : 31 ms
[2024-05-22 06:29:17] [INFO ] Input system was already deterministic with 387 transitions.
RANDOM walk for 40000 steps (326 resets) in 1495 ms. (26 steps per ms) remains 14/25 properties
BEST_FIRST walk for 40004 steps (47 resets) in 200 ms. (199 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (60 resets) in 155 ms. (256 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (50 resets) in 165 ms. (240 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (63 resets) in 131 ms. (303 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (62 resets) in 159 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (49 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (49 resets) in 176 ms. (226 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (49 resets) in 71 ms. (555 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (49 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (50 resets) in 106 ms. (373 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (49 resets) in 185 ms. (215 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (50 resets) in 249 ms. (160 steps per ms) remains 14/14 properties
[2024-05-22 06:29:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 21/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 143/180 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 242/422 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 4/426 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 374/800 variables, 426/488 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:29:19] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-22 06:29:19] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:29:20] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 23 ms to minimize.
[2024-05-22 06:29:20] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 5 ms to minimize.
[2024-05-22 06:29:20] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/800 variables, 5/493 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:29:20] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/800 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:29:21] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/800 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:29:21] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:29:21] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:29:21] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-22 06:29:21] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:29:21] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/800 variables, 5/500 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:29:22] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/800 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/800 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 18/818 variables, 10/511 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:29:23] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-22 06:29:23] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:29:23] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-22 06:29:23] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/818 variables, 4/515 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/828 variables, and 515 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 436/441 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 21/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 143/180 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 242/422 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:29:24] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 4/426 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 374/800 variables, 426/506 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/800 variables, 14/520 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:29:26] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:29:26] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/800 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:29:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:29:28] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 800/828 variables, and 524 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 426/441 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 22/22 constraints]
After SMT, in 10063ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 435 transition count 369
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 422 transition count 369
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 422 transition count 357
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 410 transition count 357
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 405 transition count 352
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 405 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 68 place count 405 transition count 347
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 403 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 71 place count 403 transition count 345
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 402 transition count 345
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 75 place count 400 transition count 343
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 400 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 79 place count 400 transition count 341
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 225 place count 327 transition count 268
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 325 transition count 270
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 325 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 324 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 323 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 233 place count 322 transition count 268
Applied a total of 233 rules in 192 ms. Remains 322 /441 variables (removed 119) and now considering 268/387 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 322/441 places, 268/387 transitions.
RANDOM walk for 40000 steps (1545 resets) in 633 ms. (63 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (284 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (319 resets) in 151 ms. (263 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (341 resets) in 173 ms. (229 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (324 resets) in 353 ms. (113 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (326 resets) in 118 ms. (336 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (324 resets) in 111 ms. (357 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (341 resets) in 102 ms. (388 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (311 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (320 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (306 resets) in 73 ms. (540 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (315 resets) in 84 ms. (470 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (318 resets) in 84 ms. (470 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (325 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (324 resets) in 78 ms. (506 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 550311 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 14
Probabilistic random walk after 550311 steps, saw 86572 distinct states, run finished after 3005 ms. (steps per millisecond=183 ) properties seen :0
// Phase 1: matrix 268 rows 322 cols
[2024-05-22 06:29:33] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 06:29:33] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 75/107 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 165/272 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/273 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 268/541 variables, 273/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:29:33] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 49/590 variables, 49/389 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/590 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 590/590 variables, and 389 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2056 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 322/322 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 75/107 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 165/272 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/273 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 268/541 variables, 273/334 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 13/353 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 49/590 variables, 49/402 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/590 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:29:46] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-22 06:29:46] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-22 06:29:47] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-22 06:29:47] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-22 06:29:48] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:29:48] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-22 06:29:48] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:29:48] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:29:48] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/590 variables, 9/412 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:29:53] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-22 06:29:53] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:29:54] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/590 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:29:59] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:29:59] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:29:59] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:29:59] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/590 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/590 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 0/590 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 590/590 variables, and 419 constraints, problems are : Problem set: 0 solved, 14 unsolved in 40669 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 322/322 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 17/17 constraints]
After SMT, in 42767ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 34898 ms.
Support contains 16 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 268/268 transitions.
Applied a total of 0 rules in 18 ms. Remains 322 /322 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 322/322 places, 268/268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 268/268 transitions.
Applied a total of 0 rules in 12 ms. Remains 322 /322 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-05-22 06:30:50] [INFO ] Invariant cache hit.
[2024-05-22 06:30:51] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 06:30:51] [INFO ] Invariant cache hit.
[2024-05-22 06:30:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 06:30:51] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2024-05-22 06:30:51] [INFO ] Redundant transitions in 14 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-22 06:30:51] [INFO ] Invariant cache hit.
[2024-05-22 06:30:51] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 3/322 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 268/590 variables, 322/382 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 6/388 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:31:02] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (OVERLAPS) 0/590 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 590/590 variables, and 389 constraints, problems are : Problem set: 0 solved, 265 unsolved in 20580 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 322/322 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 3/322 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 268/590 variables, 322/383 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 265/654 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:31:26] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:31:27] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-22 06:31:27] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:31:27] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-22 06:31:36] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:31:38] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/590 variables, and 660 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 322/322 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 7/7 constraints]
After SMT, in 50791ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 50796ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51303 ms. Remains : 322/322 places, 268/268 transitions.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.21 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 436 transition count 382
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 436 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 436 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 433 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 433 transition count 373
Applied a total of 22 rules in 39 ms. Remains 433 /441 variables (removed 8) and now considering 373/387 (removed 14) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:31:42] [INFO ] Computed 62 invariants in 13 ms
[2024-05-22 06:31:42] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-22 06:31:42] [INFO ] Invariant cache hit.
[2024-05-22 06:31:43] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:31:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 3 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:31:55] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:31:55] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:31:55] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:31:59] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:32:02] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 3 ms to minimize.
[2024-05-22 06:32:03] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-22 06:32:03] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:32:03] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-22 06:32:04] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-22 06:32:04] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:32:16] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:32:16] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:32:16] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:32:16] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:32:16] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-05-22 06:32:16] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:32:17] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:32:17] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:32:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:32:17] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:32:17] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:32:17] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
[2024-05-22 06:32:17] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:32:18] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:32:18] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:32:18] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:32:18] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:32:18] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:32:18] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:32:18] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:32:18] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-22 06:32:18] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-22 06:32:18] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2024-05-22 06:32:18] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:32:19] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:32:19] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:32:19] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:32:19] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 3 ms to minimize.
[2024-05-22 06:32:19] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:32:19] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:32:19] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:32:19] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:32:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-05-22 06:32:22] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:32:23] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:32:23] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:32:23] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:32:23] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:32:23] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:32:26] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-22 06:32:26] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:32:27] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:32:30] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Starting structural reductions in LTL mode, iteration 1 : 433/441 places, 373/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60982 ms. Remains : 433/441 places, 373/387 transitions.
Stuttering acceptance computed with spot in 314 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA DES-PT-50b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-00 finished in 61364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((X(p0)||p1))) U p0))'
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 436 transition count 382
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 436 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 436 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 433 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 433 transition count 373
Applied a total of 22 rules in 23 ms. Remains 433 /441 variables (removed 8) and now considering 373/387 (removed 14) transitions.
[2024-05-22 06:32:43] [INFO ] Invariant cache hit.
[2024-05-22 06:32:43] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 06:32:43] [INFO ] Invariant cache hit.
[2024-05-22 06:32:44] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:32:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:32:51] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-22 06:32:51] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:32:51] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:32:51] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:32:51] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-22 06:32:52] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-22 06:32:52] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-22 06:32:52] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:32:52] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:32:52] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:32:52] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:32:52] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-22 06:32:52] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:32:53] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:32:53] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:32:53] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:32:53] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-22 06:32:53] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:32:53] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:32:54] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:32:56] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-22 06:32:56] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:32:57] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:33:00] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:33:04] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-22 06:33:04] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-22 06:33:05] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-05-22 06:33:05] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
[2024-05-22 06:33:05] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:33:05] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:33:17] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:33:18] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:33:18] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:33:18] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:33:18] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:33:18] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:33:18] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:33:18] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-22 06:33:18] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 06:33:18] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-22 06:33:19] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:33:19] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:33:19] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:33:19] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:33:19] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:33:19] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-05-22 06:33:19] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:33:19] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:33:19] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:33:19] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:33:20] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:33:20] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:33:20] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:33:20] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:33:20] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:33:20] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:33:20] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:33:20] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:33:20] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:33:20] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:33:20] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:33:20] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:33:20] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:33:23] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:33:24] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:33:24] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:33:25] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:33:25] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:33:25] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:33:27] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:33:28] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:33:28] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:33:31] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60225ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Starting structural reductions in LTL mode, iteration 1 : 433/441 places, 373/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60980 ms. Remains : 433/441 places, 373/387 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : DES-PT-50b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-01 finished in 61208 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 ((X(G(p1)) U p2)||(p0 U p1))))'
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 438 transition count 384
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 438 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 438 transition count 382
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 436 transition count 380
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 436 transition count 380
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 436 transition count 378
Applied a total of 14 rules in 20 ms. Remains 436 /441 variables (removed 5) and now considering 378/387 (removed 9) transitions.
// Phase 1: matrix 378 rows 436 cols
[2024-05-22 06:33:44] [INFO ] Computed 62 invariants in 14 ms
[2024-05-22 06:33:45] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 06:33:45] [INFO ] Invariant cache hit.
[2024-05-22 06:33:45] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2024-05-22 06:33:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 377 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/814 variables, 436/498 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:33:54] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-22 06:33:55] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:33:55] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 3 ms to minimize.
[2024-05-22 06:33:55] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 06:33:55] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:33:55] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:33:55] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:33:55] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:33:55] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:33:55] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-22 06:33:56] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2024-05-22 06:33:56] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:33:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:33:56] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-22 06:33:56] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-05-22 06:33:56] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-22 06:33:56] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:33:56] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:33:56] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:33:56] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/814 variables, 20/518 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:33:57] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:33:58] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-22 06:33:58] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:33:58] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-22 06:33:59] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:33:59] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:34:01] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:34:01] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 3 ms to minimize.
[2024-05-22 06:34:02] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/814 variables, 9/527 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:34:08] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/814 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:34:12] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 814/814 variables, and 529 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 31/93 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:34:19] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:34:19] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-22 06:34:19] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:34:20] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:34:20] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-22 06:34:20] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:34:20] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:34:20] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 06:34:22] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:34:22] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 10/103 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:34:22] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:34:23] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:34:23] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:34:23] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:34:23] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:34:23] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:34:24] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (OVERLAPS) 378/814 variables, 436/546 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/814 variables, 377/923 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 814/814 variables, and 923 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 48/48 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Starting structural reductions in LTL mode, iteration 1 : 436/441 places, 378/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61014 ms. Remains : 436/441 places, 378/387 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), true, (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-50b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-50b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-02 finished in 61175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 434 transition count 372
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 423 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 422 transition count 371
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 25 place count 422 transition count 359
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 49 place count 410 transition count 359
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 53 place count 406 transition count 355
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 406 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 406 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 405 transition count 352
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 61 place count 405 transition count 351
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 63 place count 404 transition count 351
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 65 place count 402 transition count 349
Iterating global reduction 5 with 2 rules applied. Total rules applied 67 place count 402 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 69 place count 402 transition count 347
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 221 place count 326 transition count 271
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 225 place count 324 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 229 place count 324 transition count 272
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 231 place count 322 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 232 place count 321 transition count 270
Applied a total of 232 rules in 98 ms. Remains 321 /441 variables (removed 120) and now considering 270/387 (removed 117) transitions.
// Phase 1: matrix 270 rows 321 cols
[2024-05-22 06:34:46] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 06:34:46] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 06:34:46] [INFO ] Invariant cache hit.
[2024-05-22 06:34:46] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-05-22 06:34:46] [INFO ] Redundant transitions in 14 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-22 06:34:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 1/318 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 2/320 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 270/590 variables, 320/378 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:34:57] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:34:57] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:34:57] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:34:57] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 4/382 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 1/591 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:35:08] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/591 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:35:15] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/591 variables, and 385 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 1/318 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 2/320 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 270/590 variables, 320/384 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 266/650 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:35:42] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/591 variables, and 651 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/321 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 7/7 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Starting structural reductions in SI_LTL mode, iteration 1 : 321/441 places, 270/387 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60830 ms. Remains : 321/441 places, 270/387 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-03
Product exploration explored 100000 steps with 5607 reset in 297 ms.
Product exploration explored 100000 steps with 5604 reset in 262 ms.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 137 steps (4 resets) in 6 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 270/270 transitions.
Applied a total of 0 rules in 11 ms. Remains 321 /321 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-22 06:35:48] [INFO ] Invariant cache hit.
[2024-05-22 06:35:48] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 06:35:48] [INFO ] Invariant cache hit.
[2024-05-22 06:35:48] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2024-05-22 06:35:48] [INFO ] Redundant transitions in 1 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-22 06:35:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 1/318 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 2/320 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 270/590 variables, 320/378 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:35:59] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:35:59] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:35:59] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:35:59] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 4/382 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 1/591 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:36:10] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/591 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:36:17] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/591 variables, and 385 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 1/318 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 2/320 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 270/590 variables, 320/384 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 266/650 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:36:43] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/591 variables, and 651 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/321 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 7/7 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60780 ms. Remains : 321/321 places, 270/270 transitions.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 61 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5567 reset in 218 ms.
Product exploration explored 100000 steps with 5573 reset in 235 ms.
Built C files in :
/tmp/ltsmin8484822659470236457
[2024-05-22 06:36:49] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2024-05-22 06:36:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:36:49] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2024-05-22 06:36:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:36:49] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2024-05-22 06:36:49] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:36:50] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8484822659470236457
Running compilation step : cd /tmp/ltsmin8484822659470236457;'/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 830 ms.
Running link step : cd /tmp/ltsmin8484822659470236457;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin8484822659470236457;'/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/stateBased17710780125799599275.hoa' '--buchi-type=spotba'
LTSmin run took 4586 ms.
FORMULA DES-PT-50b-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50b-LTLFireability-03 finished in 129389 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(p0) U (p1 U X(p2))))'
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 437 transition count 383
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 437 transition count 383
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 437 transition count 380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 435 transition count 378
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 435 transition count 376
Applied a total of 17 rules in 22 ms. Remains 435 /441 variables (removed 6) and now considering 376/387 (removed 11) transitions.
// Phase 1: matrix 376 rows 435 cols
[2024-05-22 06:36:55] [INFO ] Computed 62 invariants in 15 ms
[2024-05-22 06:36:55] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-22 06:36:55] [INFO ] Invariant cache hit.
[2024-05-22 06:36:56] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-05-22 06:36:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 376/811 variables, 435/497 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:02] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-22 06:37:03] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:37:03] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:37:03] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:37:03] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:37:03] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:37:03] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:37:03] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:37:04] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:37:04] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:37:04] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:37:04] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:37:04] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:37:05] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:37:05] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-05-22 06:37:05] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
[2024-05-22 06:37:05] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 17/514 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:10] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:37:10] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:37:12] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:37:12] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:37:13] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:37:14] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-05-22 06:37:14] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 3 ms to minimize.
[2024-05-22 06:37:14] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-22 06:37:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:37:15] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 1 ms to minimize.
[2024-05-22 06:37:15] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 11/525 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:21] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/811 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:25] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-22 06:37:25] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 528 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 31/93 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:29] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:37:29] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-22 06:37:29] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:37:29] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:37] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:37:37] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-05-22 06:37:37] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:37:38] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-22 06:37:38] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:41] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 10 (OVERLAPS) 376/811 variables, 435/562 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/811 variables, 375/937 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/811 variables, and 937 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 65/65 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Starting structural reductions in LTL mode, iteration 1 : 435/441 places, 376/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61046 ms. Remains : 435/441 places, 376/387 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-05 finished in 61355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 434 transition count 371
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 422 transition count 371
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 422 transition count 359
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 410 transition count 359
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 405 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 405 transition count 354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 64 place count 405 transition count 349
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 67 place count 403 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 67 place count 403 transition count 347
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 402 transition count 347
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 71 place count 400 transition count 345
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 400 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 75 place count 400 transition count 343
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 227 place count 324 transition count 267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 231 place count 322 transition count 269
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 320 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 319 transition count 267
Applied a total of 234 rules in 70 ms. Remains 319 /441 variables (removed 122) and now considering 267/387 (removed 120) transitions.
// Phase 1: matrix 267 rows 319 cols
[2024-05-22 06:37:56] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 06:37:57] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 06:37:57] [INFO ] Invariant cache hit.
[2024-05-22 06:37:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 06:37:57] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2024-05-22 06:37:57] [INFO ] Redundant transitions in 1 ms returned []
Running 264 sub problems to find dead transitions.
[2024-05-22 06:37:57] [INFO ] Invariant cache hit.
[2024-05-22 06:37:57] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 1/317 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 1/318 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 264 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 267/585 variables, 318/376 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 6/382 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 06:38:07] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:38:08] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 06:38:11] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 06:38:14] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 06:38:18] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/585 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 14 (OVERLAPS) 1/586 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 06:38:24] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:38:24] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/586 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/586 variables, and 390 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/319 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 1/317 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 1/318 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 267/585 variables, 318/383 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 264/653 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 06:38:44] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/586 variables, and 654 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/319 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 8/8 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Starting structural reductions in SI_LTL mode, iteration 1 : 319/441 places, 267/387 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60829 ms. Remains : 319/441 places, 267/387 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-06
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-06 finished in 60912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 434 transition count 371
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 422 transition count 371
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 422 transition count 358
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 409 transition count 358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 404 transition count 353
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 404 transition count 353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 66 place count 404 transition count 348
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 402 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 69 place count 402 transition count 346
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 401 transition count 346
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 73 place count 399 transition count 344
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 399 transition count 344
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 399 transition count 342
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 229 place count 323 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 233 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 318 transition count 266
Applied a total of 236 rules in 74 ms. Remains 318 /441 variables (removed 123) and now considering 266/387 (removed 121) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 06:38:57] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 06:38:58] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-22 06:38:58] [INFO ] Invariant cache hit.
[2024-05-22 06:38:58] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-05-22 06:38:58] [INFO ] Redundant transitions in 0 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 06:38:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/316 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/317 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 266/583 variables, 317/375 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:39:07] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-22 06:39:07] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:39:10] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:39:10] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:39:13] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/583 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/583 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 13 (OVERLAPS) 1/584 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/584 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:39:21] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:39:21] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:39:22] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/584 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/584 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/584 variables, and 384 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/316 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 1/317 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 266/583 variables, 317/383 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/583 variables, 263/646 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/584 variables, and 646 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 8/8 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Starting structural reductions in SI_LTL mode, iteration 1 : 318/441 places, 266/387 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60832 ms. Remains : 318/441 places, 266/387 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50b-LTLFireability-08
Product exploration explored 100000 steps with 5154 reset in 283 ms.
Product exploration explored 100000 steps with 5164 reset in 282 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 278 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2103 resets) in 593 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (384 resets) in 306 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (404 resets) in 306 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (407 resets) in 386 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (379 resets) in 388 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (391 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (382 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 614972 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 6
Probabilistic random walk after 614972 steps, saw 87575 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
[2024-05-22 06:40:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/67 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 177/244 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 5/249 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 6/255 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 211/466 variables, 255/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 14/480 variables, 9/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/480 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 54/534 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 50/584 variables, 50/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/584 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/584 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 376 constraints, problems are : Problem set: 0 solved, 6 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/67 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 177/244 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 06:40:04] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 5/249 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 6/255 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf0 is UNSAT
At refinement iteration 12 (OVERLAPS) 211/466 variables, 255/310 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 5/315 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 14/480 variables, 9/324 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 3/327 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/327 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 54/534 variables, 4/331 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/534 variables, 1/332 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 50/584 variables, 50/382 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/584 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/584 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 584/584 variables, and 382 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1855 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 2408ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 12318 ms.
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 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 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 317 transition count 264
Applied a total of 4 rules in 31 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 317/318 places, 264/266 transitions.
RANDOM walk for 40000 steps (1968 resets) in 506 ms. (78 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (389 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (372 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (387 resets) in 290 ms. (137 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (373 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (359 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 661650 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 5
Probabilistic random walk after 661650 steps, saw 93986 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 06:40:21] [INFO ] Computed 59 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 59/67 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 177/244 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 9/253 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/255 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 14/478 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 54/532 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 49/581 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/581 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/581 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 376 constraints, problems are : Problem set: 0 solved, 5 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 59/67 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 177/244 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 9/253 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/255 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 14/478 variables, 8/323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 54/532 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 49/581 variables, 49/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 381 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1079 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1554ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6039 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 13 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 6 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 06:40:29] [INFO ] Invariant cache hit.
[2024-05-22 06:40:29] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-22 06:40:29] [INFO ] Invariant cache hit.
[2024-05-22 06:40:29] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-05-22 06:40:29] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 06:40:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 1/315 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/316 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 264/580 variables, 316/375 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 06:40:38] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:40:38] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:40:38] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 06:40:41] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-22 06:40:41] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:40:41] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:40:42] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 4/382 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (OVERLAPS) 1/581 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 06:40:49] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:40:50] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/581 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 16 (OVERLAPS) 0/581 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 385 constraints, problems are : Problem set: 0 solved, 261 unsolved in 29089 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 1/315 variables, 25/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/316 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 264/580 variables, 316/384 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 261/645 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/581 variables, and 645 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 9/9 constraints]
After SMT, in 59288ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 59290ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59796 ms. Remains : 317/317 places, 264/264 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 317 transition count 264
Applied a total of 1 rules in 13 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 06:41:28] [INFO ] Computed 59 invariants in 6 ms
[2024-05-22 06:41:29] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 06:41:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 06:41:29] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 21 ms returned sat
[2024-05-22 06:41:29] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-22 06:41:29] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:41:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
TRAPS : Iteration 1
[2024-05-22 06:41:29] [INFO ] After 598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-22 06:41:29] [INFO ] After 846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 968 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 189 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50b-LTLFireability-08 finished in 152345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 434 transition count 371
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 422 transition count 371
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 422 transition count 358
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 409 transition count 358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 404 transition count 353
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 404 transition count 353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 66 place count 404 transition count 348
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 402 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 69 place count 402 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 401 transition count 346
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 73 place count 399 transition count 344
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 399 transition count 344
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 399 transition count 342
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 225 place count 325 transition count 268
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 323 transition count 270
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 321 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 232 place count 320 transition count 268
Applied a total of 232 rules in 47 ms. Remains 320 /441 variables (removed 121) and now considering 268/387 (removed 119) transitions.
// Phase 1: matrix 268 rows 320 cols
[2024-05-22 06:41:30] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 06:41:30] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 06:41:30] [INFO ] Invariant cache hit.
[2024-05-22 06:41:30] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-22 06:41:30] [INFO ] Redundant transitions in 1 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-22 06:41:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 1/318 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 265 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/319 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 268/587 variables, 319/377 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:41:38] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:41:39] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:41:39] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:41:39] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:41:39] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:41:40] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 6/383 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:41:42] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:41:46] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:41:46] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:41:46] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:41:47] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:41:47] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:41:49] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:41:53] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:41:53] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:41:53] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 15 (OVERLAPS) 1/588 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 (/ 1.0 2.0))
(s20 (/ 1.0 2.0))
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 (/ 1.0 2.0))
(s207 (/ 1.0 2.0))
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 (/ 1.0 2.0))
(s245 (/ 1.0 2.0))
(s246 0.0)
(s247 1.0)
(s248 (/ 1.0 2.0))
(s249 (/ 1.0 2.0))
(s250 (/ 1.0 2.0))
(s251 (/ 1.0 2.0))
(s252 (/ 1.0 2.0))
(s253 (/ 1.0 2.0))
(s254 0.0)
(s255 1.0)
(s256 (/ 1.0 2.0))
(s257 (/ 1.0 2.0))
(s258 (/ 1.0 2.0))
(s259 (/ 1.0 2.0))
(s260 0.0)
(s261 1.0)
(s262 (/ 1.0 2.0))
(s263 (/ 1.0 2.0))
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 (/ 1.0 2.0))
(s271 (/ 1.0 2.0))
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/588 variables, and 394 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 1/318 variables, 25/51 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 11 (OVERLAPS) 268/587 variables, 319/393 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 265/658 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/588 variables, and 658 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/320 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 16/16 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Starting structural reductions in SI_LTL mode, iteration 1 : 320/441 places, 268/387 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60828 ms. Remains : 320/441 places, 268/387 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50b-LTLFireability-09
Product exploration explored 100000 steps with 6858 reset in 204 ms.
Product exploration explored 100000 steps with 6856 reset in 234 ms.
Computed a total of 217 stabilizing places and 212 stable transitions
Computed a total of 217 stabilizing places and 212 stable transitions
Detected a total of 217/320 stabilizing places and 212/268 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 416 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 6679 steps (309 resets) in 22 ms. (290 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 545 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 268/268 transitions.
Applied a total of 0 rules in 10 ms. Remains 320 /320 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-05-22 06:42:32] [INFO ] Invariant cache hit.
[2024-05-22 06:42:32] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 06:42:32] [INFO ] Invariant cache hit.
[2024-05-22 06:42:33] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-05-22 06:42:33] [INFO ] Redundant transitions in 3 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-22 06:42:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 1/318 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 265 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/319 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 268/587 variables, 319/377 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:42:40] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:42:41] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:42:41] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:42:42] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:42:42] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:42:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 6/383 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:42:45] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:42:49] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:42:49] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:42:49] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:42:50] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:42:50] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:42:52] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:42:55] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:42:55] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:42:56] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 15 (OVERLAPS) 1/588 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/588 variables, and 394 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 1/318 variables, 25/51 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 11 (OVERLAPS) 268/587 variables, 319/393 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 265/658 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/588 variables, and 658 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/320 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 16/16 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60222ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60795 ms. Remains : 320/320 places, 268/268 transitions.
Computed a total of 217 stabilizing places and 212 stable transitions
Computed a total of 217 stabilizing places and 212 stable transitions
Detected a total of 217/320 stabilizing places and 212/268 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 332 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 5577 steps (259 resets) in 22 ms. (242 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 537 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6943 reset in 204 ms.
Product exploration explored 100000 steps with 6928 reset in 227 ms.
Built C files in :
/tmp/ltsmin4484042883653526317
[2024-05-22 06:43:35] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2024-05-22 06:43:35] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:43:35] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2024-05-22 06:43:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:43:35] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2024-05-22 06:43:35] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:43:35] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4484042883653526317
Running compilation step : cd /tmp/ltsmin4484042883653526317;'/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 666 ms.
Running link step : cd /tmp/ltsmin4484042883653526317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4484042883653526317;'/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/stateBased15246834159588127938.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 268/268 transitions.
Applied a total of 0 rules in 10 ms. Remains 320 /320 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-05-22 06:43:50] [INFO ] Invariant cache hit.
[2024-05-22 06:43:50] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 06:43:50] [INFO ] Invariant cache hit.
[2024-05-22 06:43:50] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-05-22 06:43:50] [INFO ] Redundant transitions in 1 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-22 06:43:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 1/318 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 265 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/319 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 268/587 variables, 319/377 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:43:58] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:44:00] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 6/383 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:44:03] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:44:06] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 3 ms to minimize.
[2024-05-22 06:44:07] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 5 ms to minimize.
[2024-05-22 06:44:07] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:44:08] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:44:08] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:44:09] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-22 06:44:13] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:44:13] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:44:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 15 (OVERLAPS) 1/588 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/588 variables, and 394 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 1/318 variables, 25/51 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 11 (OVERLAPS) 268/587 variables, 319/393 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 265/658 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/588 variables, and 658 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/320 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 16/16 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60781 ms. Remains : 320/320 places, 268/268 transitions.
Built C files in :
/tmp/ltsmin5443315147256536353
[2024-05-22 06:44:51] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2024-05-22 06:44:51] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:44:51] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2024-05-22 06:44:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:44:51] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2024-05-22 06:44:51] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:44:51] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5443315147256536353
Running compilation step : cd /tmp/ltsmin5443315147256536353;'/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 680 ms.
Running link step : cd /tmp/ltsmin5443315147256536353;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5443315147256536353;'/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/stateBased14504327429929688260.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 06:45:06] [INFO ] Flatten gal took : 37 ms
[2024-05-22 06:45:06] [INFO ] Flatten gal took : 21 ms
[2024-05-22 06:45:06] [INFO ] Time to serialize gal into /tmp/LTL6526178838827991838.gal : 7 ms
[2024-05-22 06:45:06] [INFO ] Time to serialize properties into /tmp/LTL14863466248721342158.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6526178838827991838.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1108749154001498979.hoa' '-atoms' '/tmp/LTL14863466248721342158.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/LTL14863466248721342158.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1108749154001498979.hoa
Detected timeout of ITS tools.
[2024-05-22 06:45:21] [INFO ] Flatten gal took : 34 ms
[2024-05-22 06:45:21] [INFO ] Flatten gal took : 32 ms
[2024-05-22 06:45:21] [INFO ] Time to serialize gal into /tmp/LTL8761002345641875907.gal : 4 ms
[2024-05-22 06:45:21] [INFO ] Time to serialize properties into /tmp/LTL8649679316780982769.ltl : 2 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/LTL8761002345641875907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8649679316780982769.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("((p105==1)&&(p471==1))"))||(G(F("(p346==0)"))))))
Formula 0 simplified : G(F!"((p105==1)&&(p471==1))" & FG!"(p346==0)")
Detected timeout of ITS tools.
[2024-05-22 06:45:36] [INFO ] Flatten gal took : 20 ms
[2024-05-22 06:45:36] [INFO ] Applying decomposition
[2024-05-22 06:45:36] [INFO ] Flatten gal took : 16 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/graph17834517816034371313.txt' '-o' '/tmp/graph17834517816034371313.bin' '-w' '/tmp/graph17834517816034371313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17834517816034371313.bin' '-l' '-1' '-v' '-w' '/tmp/graph17834517816034371313.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:45:36] [INFO ] Decomposing Gal with order
[2024-05-22 06:45:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:45:36] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-22 06:45:36] [INFO ] Flatten gal took : 116 ms
[2024-05-22 06:45:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 10 ms.
[2024-05-22 06:45:36] [INFO ] Time to serialize gal into /tmp/LTL5309123054607214881.gal : 5 ms
[2024-05-22 06:45:36] [INFO ] Time to serialize properties into /tmp/LTL17667439200690109377.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/LTL5309123054607214881.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17667439200690109377.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((G("((u45.p105==1)&&(u45.p471==1))"))||(G(F("(i2.i0.u13.p346==0)"))))))
Formula 0 simplified : G(F!"((u45.p105==1)&&(u45.p471==1))" & FG!"(i2.i0.u13.p346==0)")
Detected timeout of ITS tools.
Treatment of property DES-PT-50b-LTLFireability-09 finished in 261808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 434 transition count 371
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 422 transition count 371
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 422 transition count 358
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 409 transition count 358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 404 transition count 353
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 404 transition count 353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 66 place count 404 transition count 348
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 402 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 69 place count 402 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 401 transition count 346
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 73 place count 399 transition count 344
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 399 transition count 344
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 399 transition count 342
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 229 place count 323 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 233 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 318 transition count 266
Applied a total of 236 rules in 46 ms. Remains 318 /441 variables (removed 123) and now considering 266/387 (removed 121) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 06:45:51] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 06:45:52] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-22 06:45:52] [INFO ] Invariant cache hit.
[2024-05-22 06:45:52] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2024-05-22 06:45:52] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 06:45:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/316 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/317 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 266/583 variables, 317/375 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:46:01] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 4 ms to minimize.
[2024-05-22 06:46:02] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:46:04] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:46:04] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:46:07] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/583 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/583 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 13 (OVERLAPS) 1/584 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/584 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:46:15] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-22 06:46:15] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:46:16] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/584 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/584 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/584 variables, and 384 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/316 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 1/317 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 266/583 variables, 317/383 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/583 variables, 263/646 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/584 variables, and 646 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 8/8 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in SI_LTL mode, iteration 1 : 318/441 places, 266/387 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60810 ms. Remains : 318/441 places, 266/387 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-10
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-10 finished in 60907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U p1)||(p2 U X(X(X((p2||G(p3))))))))))'
Support contains 5 out of 441 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 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 434 transition count 370
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 421 transition count 370
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 421 transition count 359
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 410 transition count 359
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 406 transition count 355
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 406 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 406 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 405 transition count 352
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 61 place count 405 transition count 351
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 404 transition count 351
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 402 transition count 349
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 402 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 69 place count 402 transition count 347
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 211 place count 331 transition count 276
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 329 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 219 place count 329 transition count 277
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 327 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 222 place count 326 transition count 275
Applied a total of 222 rules in 62 ms. Remains 326 /441 variables (removed 115) and now considering 275/387 (removed 112) transitions.
// Phase 1: matrix 275 rows 326 cols
[2024-05-22 06:46:52] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 06:46:53] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-05-22 06:46:53] [INFO ] Invariant cache hit.
[2024-05-22 06:46:53] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2024-05-22 06:46:53] [INFO ] Redundant transitions in 2 ms returned []
Running 270 sub problems to find dead transitions.
[2024-05-22 06:46:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 2/323 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 2/325 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 275/600 variables, 325/383 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-22 06:47:01] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:47:03] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:47:03] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:47:03] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-22 06:47:09] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-22 06:47:12] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:47:12] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-22 06:47:12] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-22 06:47:12] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/600 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 13 (OVERLAPS) 1/601 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-22 06:47:21] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 601/601 variables, and 394 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 326/326 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 2/323 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 2/325 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 11 (OVERLAPS) 275/600 variables, 325/393 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/600 variables, 270/663 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-22 06:47:44] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/601 variables, and 664 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 325/326 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 11/11 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Starting structural reductions in SI_LTL mode, iteration 1 : 326/441 places, 275/387 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61101 ms. Remains : 326/441 places, 275/387 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : DES-PT-50b-LTLFireability-11
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-11 finished in 61297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(G(!p1)||(!p1&&F(p2)))))))'
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 436 transition count 382
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 436 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 436 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 433 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 433 transition count 373
Applied a total of 22 rules in 17 ms. Remains 433 /441 variables (removed 8) and now considering 373/387 (removed 14) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:47:54] [INFO ] Computed 62 invariants in 7 ms
[2024-05-22 06:47:54] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-22 06:47:54] [INFO ] Invariant cache hit.
[2024-05-22 06:47:54] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:47:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:48:01] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-22 06:48:01] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-22 06:48:01] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:48:01] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:48:03] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:48:03] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:48:03] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-22 06:48:03] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:48:03] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:48:04] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-22 06:48:04] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:48:06] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:48:06] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-22 06:48:07] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:48:10] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:48:14] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-05-22 06:48:14] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 3 ms to minimize.
[2024-05-22 06:48:15] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2024-05-22 06:48:15] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:48:15] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-05-22 06:48:15] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:48:28] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:48:28] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-22 06:48:28] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:48:28] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:48:28] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:48:28] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:48:29] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:48:29] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:48:29] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:48:29] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:48:29] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:48:29] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:48:29] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:48:29] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 3 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:48:31] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:48:31] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:48:31] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:48:31] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:48:31] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:48:31] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:48:31] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:48:34] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:48:35] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:48:35] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:48:35] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:48:35] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:48:36] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:48:38] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:48:38] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-22 06:48:39] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:48:42] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 433/441 places, 373/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60973 ms. Remains : 433/441 places, 373/387 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, (AND p1 (NOT p2))]
Running random walk in product with property : DES-PT-50b-LTLFireability-12
Product exploration explored 100000 steps with 885 reset in 184 ms.
Product exploration explored 100000 steps with 890 reset in 197 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/433 stabilizing places and 248/373 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 748 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (357 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (51 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (56 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (50 resets) in 224 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (53 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (53 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 546145 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 5
Probabilistic random walk after 546145 steps, saw 93269 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
[2024-05-22 06:48:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 151/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 195/360 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 58/418 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 360/778 variables, 418/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/778 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 18/796 variables, 10/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/802 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/802 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/804 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/804 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/806 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/806 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/806 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 495 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 151/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 195/360 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 58/418 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 360/778 variables, 418/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/778 variables, 5/485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/778 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 18/796 variables, 10/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/796 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/802 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/802 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/804 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/804 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2/806 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/806 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/806 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 806/806 variables, and 500 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1603 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2712ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 19086 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 410 transition count 340
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 399 transition count 340
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 213 place count 322 transition count 263
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 320 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 320 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 319 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 318 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 317 transition count 263
Applied a total of 222 rules in 38 ms. Remains 317 /433 variables (removed 116) and now considering 263/373 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 317/433 places, 263/373 transitions.
RANDOM walk for 40000 steps (1889 resets) in 597 ms. (66 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (382 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (387 resets) in 320 ms. (124 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (380 resets) in 263 ms. (151 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (364 resets) in 255 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (372 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 619453 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 5
Probabilistic random walk after 619453 steps, saw 88349 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
// Phase 1: matrix 263 rows 317 cols
[2024-05-22 06:49:25] [INFO ] Computed 60 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 180/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 13/477 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/477 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/479 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 52/531 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/531 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/531 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 49/580 variables, 49/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/580 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/580 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 377 constraints, problems are : Problem set: 0 solved, 5 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 180/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 13/477 variables, 8/323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/477 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/479 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/479 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 52/531 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/531 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/531 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 49/580 variables, 49/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/580 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/580 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 580/580 variables, and 382 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1183 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2131ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7078 ms.
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 317/317 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-22 06:49:34] [INFO ] Invariant cache hit.
[2024-05-22 06:49:34] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 06:49:34] [INFO ] Invariant cache hit.
[2024-05-22 06:49:35] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2024-05-22 06:49:35] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 06:49:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/316 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 263/579 variables, 316/376 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:49:40] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:49:41] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:49:42] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 1/580 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:49:48] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:49:50] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/580 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 382 constraints, problems are : Problem set: 0 solved, 260 unsolved in 21951 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 2/316 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 263/579 variables, 316/381 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 260/641 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:50:22] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:50:23] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/580 variables, and 643 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 7/7 constraints]
After SMT, in 52152ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 52157ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52649 ms. Remains : 317/317 places, 263/263 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 317 transition count 263
Applied a total of 1 rules in 9 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 263 rows 317 cols
[2024-05-22 06:50:27] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 06:50:27] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 06:50:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 06:50:27] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 06:50:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 06:50:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 06:50:27] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-22 06:50:27] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:50:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
TRAPS : Iteration 1
[2024-05-22 06:50:28] [INFO ] After 505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-22 06:50:28] [INFO ] After 709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 846 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 745 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Applied a total of 0 rules in 9 ms. Remains 433 /433 variables (removed 0) and now considering 373/373 (removed 0) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:50:29] [INFO ] Computed 62 invariants in 13 ms
[2024-05-22 06:50:29] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-22 06:50:29] [INFO ] Invariant cache hit.
[2024-05-22 06:50:30] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:50:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:50:36] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-22 06:50:37] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:50:37] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:50:37] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-22 06:50:37] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-22 06:50:37] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-22 06:50:37] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-22 06:50:37] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-22 06:50:37] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:50:37] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-22 06:50:38] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:50:38] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:50:38] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:50:38] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:50:38] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:50:38] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:50:38] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:50:39] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:50:39] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-22 06:50:39] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:50:42] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:50:42] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:50:42] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:50:46] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:50:50] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 3 ms to minimize.
[2024-05-22 06:50:50] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-22 06:50:50] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-05-22 06:50:51] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-22 06:50:51] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-05-22 06:50:51] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:51:03] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:51:03] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:51:03] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:51:03] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:51:03] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:51:03] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:51:04] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:51:04] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:51:04] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:51:04] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:51:04] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:51:04] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:51:04] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:51:04] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:51:05] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:51:05] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:51:05] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:51:05] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:51:05] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-22 06:51:05] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:51:05] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:51:05] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:51:05] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:51:05] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:51:05] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:51:05] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:51:05] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:51:06] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:51:06] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-22 06:51:06] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-05-22 06:51:06] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:51:06] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:51:06] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:51:09] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:51:10] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:51:10] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-22 06:51:10] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:51:10] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:51:10] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:51:13] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:51:13] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:51:14] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:51:17] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Finished structural reductions in LTL mode , in 1 iterations and 61001 ms. Remains : 433/433 places, 373/373 transitions.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/433 stabilizing places and 248/373 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 573 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (354 resets) in 671 ms. (59 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (51 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (54 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (54 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (54 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (50 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 506712 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 5
Probabilistic random walk after 506712 steps, saw 87370 distinct states, run finished after 3003 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-22 06:51:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 151/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 195/360 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 58/418 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 360/778 variables, 418/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/778 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 18/796 variables, 10/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/802 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/802 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/804 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/804 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/806 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/806 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/806 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 495 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 151/165 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 195/360 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 58/418 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 360/778 variables, 418/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/778 variables, 5/485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/778 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 18/796 variables, 10/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/796 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/802 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/802 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/804 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/804 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2/806 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/806 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/806 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 806/806 variables, and 500 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2684ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 18466 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 410 transition count 340
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 399 transition count 340
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 213 place count 322 transition count 263
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 320 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 320 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 319 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 318 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 317 transition count 263
Applied a total of 222 rules in 55 ms. Remains 317 /433 variables (removed 116) and now considering 263/373 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 317/433 places, 263/373 transitions.
RANDOM walk for 40000 steps (1889 resets) in 939 ms. (42 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (342 resets) in 205 ms. (194 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (384 resets) in 224 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (378 resets) in 253 ms. (157 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (374 resets) in 198 ms. (201 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (346 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 572039 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 5
Probabilistic random walk after 572039 steps, saw 81325 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
// Phase 1: matrix 263 rows 317 cols
[2024-05-22 06:51:59] [INFO ] Computed 60 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 180/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 13/477 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/477 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/479 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 52/531 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/531 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/531 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 49/580 variables, 49/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/580 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/580 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 377 constraints, problems are : Problem set: 0 solved, 5 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 180/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 13/477 variables, 8/323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/477 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/479 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/479 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 52/531 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/531 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/531 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 49/580 variables, 49/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/580 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/580 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 580/580 variables, and 382 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2091ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7031 ms.
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 317/317 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-22 06:52:08] [INFO ] Invariant cache hit.
[2024-05-22 06:52:08] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 06:52:08] [INFO ] Invariant cache hit.
[2024-05-22 06:52:09] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-05-22 06:52:09] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 06:52:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/316 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 263/579 variables, 316/376 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:52:14] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-22 06:52:15] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:52:16] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 1/580 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:52:22] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:52:24] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/580 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 382 constraints, problems are : Problem set: 0 solved, 260 unsolved in 22140 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 2/316 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 263/579 variables, 316/381 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 260/641 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:52:57] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:52:57] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/580 variables, and 643 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 7/7 constraints]
After SMT, in 52351ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 52355ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52830 ms. Remains : 317/317 places, 263/263 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 317 transition count 263
Applied a total of 1 rules in 9 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 263 rows 317 cols
[2024-05-22 06:53:01] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 06:53:01] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 06:53:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 06:53:01] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 06:53:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 06:53:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 06:53:01] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-22 06:53:01] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:53:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
TRAPS : Iteration 1
[2024-05-22 06:53:02] [INFO ] After 520ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-22 06:53:02] [INFO ] After 716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 841 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 561 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 892 reset in 170 ms.
Product exploration explored 100000 steps with 899 reset in 200 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 427 transition count 370
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 427 transition count 372
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 427 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 422 transition count 367
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 422 transition count 367
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 112 place count 422 transition count 370
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 412 transition count 360
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 412 transition count 360
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 92 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 138 place count 412 transition count 388
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 140 place count 410 transition count 382
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 142 place count 410 transition count 382
Deduced a syphon composed of 90 places in 0 ms
Applied a total of 142 rules in 80 ms. Remains 410 /433 variables (removed 23) and now considering 382/373 (removed -9) transitions.
[2024-05-22 06:53:04] [INFO ] Redundant transitions in 2 ms returned []
Running 381 sub problems to find dead transitions.
// Phase 1: matrix 382 rows 410 cols
[2024-05-22 06:53:04] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 06:53:04] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/410 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 5 (OVERLAPS) 382/792 variables, 410/469 constraints. Problems are: Problem set: 115 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 16/485 constraints. Problems are: Problem set: 115 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 0/485 constraints. Problems are: Problem set: 115 solved, 266 unsolved
At refinement iteration 8 (OVERLAPS) 0/792 variables, 0/485 constraints. Problems are: Problem set: 115 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 792/792 variables, and 485 constraints, problems are : Problem set: 115 solved, 266 unsolved in 20203 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 410/410 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 115 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 13/13 constraints. Problems are: Problem set: 115 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/13 constraints. Problems are: Problem set: 115 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 69/388 variables, 32/45 constraints. Problems are: Problem set: 115 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 0/45 constraints. Problems are: Problem set: 115 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 15/403 variables, 14/59 constraints. Problems are: Problem set: 115 solved, 266 unsolved
[2024-05-22 06:53:28] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:53:28] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 2/61 constraints. Problems are: Problem set: 115 solved, 266 unsolved
[2024-05-22 06:53:31] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:53:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-22 06:53:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-22 06:53:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-22 06:53:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-22 06:53:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 6/67 constraints. Problems are: Problem set: 115 solved, 266 unsolved
[2024-05-22 06:53:33] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:53:33] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:53:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 3/70 constraints. Problems are: Problem set: 115 solved, 266 unsolved
[2024-05-22 06:53:35] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-22 06:53:35] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:53:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-22 06:53:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 4/74 constraints. Problems are: Problem set: 115 solved, 266 unsolved
[2024-05-22 06:53:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:53:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-22 06:53:37] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 3/77 constraints. Problems are: Problem set: 115 solved, 266 unsolved
[2024-05-22 06:53:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 1/78 constraints. Problems are: Problem set: 115 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 0/78 constraints. Problems are: Problem set: 115 solved, 266 unsolved
At refinement iteration 12 (OVERLAPS) 378/781 variables, 403/481 constraints. Problems are: Problem set: 115 solved, 266 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/781 variables, 16/497 constraints. Problems are: Problem set: 115 solved, 266 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/781 variables, 266/763 constraints. Problems are: Problem set: 115 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 781/792 variables, and 763 constraints, problems are : Problem set: 115 solved, 266 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 403/410 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 266/381 constraints, Known Traps: 19/19 constraints]
After SMT, in 50472ms problems are : Problem set: 115 solved, 266 unsolved
Search for dead transitions found 115 dead transitions in 50478ms
Found 115 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 115 transitions
Dead transitions reduction (with SMT) removed 115 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 410/433 places, 267/373 transitions.
Graph (complete) has 1112 edges and 410 vertex of which 320 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 320 /410 variables (removed 90) and now considering 267/267 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 320/433 places, 267/373 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50593 ms. Remains : 320/433 places, 267/373 transitions.
Built C files in :
/tmp/ltsmin9005164025946517167
[2024-05-22 06:53:54] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9005164025946517167
Running compilation step : cd /tmp/ltsmin9005164025946517167;'/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 687 ms.
Running link step : cd /tmp/ltsmin9005164025946517167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9005164025946517167;'/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/stateBased485725167607037959.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Applied a total of 0 rules in 9 ms. Remains 433 /433 variables (removed 0) and now considering 373/373 (removed 0) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:54:09] [INFO ] Computed 62 invariants in 14 ms
[2024-05-22 06:54:09] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 06:54:09] [INFO ] Invariant cache hit.
[2024-05-22 06:54:10] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:54:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:54:17] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-22 06:54:17] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:54:17] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:54:17] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:54:17] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-22 06:54:18] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-22 06:54:18] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-22 06:54:18] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:54:18] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:54:18] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:54:18] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:54:18] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-22 06:54:18] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:54:19] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:54:19] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:54:19] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-05-22 06:54:19] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:54:19] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:54:19] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-22 06:54:20] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:54:22] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:54:22] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:54:23] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:54:26] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-22 06:54:30] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 3 ms to minimize.
[2024-05-22 06:54:30] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-05-22 06:54:31] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:54:31] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:54:31] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-05-22 06:54:31] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:54:43] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:54:43] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:54:43] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:54:44] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:54:44] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:54:44] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:54:44] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:54:44] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:54:44] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:54:44] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:54:44] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:54:45] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:54:45] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:54:45] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:54:45] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:54:45] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:54:45] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:54:45] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:54:45] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-22 06:54:45] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:54:45] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:54:46] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:54:46] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:54:46] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:54:46] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:54:46] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:54:46] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:54:46] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:54:46] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:54:46] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:54:46] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:54:46] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:54:46] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:54:49] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:54:50] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:54:50] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-22 06:54:51] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:54:51] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:54:51] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:54:53] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:54:54] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:54:54] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:54:57] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Finished structural reductions in LTL mode , in 1 iterations and 60932 ms. Remains : 433/433 places, 373/373 transitions.
Built C files in :
/tmp/ltsmin12360741708342348348
[2024-05-22 06:55:10] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12360741708342348348
Running compilation step : cd /tmp/ltsmin12360741708342348348;'/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 732 ms.
Running link step : cd /tmp/ltsmin12360741708342348348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12360741708342348348;'/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/stateBased10547716615416756803.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 06:55:25] [INFO ] Flatten gal took : 29 ms
[2024-05-22 06:55:25] [INFO ] Flatten gal took : 15 ms
[2024-05-22 06:55:25] [INFO ] Time to serialize gal into /tmp/LTL4676418016476250282.gal : 4 ms
[2024-05-22 06:55:25] [INFO ] Time to serialize properties into /tmp/LTL4495209078650546646.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/LTL4676418016476250282.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1353117717553457539.hoa' '-atoms' '/tmp/LTL4495209078650546646.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/LTL4495209078650546646.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1353117717553457539.hoa
Detected timeout of ITS tools.
[2024-05-22 06:55:40] [INFO ] Flatten gal took : 14 ms
[2024-05-22 06:55:40] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:55:40] [INFO ] Time to serialize gal into /tmp/LTL12812631482246996360.gal : 3 ms
[2024-05-22 06:55:40] [INFO ] Time to serialize properties into /tmp/LTL7198873989899760779.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/LTL12812631482246996360.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7198873989899760779.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("((p32==0)||(p330==0))")))&&((G("((p37!=1)||(p330!=1))"))||((F("((p43==1)&&(p330==1))"))&&("((p37!=1)||(p330!=1))")))))))
Formula 0 simplified : X(GF!"((p32==0)||(p330==0))" | G(F!"((p37!=1)||(p330!=1))" & (!"((p37!=1)||(p330!=1))" | G!"((p43==1)&&(p330==1))")))
Detected timeout of ITS tools.
[2024-05-22 06:55:55] [INFO ] Flatten gal took : 17 ms
[2024-05-22 06:55:55] [INFO ] Applying decomposition
[2024-05-22 06:55:55] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5886515773275991177.txt' '-o' '/tmp/graph5886515773275991177.bin' '-w' '/tmp/graph5886515773275991177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5886515773275991177.bin' '-l' '-1' '-v' '-w' '/tmp/graph5886515773275991177.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:55:55] [INFO ] Decomposing Gal with order
[2024-05-22 06:55:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:55:56] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 06:55:56] [INFO ] Flatten gal took : 21 ms
[2024-05-22 06:55:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 06:55:56] [INFO ] Time to serialize gal into /tmp/LTL15146376431113773391.gal : 5 ms
[2024-05-22 06:55:56] [INFO ] Time to serialize properties into /tmp/LTL4463911663279488164.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/LTL15146376431113773391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4463911663279488164.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("((i5.u33.p32==0)||(i5.u33.p330==0))")))&&((G("((i5.u33.p37!=1)||(i5.u33.p330!=1))"))||((F("((i5.u33.p43==1)&&(i5.u33.p330...210
Formula 0 simplified : X(GF!"((i5.u33.p32==0)||(i5.u33.p330==0))" | G(F!"((i5.u33.p37!=1)||(i5.u33.p330!=1))" & (!"((i5.u33.p37!=1)||(i5.u33.p330!=1))" | G...196
Detected timeout of ITS tools.
Treatment of property DES-PT-50b-LTLFireability-12 finished in 496994 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||X((!p1 U (p2||G(!p1))))))))'
Support contains 3 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 436 transition count 382
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 436 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 436 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 433 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 433 transition count 373
Applied a total of 22 rules in 16 ms. Remains 433 /441 variables (removed 8) and now considering 373/387 (removed 14) transitions.
[2024-05-22 06:56:11] [INFO ] Invariant cache hit.
[2024-05-22 06:56:11] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-22 06:56:11] [INFO ] Invariant cache hit.
[2024-05-22 06:56:11] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:56:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:56:18] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-22 06:56:18] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:56:18] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-05-22 06:56:19] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:56:19] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-22 06:56:19] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-22 06:56:19] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-22 06:56:19] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-22 06:56:19] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-22 06:56:19] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:56:19] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:56:19] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:56:20] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:56:20] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:56:20] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:56:20] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:56:20] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:56:20] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:56:21] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-22 06:56:21] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:56:23] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:56:23] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:56:24] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:56:27] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:56:31] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 3 ms to minimize.
[2024-05-22 06:56:31] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 3 ms to minimize.
[2024-05-22 06:56:32] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2024-05-22 06:56:32] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:56:32] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-22 06:56:32] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:56:45] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-22 06:56:45] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:56:45] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:56:45] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:56:45] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:56:45] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:56:45] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:56:46] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:56:46] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 06:56:46] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:56:46] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:56:46] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:56:46] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:56:46] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:56:46] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:56:46] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:56:46] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:56:47] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:56:47] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:56:47] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:56:47] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-22 06:56:47] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:56:47] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:56:47] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:56:47] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:56:47] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:56:47] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:56:47] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:56:48] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:56:48] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:56:48] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:56:48] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:56:48] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:56:51] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:56:52] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-22 06:56:52] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:56:52] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:56:52] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:56:55] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:56:55] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:56:55] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:56:58] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Starting structural reductions in LTL mode, iteration 1 : 433/441 places, 373/387 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60949 ms. Remains : 433/441 places, 373/387 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DES-PT-50b-LTLFireability-13
Product exploration explored 100000 steps with 879 reset in 219 ms.
Product exploration explored 100000 steps with 878 reset in 221 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/433 stabilizing places and 248/373 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 443 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (343 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (51 resets) in 255 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (53 resets) in 332 ms. (120 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (53 resets) in 334 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (53 resets) in 412 ms. (96 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (51 resets) in 286 ms. (139 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (52 resets) in 367 ms. (108 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (51 resets) in 216 ms. (184 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (55 resets) in 194 ms. (205 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 341004 steps, run timeout after 3012 ms. (steps per millisecond=113 ) properties seen :0 out of 8
Probabilistic random walk after 341004 steps, saw 62249 distinct states, run finished after 3012 ms. (steps per millisecond=113 ) properties seen :0
[2024-05-22 06:57:16] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 151/164 variables, 31/33 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 196/360 variables, 25/58 constraints. Problems are: Problem set: 2 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 58/418 variables, 4/62 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 360/778 variables, 418/480 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/778 variables, 0/480 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 18/796 variables, 10/490 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 0/490 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 6/802 variables, 3/493 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/802 variables, 0/493 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/804 variables, 1/494 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/804 variables, 0/494 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/806 variables, 1/495 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/806 variables, 0/495 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/806 variables, 0/495 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 495 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 151/164 variables, 31/33 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 196/360 variables, 25/58 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-22 06:57:18] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:57:18] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 2/60 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 58/418 variables, 4/64 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 360/778 variables, 418/482 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/778 variables, 6/488 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-22 06:57:18] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-22 06:57:18] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/778 variables, 2/490 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/778 variables, 0/490 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 18/796 variables, 10/500 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/796 variables, 0/500 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/802 variables, 3/503 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/802 variables, 0/503 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 2/804 variables, 1/504 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/804 variables, 0/504 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 2/806 variables, 1/505 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/806 variables, 0/505 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/806 variables, 0/505 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 806/806 variables, and 505 constraints, problems are : Problem set: 2 solved, 6 unsolved in 2195 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 3265ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 19714 ms.
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 410 transition count 340
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 399 transition count 340
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 213 place count 322 transition count 263
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 320 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 320 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 319 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 318 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 317 transition count 263
Applied a total of 222 rules in 44 ms. Remains 317 /433 variables (removed 116) and now considering 263/373 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 317/433 places, 263/373 transitions.
RANDOM walk for 40000 steps (1885 resets) in 943 ms. (42 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (372 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (386 resets) in 397 ms. (100 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (357 resets) in 226 ms. (176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (370 resets) in 346 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (365 resets) in 280 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (330 resets) in 344 ms. (115 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 540509 steps, run timeout after 3007 ms. (steps per millisecond=179 ) properties seen :0 out of 6
Probabilistic random walk after 540509 steps, saw 76207 distinct states, run finished after 3008 ms. (steps per millisecond=179 ) properties seen :0
// Phase 1: matrix 263 rows 317 cols
[2024-05-22 06:57:43] [INFO ] Computed 60 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 13/477 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/477 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/479 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 52/531 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/531 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/531 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 49/580 variables, 49/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/580 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/580 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 377 constraints, problems are : Problem set: 0 solved, 6 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 6/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 13/477 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/477 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/479 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/479 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 52/531 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/531 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/531 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 49/580 variables, 49/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/580 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/580 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 580/580 variables, and 383 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1145 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1896ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6338 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 317/317 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-22 06:57:52] [INFO ] Invariant cache hit.
[2024-05-22 06:57:52] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-22 06:57:52] [INFO ] Invariant cache hit.
[2024-05-22 06:57:52] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2024-05-22 06:57:52] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 06:57:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/316 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 263/579 variables, 316/376 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:57:58] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:59] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:58:00] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 1/580 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:58:06] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:58:07] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/580 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 382 constraints, problems are : Problem set: 0 solved, 260 unsolved in 22546 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 2/316 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 263/579 variables, 316/381 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 260/641 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:58:41] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:58:41] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/580 variables, and 643 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 7/7 constraints]
After SMT, in 52757ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 52762ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53244 ms. Remains : 317/317 places, 263/263 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 317 transition count 263
Applied a total of 1 rules in 24 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 263 rows 317 cols
[2024-05-22 06:58:45] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 06:58:45] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-22 06:58:45] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-22 06:58:45] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 06:58:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 06:58:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 06:58:45] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-22 06:58:46] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-22 06:58:46] [INFO ] After 666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 875 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 471 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p2) p1)]
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 426 transition count 354
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 411 transition count 354
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 411 transition count 343
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 400 transition count 343
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 207 place count 323 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 318 transition count 266
Applied a total of 214 rules in 24 ms. Remains 318 /433 variables (removed 115) and now considering 266/373 (removed 107) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 06:58:46] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 06:58:46] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 06:58:46] [INFO ] Invariant cache hit.
[2024-05-22 06:58:47] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2024-05-22 06:58:47] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 06:58:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/317 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 266/583 variables, 317/375 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:58:54] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:58:58] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:59:01] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 1/584 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:59:08] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:59:10] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:59:12] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:59:17] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/584 variables, and 383 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/317 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 266/583 variables, 317/382 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 263/645 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/584 variables, and 645 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 7/7 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Starting structural reductions in SI_LTL mode, iteration 1 : 318/433 places, 266/373 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60765 ms. Remains : 318/433 places, 266/373 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X p2)), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (2193 resets) in 688 ms. (58 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (416 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (394 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (394 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 601294 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 3
Probabilistic random walk after 601294 steps, saw 85578 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2024-05-22 06:59:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 31/219 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 29/248 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 211/466 variables, 255/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 14/480 variables, 9/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/480 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 54/534 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 50/584 variables, 50/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/584 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/584 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 376 constraints, problems are : Problem set: 0 solved, 3 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 31/219 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:59:51] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 29/248 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 211/466 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/480 variables, 9/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 54/534 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/534 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 50/584 variables, 50/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/584 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/584 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 584/584 variables, and 380 constraints, problems are : Problem set: 0 solved, 3 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1221ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2018 ms.
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 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 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 317 transition count 264
Applied a total of 4 rules in 16 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 317/318 places, 264/266 transitions.
RANDOM walk for 40000 steps (2079 resets) in 370 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (414 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (421 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (389 resets) in 204 ms. (195 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 699001 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 3
Probabilistic random walk after 699001 steps, saw 98615 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 06:59:57] [INFO ] Computed 59 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 14/478 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 54/532 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 49/581 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/581 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/581 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 376 constraints, problems are : Problem set: 0 solved, 3 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 06:59:58] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/464 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/478 variables, 8/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/478 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 54/532 variables, 5/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 49/581 variables, 49/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/581 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/581 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 380 constraints, problems are : Problem set: 0 solved, 3 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1179ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2282 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 07:00:01] [INFO ] Invariant cache hit.
[2024-05-22 07:00:01] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 07:00:01] [INFO ] Invariant cache hit.
[2024-05-22 07:00:01] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-22 07:00:01] [INFO ] Redundant transitions in 2 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 07:00:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/316 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 264/580 variables, 316/375 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:00:06] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:00:07] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-22 07:00:07] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:00:08] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/581 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:00:12] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 381 constraints, problems are : Problem set: 0 solved, 261 unsolved in 19910 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 2/316 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 264/580 variables, 316/380 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 261/641 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:00:41] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/581 variables, and 642 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
After SMT, in 50110ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 50114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50603 ms. Remains : 317/317 places, 264/264 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 317 transition count 264
Applied a total of 1 rules in 9 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 07:00:51] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 07:00:52] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 07:00:52] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 07:00:52] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 07:00:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 07:00:52] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 07:00:52] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 07:00:52] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 07:00:52] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 565 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X p2)), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 26 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 34 ms :[(AND p1 (NOT p2))]
Product exploration explored 100000 steps with 5459 reset in 181 ms.
Product exploration explored 100000 steps with 5446 reset in 216 ms.
Built C files in :
/tmp/ltsmin824037113724034652
[2024-05-22 07:00:53] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-22 07:00:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:00:53] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-22 07:00:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:00:53] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-22 07:00:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:00:53] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin824037113724034652
Running compilation step : cd /tmp/ltsmin824037113724034652;'/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 686 ms.
Running link step : cd /tmp/ltsmin824037113724034652;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin824037113724034652;'/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/stateBased17812739728462316941.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 266/266 transitions.
Applied a total of 0 rules in 12 ms. Remains 318 /318 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 07:01:08] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 07:01:08] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-22 07:01:08] [INFO ] Invariant cache hit.
[2024-05-22 07:01:08] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-05-22 07:01:08] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 07:01:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/317 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 266/583 variables, 317/375 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:01:16] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:01:20] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:01:22] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 1/584 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:01:29] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:01:31] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:01:33] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:01:38] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2024-05-22 07:01:38] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-22 07:01:38] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/584 variables, and 385 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/317 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 266/583 variables, 317/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 263/647 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/584 variables, and 647 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60679 ms. Remains : 318/318 places, 266/266 transitions.
Built C files in :
/tmp/ltsmin890019831949064984
[2024-05-22 07:02:08] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-22 07:02:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:02:08] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-22 07:02:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:02:08] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-22 07:02:09] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:02:09] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin890019831949064984
Running compilation step : cd /tmp/ltsmin890019831949064984;'/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 661 ms.
Running link step : cd /tmp/ltsmin890019831949064984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin890019831949064984;'/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/stateBased14713446102955990260.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 07:02:24] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:02:24] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:02:24] [INFO ] Time to serialize gal into /tmp/LTL6882153995640657810.gal : 2 ms
[2024-05-22 07:02:24] [INFO ] Time to serialize properties into /tmp/LTL2994301611153396457.prop : 12 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/LTL6882153995640657810.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10293813586412716009.hoa' '-atoms' '/tmp/LTL2994301611153396457.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/LTL2994301611153396457.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10293813586412716009.hoa
Detected timeout of ITS tools.
[2024-05-22 07:02:39] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:02:39] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:02:39] [INFO ] Time to serialize gal into /tmp/LTL6401354807813771176.gal : 3 ms
[2024-05-22 07:02:39] [INFO ] Time to serialize properties into /tmp/LTL16797716306707927767.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/LTL6401354807813771176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16797716306707927767.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(G((X((!("((p31==1)&&(p330==1))"))U(("((!((p37==1)&&(p330==1)))&&(!((p31==1)&&(p330==1))))")||(G(!("((p31==1)&&(p330==1))"))))))||...209
Formula 0 simplified : GF(!"(((p37==1)&&(p330==1))&&((p31==0)||(p330==0)))" & X("((p31==1)&&(p330==1))" M !"((!((p37==1)&&(p330==1)))&&(!((p31==1)&&(p330==...163
Detected timeout of ITS tools.
[2024-05-22 07:02:54] [INFO ] Flatten gal took : 14 ms
[2024-05-22 07:02:54] [INFO ] Applying decomposition
[2024-05-22 07:02:54] [INFO ] Flatten gal took : 24 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/graph9893235793926358238.txt' '-o' '/tmp/graph9893235793926358238.bin' '-w' '/tmp/graph9893235793926358238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9893235793926358238.bin' '-l' '-1' '-v' '-w' '/tmp/graph9893235793926358238.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:02:54] [INFO ] Decomposing Gal with order
[2024-05-22 07:02:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:02:54] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 07:02:54] [INFO ] Flatten gal took : 31 ms
[2024-05-22 07:02:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2024-05-22 07:02:54] [INFO ] Time to serialize gal into /tmp/LTL16922682215735451697.gal : 3 ms
[2024-05-22 07:02:54] [INFO ] Time to serialize properties into /tmp/LTL7269648924494961465.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/LTL16922682215735451697.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7269648924494961465.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(G((X((!("((u10.p31==1)&&(u10.p330==1))"))U(("((!((u10.p37==1)&&(u10.p330==1)))&&(!((u10.p31==1)&&(u10.p330==1))))")||(G(!("((u10....257
Formula 0 simplified : GF(!"(((u10.p37==1)&&(u10.p330==1))&&((u10.p31==0)||(u10.p330==0)))" & X("((u10.p31==1)&&(u10.p330==1))" M !"((!((u10.p37==1)&&(u10....203
Detected timeout of ITS tools.
Treatment of property DES-PT-50b-LTLFireability-13 finished in 418329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(G(!p1)||(!p1&&F(p2)))))))'
Found a Shortening insensitive property : DES-PT-50b-LTLFireability-12
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, (AND p1 (NOT p2))]
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 434 transition count 370
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 421 transition count 370
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 421 transition count 359
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 410 transition count 359
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 405 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 405 transition count 354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 64 place count 405 transition count 349
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 67 place count 403 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 67 place count 403 transition count 347
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 402 transition count 347
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 71 place count 400 transition count 345
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 400 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 75 place count 400 transition count 343
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 229 place count 323 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 233 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 318 transition count 266
Applied a total of 236 rules in 49 ms. Remains 318 /441 variables (removed 123) and now considering 266/387 (removed 121) transitions.
[2024-05-22 07:03:09] [INFO ] Invariant cache hit.
[2024-05-22 07:03:10] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-22 07:03:10] [INFO ] Invariant cache hit.
[2024-05-22 07:03:10] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-22 07:03:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/317 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 266/583 variables, 317/375 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:03:17] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:03:21] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:03:24] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 1/584 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:03:31] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-22 07:03:33] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:03:35] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:03:40] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-22 07:03:40] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-22 07:03:40] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/584 variables, and 385 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/317 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 266/583 variables, 317/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 263/647 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/584 variables, and 647 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in LI_LTL mode, iteration 1 : 318/441 places, 266/387 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60866 ms. Remains : 318/441 places, 266/387 transitions.
Running random walk in product with property : DES-PT-50b-LTLFireability-12
Product exploration explored 100000 steps with 5425 reset in 191 ms.
Product exploration explored 100000 steps with 5495 reset in 219 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 749 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (2220 resets) in 405 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (384 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (416 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (408 resets) in 240 ms. (165 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (407 resets) in 220 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (400 resets) in 292 ms. (136 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 639535 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 5
Probabilistic random walk after 639535 steps, saw 91056 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
[2024-05-22 07:04:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 180/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 31/219 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 29/248 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 211/466 variables, 255/309 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 14/480 variables, 9/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/480 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 54/534 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 50/584 variables, 50/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/584 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/584 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 376 constraints, problems are : Problem set: 0 solved, 5 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 180/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 31/219 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 29/248 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 211/466 variables, 255/309 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 14/480 variables, 9/323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 54/534 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/534 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 50/584 variables, 50/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/584 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/584 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 584/584 variables, and 381 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1806ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7714 ms.
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 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 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 317 transition count 264
Applied a total of 4 rules in 16 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 317/318 places, 264/266 transitions.
RANDOM walk for 40000 steps (2110 resets) in 760 ms. (52 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (405 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (398 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (409 resets) in 233 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (415 resets) in 342 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (389 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 595253 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 5
Probabilistic random walk after 595253 steps, saw 84744 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 07:04:28] [INFO ] Computed 59 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 180/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 14/478 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 54/532 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 49/581 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/581 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/581 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 376 constraints, problems are : Problem set: 0 solved, 5 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 180/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 14/478 variables, 8/323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 54/532 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 49/581 variables, 49/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 381 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1941ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7235 ms.
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 6 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 07:04:37] [INFO ] Invariant cache hit.
[2024-05-22 07:04:38] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 07:04:38] [INFO ] Invariant cache hit.
[2024-05-22 07:04:38] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2024-05-22 07:04:38] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 07:04:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/316 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 264/580 variables, 316/375 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/581 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:04:49] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 381 constraints, problems are : Problem set: 0 solved, 261 unsolved in 19768 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 2/316 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 264/580 variables, 316/380 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 261/641 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:05:18] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s100 0)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 1)
(s224 1)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 1)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 1)
(s248 0)
(s249 1)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 1)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 1)
(s266 0)
(s267 1)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/581 variables, and 642 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
After SMT, in 50001ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 50005ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50495 ms. Remains : 317/317 places, 264/264 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 317 transition count 264
Applied a total of 1 rules in 11 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 07:05:28] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 07:05:28] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 07:05:28] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 07:05:28] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 07:05:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 07:05:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 07:05:28] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-22 07:05:28] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-22 07:05:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
TRAPS : Iteration 1
[2024-05-22 07:05:29] [INFO ] After 470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-22 07:05:29] [INFO ] After 684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 819 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 724 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 318 /318 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 07:05:30] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 07:05:30] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 07:05:30] [INFO ] Invariant cache hit.
[2024-05-22 07:05:30] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-22 07:05:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/317 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 266/583 variables, 317/375 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:05:37] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:05:44] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 1/584 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:05:51] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:05:53] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:05:55] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:06:00] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-22 07:06:00] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:06:00] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/584 variables, and 385 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/317 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 266/583 variables, 317/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 263/647 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/584 variables, and 647 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Finished structural reductions in LTL mode , in 1 iterations and 60714 ms. Remains : 318/318 places, 266/266 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 519 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (2168 resets) in 602 ms. (66 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (419 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (401 resets) in 244 ms. (163 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (405 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (409 resets) in 213 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (426 resets) in 306 ms. (130 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 355515 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 5
Probabilistic random walk after 355515 steps, saw 50888 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-22 07:06:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 180/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 31/219 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 29/248 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 211/466 variables, 255/309 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 14/480 variables, 9/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/480 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 54/534 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 50/584 variables, 50/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/584 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/584 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 376 constraints, problems are : Problem set: 0 solved, 5 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 180/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 31/219 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 29/248 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 211/466 variables, 255/309 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 14/480 variables, 9/323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 54/534 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/534 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 50/584 variables, 50/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/584 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/584 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 584/584 variables, and 381 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1807ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7353 ms.
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 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 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 317 transition count 264
Applied a total of 4 rules in 15 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 317/318 places, 264/266 transitions.
RANDOM walk for 40000 steps (2111 resets) in 420 ms. (95 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (398 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (398 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (388 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (379 resets) in 228 ms. (174 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (399 resets) in 186 ms. (213 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 366759 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 5
Probabilistic random walk after 366759 steps, saw 52507 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 07:06:47] [INFO ] Computed 59 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 180/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 14/478 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 54/532 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 49/581 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/581 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/581 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 376 constraints, problems are : Problem set: 0 solved, 5 unsolved in 782 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 180/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 14/478 variables, 8/323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 54/532 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 49/581 variables, 49/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 381 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1023 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1838ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7339 ms.
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 07:06:57] [INFO ] Invariant cache hit.
[2024-05-22 07:06:57] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 07:06:57] [INFO ] Invariant cache hit.
[2024-05-22 07:06:57] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2024-05-22 07:06:57] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 07:06:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/316 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 264/580 variables, 316/375 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:07:02] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-22 07:07:03] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-22 07:07:03] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-22 07:07:03] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/581 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:07:08] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 381 constraints, problems are : Problem set: 0 solved, 261 unsolved in 19308 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 2/316 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 264/580 variables, 316/380 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 261/641 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:07:37] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/581 variables, and 642 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
After SMT, in 49499ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 49501ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50019 ms. Remains : 317/317 places, 264/264 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 317 transition count 264
Applied a total of 1 rules in 8 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 07:07:47] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 07:07:47] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 07:07:47] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 07:07:47] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 07:07:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 07:07:47] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 07:07:47] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-22 07:07:47] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:07:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
TRAPS : Iteration 1
[2024-05-22 07:07:47] [INFO ] After 477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-22 07:07:47] [INFO ] After 684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 825 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 542 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 5293 reset in 184 ms.
Product exploration explored 100000 steps with 5412 reset in 211 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 266/266 transitions.
Applied a total of 0 rules in 4 ms. Remains 318 /318 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-05-22 07:07:49] [INFO ] Redundant transitions in 2 ms returned []
Running 263 sub problems to find dead transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 07:07:49] [INFO ] Computed 58 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/317 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 266/583 variables, 317/375 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:07:55] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-22 07:07:56] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-22 07:07:56] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 1/584 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/584 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:08:03] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/584 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/584 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 380 constraints, problems are : Problem set: 0 solved, 263 unsolved in 22791 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/317 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 266/583 variables, 317/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 263/642 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:08:29] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/584 variables, and 643 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
After SMT, in 52954ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 52957ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52973 ms. Remains : 318/318 places, 266/266 transitions.
Built C files in :
/tmp/ltsmin1966521594468280537
[2024-05-22 07:08:42] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1966521594468280537
Running compilation step : cd /tmp/ltsmin1966521594468280537;'/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 528 ms.
Running link step : cd /tmp/ltsmin1966521594468280537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1966521594468280537;'/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/stateBased2493841042417449342.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 266/266 transitions.
Applied a total of 0 rules in 7 ms. Remains 318 /318 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-05-22 07:08:57] [INFO ] Invariant cache hit.
[2024-05-22 07:08:57] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 07:08:57] [INFO ] Invariant cache hit.
[2024-05-22 07:08:58] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-22 07:08:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/317 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 266/583 variables, 317/375 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:09:05] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:09:09] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:09:12] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 1/584 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:09:19] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-22 07:09:21] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:09:23] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:09:27] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-22 07:09:27] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-22 07:09:27] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/584 variables, and 385 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/317 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 266/583 variables, 317/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 263/647 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/584 variables, and 647 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Finished structural reductions in LTL mode , in 1 iterations and 60675 ms. Remains : 318/318 places, 266/266 transitions.
Built C files in :
/tmp/ltsmin10511078304266810109
[2024-05-22 07:09:58] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10511078304266810109
Running compilation step : cd /tmp/ltsmin10511078304266810109;'/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 528 ms.
Running link step : cd /tmp/ltsmin10511078304266810109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10511078304266810109;'/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/stateBased11971832069042753827.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 07:10:13] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:10:13] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:10:13] [INFO ] Time to serialize gal into /tmp/LTL8432165313957019164.gal : 4 ms
[2024-05-22 07:10:13] [INFO ] Time to serialize properties into /tmp/LTL16721192482247678989.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8432165313957019164.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13241346567614257530.hoa' '-atoms' '/tmp/LTL16721192482247678989.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16721192482247678989.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13241346567614257530.hoa
Detected timeout of ITS tools.
[2024-05-22 07:10:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:10:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 07:10:28] [INFO ] Time to serialize gal into /tmp/LTL1809373501014732409.gal : 2 ms
[2024-05-22 07:10:28] [INFO ] Time to serialize properties into /tmp/LTL5190328646821503187.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/LTL1809373501014732409.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5190328646821503187.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 : !((X(F((F(G("((p32==0)||(p330==0))")))&&((G("((p37!=1)||(p330!=1))"))||((F("((p43==1)&&(p330==1))"))&&("((p37!=1)||(p330!=1))")))))))
Formula 0 simplified : X(GF!"((p32==0)||(p330==0))" | G(F!"((p37!=1)||(p330!=1))" & (!"((p37!=1)||(p330!=1))" | G!"((p43==1)&&(p330==1))")))
Detected timeout of ITS tools.
[2024-05-22 07:10:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 07:10:43] [INFO ] Applying decomposition
[2024-05-22 07:10:43] [INFO ] Flatten gal took : 8 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/graph7530758322349207807.txt' '-o' '/tmp/graph7530758322349207807.bin' '-w' '/tmp/graph7530758322349207807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7530758322349207807.bin' '-l' '-1' '-v' '-w' '/tmp/graph7530758322349207807.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:10:43] [INFO ] Decomposing Gal with order
[2024-05-22 07:10:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:10:43] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-22 07:10:43] [INFO ] Flatten gal took : 29 ms
[2024-05-22 07:10:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2024-05-22 07:10:43] [INFO ] Time to serialize gal into /tmp/LTL8323692844099583284.gal : 12 ms
[2024-05-22 07:10:43] [INFO ] Time to serialize properties into /tmp/LTL8452396096484553770.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/LTL8323692844099583284.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8452396096484553770.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 : !((X(F((F(G("((u10.p32==0)||(u10.p330==0))")))&&((G("((u10.p37!=1)||(u10.p330!=1))"))||((F("((u10.p43==1)&&(u10.p330==1))"))&&("((u10....186
Formula 0 simplified : X(GF!"((u10.p32==0)||(u10.p330==0))" | G(F!"((u10.p37!=1)||(u10.p330!=1))" & (!"((u10.p37!=1)||(u10.p330!=1))" | G!"((u10.p43==1)&&(...172
Detected timeout of ITS tools.
Treatment of property DES-PT-50b-LTLFireability-12 finished in 469294 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||X((!p1 U (p2||G(!p1))))))))'
Found a Lengthening insensitive property : DES-PT-50b-LTLFireability-13
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 3 out of 441 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 441/441 places, 387/387 transitions.
Graph (complete) has 1027 edges and 441 vertex of which 435 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 434 transition count 370
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 421 transition count 370
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 421 transition count 359
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 410 transition count 359
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 405 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 405 transition count 354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 64 place count 405 transition count 349
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 67 place count 403 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 67 place count 403 transition count 347
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 402 transition count 347
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 71 place count 400 transition count 345
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 400 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 75 place count 400 transition count 343
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 229 place count 323 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 233 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 318 transition count 266
Applied a total of 236 rules in 47 ms. Remains 318 /441 variables (removed 123) and now considering 266/387 (removed 121) transitions.
[2024-05-22 07:10:59] [INFO ] Invariant cache hit.
[2024-05-22 07:10:59] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-22 07:10:59] [INFO ] Invariant cache hit.
[2024-05-22 07:10:59] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-22 07:10:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/317 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 266/583 variables, 317/375 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:11:06] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:11:10] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:11:13] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 1/584 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:11:20] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:11:22] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:11:24] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:11:28] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-22 07:11:29] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-22 07:11:29] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/584 variables, and 385 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/317 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 266/583 variables, 317/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 263/647 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/584 variables, and 647 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Starting structural reductions in LI_LTL mode, iteration 1 : 318/441 places, 266/387 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60817 ms. Remains : 318/441 places, 266/387 transitions.
Running random walk in product with property : DES-PT-50b-LTLFireability-13
Product exploration explored 100000 steps with 5466 reset in 224 ms.
Product exploration explored 100000 steps with 5434 reset in 250 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 443 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (2184 resets) in 710 ms. (56 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (386 resets) in 210 ms. (189 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (421 resets) in 241 ms. (165 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (408 resets) in 394 ms. (101 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (408 resets) in 286 ms. (139 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (434 resets) in 385 ms. (103 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (393 resets) in 461 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (431 resets) in 267 ms. (149 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (410 resets) in 308 ms. (129 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 430370 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 8
Probabilistic random walk after 430370 steps, saw 60715 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2024-05-22 07:12:04] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 31/219 variables, 20/29 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 29/248 variables, 18/47 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/47 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/54 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 211/466 variables, 255/309 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/309 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 14/480 variables, 9/318 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/480 variables, 3/321 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 0/321 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 54/534 variables, 4/325 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 1/326 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 0/326 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 50/584 variables, 50/376 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/584 variables, 0/376 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/584 variables, 0/376 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 376 constraints, problems are : Problem set: 2 solved, 6 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 31/219 variables, 20/29 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 29/248 variables, 18/47 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/47 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/54 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 211/466 variables, 255/309 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 6/315 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-22 07:12:06] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 1/316 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/316 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 14/480 variables, 9/325 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 3/328 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/328 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 54/534 variables, 4/332 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/534 variables, 1/333 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 0/333 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 50/584 variables, 50/383 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/584 variables, 0/383 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/584 variables, 0/383 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 584/584 variables, and 383 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1182 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 1852ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6696 ms.
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 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 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 317 transition count 264
Applied a total of 4 rules in 14 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 317/318 places, 264/266 transitions.
RANDOM walk for 40000 steps (2143 resets) in 1282 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (403 resets) in 313 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (377 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (389 resets) in 467 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (394 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (396 resets) in 273 ms. (145 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (405 resets) in 284 ms. (140 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 533263 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 6
Probabilistic random walk after 533263 steps, saw 74986 distinct states, run finished after 3002 ms. (steps per millisecond=177 ) properties seen :0
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 07:12:17] [INFO ] Computed 59 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 14/478 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 54/532 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 49/581 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/581 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/581 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 376 constraints, problems are : Problem set: 0 solved, 6 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 6/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 14/478 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 54/532 variables, 5/332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 49/581 variables, 49/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/581 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/581 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 382 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1025 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1762ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6396 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 07:12:25] [INFO ] Invariant cache hit.
[2024-05-22 07:12:25] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 07:12:25] [INFO ] Invariant cache hit.
[2024-05-22 07:12:26] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-05-22 07:12:26] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 07:12:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/316 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 264/580 variables, 316/375 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:12:30] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-22 07:12:32] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-22 07:12:32] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 3 ms to minimize.
[2024-05-22 07:12:32] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/581 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:12:37] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 381 constraints, problems are : Problem set: 0 solved, 261 unsolved in 19333 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 2/316 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 264/580 variables, 316/380 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 261/641 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:13:05] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/581 variables, and 642 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
After SMT, in 49518ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 49521ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50063 ms. Remains : 317/317 places, 264/264 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 317 transition count 264
Applied a total of 1 rules in 10 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 07:13:15] [INFO ] Computed 59 invariants in 15 ms
[2024-05-22 07:13:15] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 07:13:15] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 07:13:16] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 07:13:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 07:13:16] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 24 ms returned sat
[2024-05-22 07:13:16] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-22 07:13:16] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-22 07:13:16] [INFO ] After 592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 896 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 546 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p2) p1)]
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 266/266 transitions.
Applied a total of 0 rules in 6 ms. Remains 318 /318 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 07:13:17] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 07:13:17] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 07:13:17] [INFO ] Invariant cache hit.
[2024-05-22 07:13:17] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-05-22 07:13:17] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 07:13:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/317 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 266/583 variables, 317/375 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:13:24] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:13:29] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:13:31] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 1/584 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:13:39] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-22 07:13:41] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:13:43] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:13:47] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:13:47] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
SMT process timed out in 30226ms, After SMT, problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 30229ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30745 ms. Remains : 318/318 places, 266/266 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X p2)), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (2193 resets) in 779 ms. (51 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (402 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (413 resets) in 278 ms. (143 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (406 resets) in 307 ms. (129 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 719381 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :0 out of 3
Probabilistic random walk after 719381 steps, saw 101530 distinct states, run finished after 3001 ms. (steps per millisecond=239 ) properties seen :0
[2024-05-22 07:13:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 31/219 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 29/248 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 211/466 variables, 255/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 14/480 variables, 9/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/480 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 54/534 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 50/584 variables, 50/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/584 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/584 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 376 constraints, problems are : Problem set: 0 solved, 3 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 31/219 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:13:52] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 29/248 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 211/466 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/480 variables, 9/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 54/534 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/534 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 50/584 variables, 50/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/584 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/584 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 584/584 variables, and 380 constraints, problems are : Problem set: 0 solved, 3 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1204ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2359 ms.
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 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 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 317 transition count 264
Applied a total of 4 rules in 13 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 317/318 places, 264/266 transitions.
RANDOM walk for 40000 steps (2134 resets) in 612 ms. (65 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (391 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (375 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (403 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 710448 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :0 out of 3
Probabilistic random walk after 710448 steps, saw 100248 distinct states, run finished after 3001 ms. (steps per millisecond=236 ) properties seen :0
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 07:13:58] [INFO ] Computed 59 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 14/478 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 54/532 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 49/581 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/581 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/581 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 376 constraints, problems are : Problem set: 0 solved, 3 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 181/188 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 35/223 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 209/464 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:13:59] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/464 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/478 variables, 8/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/478 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 54/532 variables, 5/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 49/581 variables, 49/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/581 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/581 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 380 constraints, problems are : Problem set: 0 solved, 3 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1261ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1775 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 6 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 22 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 07:14:01] [INFO ] Invariant cache hit.
[2024-05-22 07:14:01] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 07:14:02] [INFO ] Invariant cache hit.
[2024-05-22 07:14:02] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-22 07:14:02] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-22 07:14:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/316 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 264/580 variables, 316/375 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:14:06] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:14:08] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-22 07:14:08] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-22 07:14:08] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/581 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:14:13] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/581 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 381 constraints, problems are : Problem set: 0 solved, 261 unsolved in 19545 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 2/316 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 264/580 variables, 316/380 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 261/641 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 07:14:42] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/581 variables, and 642 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 6/6 constraints]
After SMT, in 49715ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 49717ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50280 ms. Remains : 317/317 places, 264/264 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 317 transition count 264
Applied a total of 1 rules in 8 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 264 rows 317 cols
[2024-05-22 07:14:52] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 07:14:52] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 07:14:52] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 07:14:52] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 07:14:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 07:14:52] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 07:14:52] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 07:14:52] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 07:14:52] [INFO ] After 379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 506 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X p2)), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 174 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 28 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 46 ms :[(AND p1 (NOT p2))]
Product exploration explored 100000 steps with 5511 reset in 189 ms.
Product exploration explored 100000 steps with 5463 reset in 207 ms.
Built C files in :
/tmp/ltsmin4537790155864530519
[2024-05-22 07:14:53] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-22 07:14:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:14:53] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-22 07:14:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:14:53] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-22 07:14:53] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:14:53] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4537790155864530519
Running compilation step : cd /tmp/ltsmin4537790155864530519;'/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 653 ms.
Running link step : cd /tmp/ltsmin4537790155864530519;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4537790155864530519;'/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/stateBased760136716150199409.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 266/266 transitions.
Applied a total of 0 rules in 13 ms. Remains 318 /318 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 318 cols
[2024-05-22 07:15:08] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 07:15:08] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 07:15:08] [INFO ] Invariant cache hit.
[2024-05-22 07:15:08] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-05-22 07:15:08] [INFO ] Redundant transitions in 2 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 07:15:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/317 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 266/583 variables, 317/375 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:15:15] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:15:20] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:15:22] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 1/584 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:15:29] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-22 07:15:31] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:15:33] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 07:15:38] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-22 07:15:38] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-22 07:15:38] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/584 variables, and 385 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/317 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 266/583 variables, 317/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 263/647 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/584 variables, and 647 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60699 ms. Remains : 318/318 places, 266/266 transitions.
Built C files in :
/tmp/ltsmin10631013409832647753
[2024-05-22 07:16:09] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-22 07:16:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:16:09] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-22 07:16:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:16:09] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-22 07:16:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:16:09] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10631013409832647753
Running compilation step : cd /tmp/ltsmin10631013409832647753;'/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 651 ms.
Running link step : cd /tmp/ltsmin10631013409832647753;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10631013409832647753;'/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/stateBased839861665553705344.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 07:16:24] [INFO ] Flatten gal took : 8 ms
[2024-05-22 07:16:24] [INFO ] Flatten gal took : 8 ms
[2024-05-22 07:16:24] [INFO ] Time to serialize gal into /tmp/LTL2969541370525791896.gal : 2 ms
[2024-05-22 07:16:24] [INFO ] Time to serialize properties into /tmp/LTL15892346899325794218.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/LTL2969541370525791896.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8020057814108309059.hoa' '-atoms' '/tmp/LTL15892346899325794218.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/LTL15892346899325794218.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8020057814108309059.hoa
Detected timeout of ITS tools.
[2024-05-22 07:16:39] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:16:39] [INFO ] Flatten gal took : 8 ms
[2024-05-22 07:16:39] [INFO ] Time to serialize gal into /tmp/LTL17806108570967672381.gal : 2 ms
[2024-05-22 07:16:39] [INFO ] Time to serialize properties into /tmp/LTL5791575264564807347.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/LTL17806108570967672381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5791575264564807347.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(G((X((!("((p31==1)&&(p330==1))"))U(("((!((p37==1)&&(p330==1)))&&(!((p31==1)&&(p330==1))))")||(G(!("((p31==1)&&(p330==1))"))))))||...209
Formula 0 simplified : GF(!"(((p37==1)&&(p330==1))&&((p31==0)||(p330==0)))" & X("((p31==1)&&(p330==1))" M !"((!((p37==1)&&(p330==1)))&&(!((p31==1)&&(p330==...163
Detected timeout of ITS tools.
[2024-05-22 07:16:54] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:16:54] [INFO ] Applying decomposition
[2024-05-22 07:16:54] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1860725463677446713.txt' '-o' '/tmp/graph1860725463677446713.bin' '-w' '/tmp/graph1860725463677446713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1860725463677446713.bin' '-l' '-1' '-v' '-w' '/tmp/graph1860725463677446713.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:16:54] [INFO ] Decomposing Gal with order
[2024-05-22 07:16:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:16:54] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 07:16:54] [INFO ] Flatten gal took : 46 ms
[2024-05-22 07:16:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 1 ms.
[2024-05-22 07:16:54] [INFO ] Time to serialize gal into /tmp/LTL6853125654414151973.gal : 2 ms
[2024-05-22 07:16:54] [INFO ] Time to serialize properties into /tmp/LTL8337404078257498504.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/LTL6853125654414151973.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8337404078257498504.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(G((X((!("((u10.p31==1)&&(u10.p330==1))"))U(("((!((u10.p37==1)&&(u10.p330==1)))&&(!((u10.p31==1)&&(u10.p330==1))))")||(G(!("((u10....257
Formula 0 simplified : GF(!"(((u10.p37==1)&&(u10.p330==1))&&((u10.p31==0)||(u10.p330==0)))" & X("((u10.p31==1)&&(u10.p330==1))" M !"((!((u10.p37==1)&&(u10....203
Detected timeout of ITS tools.
Treatment of property DES-PT-50b-LTLFireability-13 finished in 370782 ms.
[2024-05-22 07:17:09] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3605898274382243117
[2024-05-22 07:17:09] [INFO ] Computing symmetric may disable matrix : 387 transitions.
[2024-05-22 07:17:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:17:09] [INFO ] Computing symmetric may enable matrix : 387 transitions.
[2024-05-22 07:17:09] [INFO ] Applying decomposition
[2024-05-22 07:17:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:17:09] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:17:09] [INFO ] Computing Do-Not-Accords matrix : 387 transitions.
[2024-05-22 07:17:09] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 07:17:09] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3605898274382243117
Running compilation step : cd /tmp/ltsmin3605898274382243117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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/graph12992242154199772831.txt' '-o' '/tmp/graph12992242154199772831.bin' '-w' '/tmp/graph12992242154199772831.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12992242154199772831.bin' '-l' '-1' '-v' '-w' '/tmp/graph12992242154199772831.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:17:09] [INFO ] Decomposing Gal with order
[2024-05-22 07:17:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:17:09] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-22 07:17:09] [INFO ] Flatten gal took : 31 ms
[2024-05-22 07:17:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 20 ms.
[2024-05-22 07:17:09] [INFO ] Time to serialize gal into /tmp/LTLFireability4295403180099129720.gal : 18 ms
[2024-05-22 07:17:09] [INFO ] Time to serialize properties into /tmp/LTLFireability17744465233804636627.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/LTLFireability4295403180099129720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17744465233804636627.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...277
Read 3 LTL properties
Checking formula 0 : !((F((G("((u78.p105==1)&&(u78.p471==1))"))||(G(F("(i8.i0.u41.p346==0)"))))))
Formula 0 simplified : G(F!"((u78.p105==1)&&(u78.p471==1))" & FG!"(i8.i0.u41.p346==0)")
Compilation finished in 1232 ms.
Running link step : cd /tmp/ltsmin3605898274382243117;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin3605898274382243117;'/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' '--ltl' '<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin3605898274382243117;'/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' '--ltl' '<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3605898274382243117;'/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' 'X(<>((<>([]((LTLAPp2==true)))&&([](!(LTLAPp3==true))||(!(LTLAPp3==true)&&<>((LTLAPp4==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t116, t124, t286, t347, t348, t380, u9.t237, u9.t238, u9.t239, u9.t240, u9.t241, u9....1229
Computing Next relation with stutter on 9.34119e+08 deadlock states

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-50b"
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-50b, 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-171624189900740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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