About the Execution of ITS-Tools for DES-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16125.079 | 3600000.00 | 6251049.00 | 8545.80 | FFFFFFFFFF?TFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r092-tall-171624189800676.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-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189800676
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K 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-10b-LTLFireability-00
FORMULA_NAME DES-PT-10b-LTLFireability-01
FORMULA_NAME DES-PT-10b-LTLFireability-02
FORMULA_NAME DES-PT-10b-LTLFireability-03
FORMULA_NAME DES-PT-10b-LTLFireability-04
FORMULA_NAME DES-PT-10b-LTLFireability-05
FORMULA_NAME DES-PT-10b-LTLFireability-06
FORMULA_NAME DES-PT-10b-LTLFireability-07
FORMULA_NAME DES-PT-10b-LTLFireability-08
FORMULA_NAME DES-PT-10b-LTLFireability-09
FORMULA_NAME DES-PT-10b-LTLFireability-10
FORMULA_NAME DES-PT-10b-LTLFireability-11
FORMULA_NAME DES-PT-10b-LTLFireability-12
FORMULA_NAME DES-PT-10b-LTLFireability-13
FORMULA_NAME DES-PT-10b-LTLFireability-14
FORMULA_NAME DES-PT-10b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716343920178
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-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 02:12:01] [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 02:12:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:12:01] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-22 02:12:01] [INFO ] Transformed 320 places.
[2024-05-22 02:12:01] [INFO ] Transformed 271 transitions.
[2024-05-22 02:12:01] [INFO ] Found NUPN structural information;
[2024-05-22 02:12:01] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-10b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 271
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 296 transition count 250
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 296 transition count 250
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 286 transition count 240
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 286 transition count 240
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 286 transition count 233
Applied a total of 72 rules in 87 ms. Remains 286 /320 variables (removed 34) and now considering 233/271 (removed 38) transitions.
// Phase 1: matrix 233 rows 286 cols
[2024-05-22 02:12:01] [INFO ] Computed 62 invariants in 23 ms
[2024-05-22 02:12:02] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-22 02:12:02] [INFO ] Invariant cache hit.
[2024-05-22 02:12:02] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-22 02:12:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/286 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 233/519 variables, 286/348 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 02:12:06] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 12 ms to minimize.
[2024-05-22 02:12:06] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:12:06] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:12:07] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:12:07] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:12:07] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:12:07] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:12:07] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:12:07] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:12:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:12:07] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:12:07] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:12:07] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:12:07] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-22 02:12:07] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:12:07] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-22 02:12:08] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 5 ms to minimize.
[2024-05-22 02:12:08] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-22 02:12:08] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:12:08] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 20/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 02:12:09] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
[2024-05-22 02:12:10] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 02:12:12] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:12:12] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:12:13] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:12:13] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 02:12:14] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:12:15] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/519 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/519 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 02:12:19] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:12:19] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:12:19] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-05-22 02:12:19] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/519 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 02:12:21] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/519 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 02:12:22] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-05-22 02:12:22] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 5 ms to minimize.
[2024-05-22 02:12:22] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:12:22] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:12:23] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:12:23] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-22 02:12:24] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 7/388 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 02:12:25] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-22 02:12:26] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 02:12:29] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/519 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/519 variables, and 391 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/286 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 43/105 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 02:12:33] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-05-22 02:12:34] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:12:34] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-05-22 02:12:34] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:12:35] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:12:35] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 02:12:35] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:12:35] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:12:36] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 02:12:37] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:12:37] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:12:37] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:12:37] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:12:37] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 4 ms to minimize.
[2024-05-22 02:12:37] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:12:37] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:12:37] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:12:38] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:12:38] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-22 02:12:38] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-05-22 02:12:38] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:12:38] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:12:39] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:12:39] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 15/129 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (OVERLAPS) 233/519 variables, 286/415 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/519 variables, 232/647 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-22 02:12:45] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-22 02:12:45] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:12:50] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
[2024-05-22 02:12:50] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/519 variables, 4/651 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 651 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 71/71 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 286/320 places, 233/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60804 ms. Remains : 286/320 places, 233/271 transitions.
Support contains 42 out of 286 places after structural reductions.
[2024-05-22 02:13:02] [INFO ] Flatten gal took : 43 ms
[2024-05-22 02:13:02] [INFO ] Flatten gal took : 22 ms
[2024-05-22 02:13:02] [INFO ] Input system was already deterministic with 233 transitions.
Support contains 41 out of 286 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (352 resets) in 1237 ms. (32 steps per ms) remains 4/31 properties
BEST_FIRST walk for 40004 steps (51 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (53 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (52 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (48 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
[2024-05-22 02:13:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/184 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 81/265 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/268 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 218/486 variables, 268/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 02:13:03] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 19/505 variables, 11/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 02:13:04] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/505 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/505 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 6/511 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/515 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/519 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/519 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/519 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 350 constraints, problems are : Problem set: 0 solved, 4 unsolved in 971 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/184 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 81/265 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/268 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 218/486 variables, 268/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 02:13:04] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-05-22 02:13:04] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-22 02:13:04] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 19/505 variables, 11/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/505 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 02:13:05] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-22 02:13:05] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:13:05] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/505 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 6/511 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/511 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 4/515 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/515 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 4/519 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/519 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/519 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 519/519 variables, and 360 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1307 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 2298ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4264 ms.
Support contains 8 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 282 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 282 transition count 211
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 266 transition count 211
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 266 transition count 199
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 254 transition count 199
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 248 transition count 193
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 248 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 76 place count 248 transition count 188
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 247 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 78 place count 247 transition count 186
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 80 place count 246 transition count 186
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 82 place count 244 transition count 184
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 244 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 86 place count 244 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 86 place count 244 transition count 181
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 88 place count 243 transition count 181
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 236 place count 169 transition count 107
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 240 place count 167 transition count 109
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 167 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 166 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 243 place count 165 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 244 place count 164 transition count 107
Applied a total of 244 rules in 127 ms. Remains 164 /286 variables (removed 122) and now considering 107/233 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 164/286 places, 107/233 transitions.
RANDOM walk for 40000 steps (1706 resets) in 671 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (342 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (332 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (341 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (316 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 976493 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :0 out of 4
Probabilistic random walk after 976493 steps, saw 144065 distinct states, run finished after 3011 ms. (steps per millisecond=324 ) properties seen :0
// Phase 1: matrix 107 rows 164 cols
[2024-05-22 02:13:13] [INFO ] Computed 63 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 75/91 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 68/159 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/160 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 107/267 variables, 160/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 02:13:13] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/271 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/271 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 228 constraints, problems are : Problem set: 0 solved, 4 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 75/91 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 68/159 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/160 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 107/267 variables, 160/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 02:13:14] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:13:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 4/271 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/271 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/271 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 02:13:14] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/271 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/271 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/271 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 235 constraints, problems are : Problem set: 0 solved, 4 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 843ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2010 ms.
Support contains 8 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 164/164 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-22 02:13:16] [INFO ] Invariant cache hit.
[2024-05-22 02:13:16] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-22 02:13:16] [INFO ] Invariant cache hit.
[2024-05-22 02:13:16] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-22 02:13:16] [INFO ] Redundant transitions in 2 ms returned []
Running 104 sub problems to find dead transitions.
[2024-05-22 02:13:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 2/163 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 104 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/164 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 107/271 variables, 164/227 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 02:13:19] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-22 02:13:19] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/271 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 02:13:19] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 02:13:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 02:13:21] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/271 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 02:13:21] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/271 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 02:13:22] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/271 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/271 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 18 (OVERLAPS) 0/271 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 234 constraints, problems are : Problem set: 0 solved, 104 unsolved in 6882 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 2/163 variables, 32/47 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 1/164 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 107/271 variables, 164/234 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 104/338 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 02:13:25] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:13:26] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 02:13:26] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:13:26] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 02:13:33] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:13:34] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:13:35] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/271 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/271 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 16 (OVERLAPS) 0/271 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 345 constraints, problems are : Problem set: 0 solved, 104 unsolved in 24727 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 14/14 constraints]
After SMT, in 31653ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 31656ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31955 ms. Remains : 164/164 places, 107/107 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 10 ms. Remains 164 /164 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-22 02:13:48] [INFO ] Invariant cache hit.
[2024-05-22 02:13:48] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 02:13:48] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 7 ms returned sat
[2024-05-22 02:13:48] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 02:13:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 02:13:48] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 8 ms returned sat
[2024-05-22 02:13:48] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 02:13:48] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 02:13:48] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 344 ms.
FORMULA DES-PT-10b-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DES-PT-10b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 97 stabilizing places and 89 stable transitions
Graph (complete) has 555 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(F(p1))))&&X(p2)))'
Support contains 4 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 278 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 278 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 278 transition count 221
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 274 transition count 217
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 274 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 274 transition count 214
Applied a total of 31 rules in 34 ms. Remains 274 /286 variables (removed 12) and now considering 214/233 (removed 19) transitions.
// Phase 1: matrix 214 rows 274 cols
[2024-05-22 02:13:49] [INFO ] Computed 62 invariants in 4 ms
[2024-05-22 02:13:49] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 02:13:49] [INFO ] Invariant cache hit.
[2024-05-22 02:13:49] [INFO ] Implicit Places using invariants and state equation in 239 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 370 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/286 places, 214/233 transitions.
Applied a total of 0 rules in 7 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 411 ms. Remains : 273/286 places, 214/233 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : DES-PT-10b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA DES-PT-10b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-01 finished in 720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1))&&(G(p3)||p2))))'
Support contains 6 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 278 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 278 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 278 transition count 221
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 274 transition count 217
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 274 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 274 transition count 214
Applied a total of 31 rules in 12 ms. Remains 274 /286 variables (removed 12) and now considering 214/233 (removed 19) transitions.
[2024-05-22 02:13:49] [INFO ] Invariant cache hit.
[2024-05-22 02:13:49] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-22 02:13:49] [INFO ] Invariant cache hit.
[2024-05-22 02:13:50] [INFO ] Implicit Places using invariants and state equation in 239 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 357 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/286 places, 214/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 273/286 places, 214/233 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p3)]
Running random walk in product with property : DES-PT-10b-LTLFireability-02
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-02 finished in 612 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((G(p0) U p1))))'
Support contains 3 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 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 277 transition count 212
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 262 transition count 212
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 262 transition count 201
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 53 place count 251 transition count 201
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 246 transition count 196
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 246 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 67 place count 246 transition count 192
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 245 transition count 191
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 245 transition count 190
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 244 transition count 190
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 73 place count 242 transition count 188
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 242 transition count 188
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 242 transition count 186
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 227 place count 167 transition count 111
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 165 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 163 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 162 transition count 111
Applied a total of 234 rules in 52 ms. Remains 162 /286 variables (removed 124) and now considering 111/233 (removed 122) transitions.
// Phase 1: matrix 111 rows 162 cols
[2024-05-22 02:13:50] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 02:13:50] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-22 02:13:50] [INFO ] Invariant cache hit.
[2024-05-22 02:13:50] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-22 02:13:50] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-22 02:13:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 3/161 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 111/272 variables, 161/219 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:13:51] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:13:51] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/273 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:13:53] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:13:54] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:13:55] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (OVERLAPS) 0/273 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 225 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6155 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 3/161 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:13:57] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 111/272 variables, 161/225 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 107/332 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 1/273 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:14:03] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 14 (OVERLAPS) 0/273 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 334 constraints, problems are : Problem set: 0 solved, 107 unsolved in 19672 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 7/7 constraints]
After SMT, in 25850ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 25852ms
Starting structural reductions in SI_LTL mode, iteration 1 : 162/286 places, 111/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26146 ms. Remains : 162/286 places, 111/233 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLFireability-05
Stuttering criterion allowed to conclude after 2277 steps with 125 reset in 19 ms.
FORMULA DES-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-05 finished in 26302 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)))'
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 277 transition count 213
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 263 transition count 213
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 263 transition count 202
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 51 place count 252 transition count 202
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 246 transition count 196
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 246 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 68 place count 246 transition count 191
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 245 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 70 place count 245 transition count 189
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 72 place count 244 transition count 189
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 74 place count 242 transition count 187
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 242 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 242 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 242 transition count 184
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 80 place count 241 transition count 184
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 232 place count 165 transition count 108
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 236 place count 163 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 162 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 161 transition count 109
Applied a total of 238 rules in 49 ms. Remains 161 /286 variables (removed 125) and now considering 109/233 (removed 124) transitions.
// Phase 1: matrix 109 rows 161 cols
[2024-05-22 02:14:16] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 02:14:16] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-22 02:14:16] [INFO ] Invariant cache hit.
[2024-05-22 02:14:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 02:14:17] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-22 02:14:17] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-22 02:14:17] [INFO ] Invariant cache hit.
[2024-05-22 02:14:17] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 25/55 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/160 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 109/269 variables, 160/218 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/270 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/270 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 225 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2957 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 161/161 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 25/55 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/160 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:14:20] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 109/269 variables, 160/219 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 107/332 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:14:22] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-22 02:14:22] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 1/270 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:14:27] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:14:27] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-22 02:14:27] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:14:27] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:14:27] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:14:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:14:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 15 (OVERLAPS) 0/270 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 342 constraints, problems are : Problem set: 0 solved, 107 unsolved in 27461 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 161/161 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 10/10 constraints]
After SMT, in 30441ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 30442ms
Starting structural reductions in SI_LTL mode, iteration 1 : 161/286 places, 109/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30744 ms. Remains : 161/286 places, 109/233 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-06
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-06 finished in 30797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F((F(G(F(p0)))||p1)))) U p2))'
Support contains 4 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 279 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 278 transition count 214
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 264 transition count 214
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 264 transition count 203
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 51 place count 253 transition count 203
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 247 transition count 197
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 247 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 68 place count 247 transition count 192
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 246 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 70 place count 246 transition count 190
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 72 place count 245 transition count 190
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 74 place count 243 transition count 188
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 243 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 243 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 243 transition count 185
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 242 transition count 185
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 228 place count 168 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 167 transition count 111
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 167 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 165 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 164 transition count 109
Applied a total of 234 rules in 39 ms. Remains 164 /286 variables (removed 122) and now considering 109/233 (removed 124) transitions.
// Phase 1: matrix 109 rows 164 cols
[2024-05-22 02:14:47] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 02:14:47] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-22 02:14:47] [INFO ] Invariant cache hit.
[2024-05-22 02:14:47] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-05-22 02:14:47] [INFO ] Redundant transitions in 1 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-22 02:14:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/162 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 2/164 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 109/273 variables, 164/222 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-22 02:14:49] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:14:49] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:14:49] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:14:49] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:14:50] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:14:50] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:14:50] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:14:50] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:14:50] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 9/231 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/273 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 231 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4193 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 1/162 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 2/164 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 109/273 variables, 164/231 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 106/337 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-22 02:14:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:14:54] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 02:14:56] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-22 02:15:04] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/273 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-22 02:15:16] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:15:17] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-22 02:15:17] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/273 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 344 constraints, problems are : Problem set: 0 solved, 106 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 16/16 constraints]
After SMT, in 34226ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 34228ms
Starting structural reductions in SI_LTL mode, iteration 1 : 164/286 places, 109/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34545 ms. Remains : 164/286 places, 109/233 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-10b-LTLFireability-07
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-07 finished in 34711 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 1 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 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 277 transition count 212
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 262 transition count 212
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 262 transition count 201
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 251 transition count 201
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 246 transition count 196
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 246 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 68 place count 246 transition count 191
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 245 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 70 place count 245 transition count 189
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 72 place count 244 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 243 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 243 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 243 transition count 187
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 166 transition count 110
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 164 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 162 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 161 transition count 110
Applied a total of 236 rules in 29 ms. Remains 161 /286 variables (removed 125) and now considering 110/233 (removed 123) transitions.
// Phase 1: matrix 110 rows 161 cols
[2024-05-22 02:15:22] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 02:15:22] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 02:15:22] [INFO ] Invariant cache hit.
[2024-05-22 02:15:22] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-22 02:15:22] [INFO ] Redundant transitions in 1 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-22 02:15:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/160 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 110/270 variables, 160/218 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:15:23] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:15:24] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:15:24] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:15:25] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-22 02:15:25] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 1/271 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:15:25] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (OVERLAPS) 0/271 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 225 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 2/160 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 110/270 variables, 160/224 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 107/331 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:15:29] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:15:29] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:15:30] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 1/271 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:15:44] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/271 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 14 (OVERLAPS) 0/271 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 336 constraints, problems are : Problem set: 0 solved, 107 unsolved in 28094 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 10/10 constraints]
After SMT, in 33144ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 33145ms
Starting structural reductions in SI_LTL mode, iteration 1 : 161/286 places, 110/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33461 ms. Remains : 161/286 places, 110/233 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-08
Stuttering criterion allowed to conclude after 49 steps with 2 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-08 finished in 33546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||G(p2)))))'
Support contains 3 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 280 transition count 227
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 280 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 280 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 277 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 277 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 277 transition count 219
Applied a total of 23 rules in 11 ms. Remains 277 /286 variables (removed 9) and now considering 219/233 (removed 14) transitions.
// Phase 1: matrix 219 rows 277 cols
[2024-05-22 02:15:55] [INFO ] Computed 62 invariants in 2 ms
[2024-05-22 02:15:55] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-22 02:15:55] [INFO ] Invariant cache hit.
[2024-05-22 02:15:56] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 368 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 276/286 places, 219/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 276 /276 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 382 ms. Remains : 276/286 places, 219/233 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-10b-LTLFireability-09
Product exploration explored 100000 steps with 906 reset in 283 ms.
Product exploration explored 100000 steps with 910 reset in 334 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 535 edges and 276 vertex of which 271 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 115 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false]
RANDOM walk for 40000 steps (344 resets) in 177 ms. (224 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40004 steps (53 resets) in 243 ms. (163 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (56 resets) in 266 ms. (149 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (52 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (56 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (54 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
// Phase 1: matrix 219 rows 276 cols
[2024-05-22 02:15:57] [INFO ] Computed 61 invariants in 1 ms
Problem apf5 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 17/20 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 153/173 variables, 32/34 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/245 variables, 24/58 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/58 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/260 variables, 3/61 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/61 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 206/466 variables, 260/321 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/321 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/485 variables, 11/332 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 0/332 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/491 variables, 3/335 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 0/335 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/493 variables, 1/336 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/336 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/495 variables, 1/337 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/495 variables, 0/337 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/495 variables, 0/337 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 337 constraints, problems are : Problem set: 4 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/173 variables, 32/34 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/245 variables, 24/58 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-22 02:15:58] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 1/59 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/59 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/260 variables, 3/62 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 0/62 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 206/466 variables, 260/322 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 1/323 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/323 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/485 variables, 11/334 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/485 variables, 0/334 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 491/495 variables, and 337 constraints, problems are : Problem set: 5 solved, 0 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 274/276 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 419ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 p1)), (G (OR p0 (NOT p2) (NOT p1))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 20 factoid took 344 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[false, false, false]
Stuttering acceptance computed with spot in 110 ms :[false, false, false]
Support contains 3 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 219/219 transitions.
Graph (complete) has 535 edges and 276 vertex of which 271 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 270 transition count 201
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 256 transition count 201
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 256 transition count 189
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 53 place count 244 transition count 189
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 2 with 152 rules applied. Total rules applied 205 place count 168 transition count 113
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 209 place count 166 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 211 place count 164 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 163 transition count 113
Applied a total of 212 rules in 23 ms. Remains 163 /276 variables (removed 113) and now considering 113/219 (removed 106) transitions.
// Phase 1: matrix 113 rows 163 cols
[2024-05-22 02:15:58] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 02:15:58] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 02:15:58] [INFO ] Invariant cache hit.
[2024-05-22 02:15:58] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-22 02:15:58] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-22 02:15:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 3/162 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 113/275 variables, 162/220 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 1/276 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:16:01] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:16:01] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:16:02] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:16:02] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:16:02] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:16:03] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-22 02:16:03] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:16:05] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/276 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:16:05] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:16:05] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/276 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 16 (OVERLAPS) 0/276 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 231 constraints, problems are : Problem set: 0 solved, 109 unsolved in 8893 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 3/162 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 113/275 variables, 162/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 109/339 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 1/276 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/276 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 340 constraints, problems are : Problem set: 0 solved, 109 unsolved in 18231 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 10/10 constraints]
After SMT, in 27146ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 27147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 163/276 places, 113/219 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27398 ms. Remains : 163/276 places, 113/219 transitions.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[false, false, false]
RANDOM walk for 1769 steps (88 resets) in 21 ms. (80 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 9 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[false, false, false]
Stuttering acceptance computed with spot in 114 ms :[false, false, false]
Stuttering acceptance computed with spot in 100 ms :[false, false, false]
Product exploration explored 100000 steps with 5244 reset in 299 ms.
Product exploration explored 100000 steps with 5343 reset in 242 ms.
Built C files in :
/tmp/ltsmin13701319929084745847
[2024-05-22 02:16:27] [INFO ] Computing symmetric may disable matrix : 113 transitions.
[2024-05-22 02:16:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:16:27] [INFO ] Computing symmetric may enable matrix : 113 transitions.
[2024-05-22 02:16:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:16:27] [INFO ] Computing Do-Not-Accords matrix : 113 transitions.
[2024-05-22 02:16:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:16:27] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13701319929084745847
Running compilation step : cd /tmp/ltsmin13701319929084745847;'/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 386 ms.
Running link step : cd /tmp/ltsmin13701319929084745847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13701319929084745847;'/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/stateBased13348714030702039458.hoa' '--buchi-type=spotba'
LTSmin run took 758 ms.
FORMULA DES-PT-10b-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10b-LTLFireability-09 finished in 33022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (!p1&&G(p2))))'
Support contains 5 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 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 277 transition count 214
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 264 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 263 transition count 213
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 29 place count 263 transition count 203
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 49 place count 253 transition count 203
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 55 place count 247 transition count 197
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 247 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 66 place count 247 transition count 192
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 246 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 68 place count 246 transition count 190
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 70 place count 245 transition count 190
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 72 place count 243 transition count 188
Iterating global reduction 5 with 2 rules applied. Total rules applied 74 place count 243 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 76 place count 243 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 76 place count 243 transition count 185
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 78 place count 242 transition count 185
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 6 with 148 rules applied. Total rules applied 226 place count 168 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 228 place count 167 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 165 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 164 transition count 109
Applied a total of 231 rules in 32 ms. Remains 164 /286 variables (removed 122) and now considering 109/233 (removed 124) transitions.
// Phase 1: matrix 109 rows 164 cols
[2024-05-22 02:16:28] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 02:16:28] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-22 02:16:28] [INFO ] Invariant cache hit.
[2024-05-22 02:16:29] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-05-22 02:16:29] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-22 02:16:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/161 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/163 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 109/272 variables, 163/221 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:16:30] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:16:31] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 1/273 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:16:31] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:16:32] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:16:32] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:16:32] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-22 02:16:32] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (OVERLAPS) 0/273 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 229 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5232 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 2/163 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 109/272 variables, 163/228 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 105/333 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (OVERLAPS) 1/273 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:16:41] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-22 02:16:41] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-22 02:16:41] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:16:41] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/273 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/273 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 17 (OVERLAPS) 0/273 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 338 constraints, problems are : Problem set: 0 solved, 105 unsolved in 15952 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 11/11 constraints]
After SMT, in 21204ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 21206ms
Starting structural reductions in SI_LTL mode, iteration 1 : 164/286 places, 109/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21484 ms. Remains : 164/286 places, 109/233 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Running random walk in product with property : DES-PT-10b-LTLFireability-10
Product exploration explored 100000 steps with 3820 reset in 240 ms.
Product exploration explored 100000 steps with 3816 reset in 196 ms.
Computed a total of 57 stabilizing places and 52 stable transitions
Computed a total of 57 stabilizing places and 52 stable transitions
Detected a total of 57/164 stabilizing places and 52/109 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT (OR p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 255 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 14474 steps (565 resets) in 46 ms. (307 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT (OR p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 10 factoid took 415 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-22 02:16:51] [INFO ] Invariant cache hit.
[2024-05-22 02:16:52] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 02:16:52] [INFO ] Invariant cache hit.
[2024-05-22 02:16:52] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-22 02:16:52] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-22 02:16:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/161 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/163 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 109/272 variables, 163/221 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:16:54] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-22 02:16:54] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 1/273 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:16:55] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:16:55] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:16:55] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:16:55] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:16:55] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (OVERLAPS) 0/273 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 229 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5213 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 2/163 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 109/272 variables, 163/228 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 105/333 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (OVERLAPS) 1/273 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:17:04] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-22 02:17:04] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-22 02:17:04] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:17:04] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/273 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/273 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 17 (OVERLAPS) 0/273 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 338 constraints, problems are : Problem set: 0 solved, 105 unsolved in 16157 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 11/11 constraints]
After SMT, in 21390ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 21391ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21650 ms. Remains : 164/164 places, 109/109 transitions.
Computed a total of 57 stabilizing places and 52 stable transitions
Computed a total of 57 stabilizing places and 52 stable transitions
Detected a total of 57/164 stabilizing places and 52/109 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT (OR p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 261 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 15995 steps (604 resets) in 45 ms. (347 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT (OR p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 10 factoid took 443 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 3813 reset in 179 ms.
Product exploration explored 100000 steps with 3828 reset in 194 ms.
Built C files in :
/tmp/ltsmin16143338245444288861
[2024-05-22 02:17:15] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2024-05-22 02:17:15] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:17:15] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2024-05-22 02:17:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:17:15] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2024-05-22 02:17:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:17:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16143338245444288861
Running compilation step : cd /tmp/ltsmin16143338245444288861;'/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 288 ms.
Running link step : cd /tmp/ltsmin16143338245444288861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin16143338245444288861;'/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/stateBased4410397099531399945.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 109/109 transitions.
Applied a total of 0 rules in 9 ms. Remains 164 /164 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-22 02:17:30] [INFO ] Invariant cache hit.
[2024-05-22 02:17:30] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-22 02:17:30] [INFO ] Invariant cache hit.
[2024-05-22 02:17:30] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-22 02:17:30] [INFO ] Redundant transitions in 0 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-22 02:17:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/161 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/163 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 109/272 variables, 163/221 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:17:32] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:17:32] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 1/273 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:17:33] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:17:33] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-22 02:17:33] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:17:34] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:17:34] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (OVERLAPS) 0/273 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 229 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5230 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/161 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 2/163 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 109/272 variables, 163/228 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 105/333 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (OVERLAPS) 1/273 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:17:42] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:17:42] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:17:43] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:17:43] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/273 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/273 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 17 (OVERLAPS) 0/273 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 338 constraints, problems are : Problem set: 0 solved, 105 unsolved in 16125 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 11/11 constraints]
After SMT, in 21376ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 21377ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21653 ms. Remains : 164/164 places, 109/109 transitions.
Built C files in :
/tmp/ltsmin5213448598814376706
[2024-05-22 02:17:51] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2024-05-22 02:17:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:17:51] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2024-05-22 02:17:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:17:51] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2024-05-22 02:17:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:17:51] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5213448598814376706
Running compilation step : cd /tmp/ltsmin5213448598814376706;'/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 278 ms.
Running link step : cd /tmp/ltsmin5213448598814376706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5213448598814376706;'/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/stateBased3495302438745865422.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 02:18:07] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:18:07] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:18:07] [INFO ] Time to serialize gal into /tmp/LTL6793574444614698066.gal : 3 ms
[2024-05-22 02:18:07] [INFO ] Time to serialize properties into /tmp/LTL5445496305101816947.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/LTL6793574444614698066.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14963473842469941188.hoa' '-atoms' '/tmp/LTL5445496305101816947.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/LTL5445496305101816947.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14963473842469941188.hoa
Detected timeout of ITS tools.
[2024-05-22 02:18:22] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:18:22] [INFO ] Flatten gal took : 14 ms
[2024-05-22 02:18:22] [INFO ] Time to serialize gal into /tmp/LTL10989219706770504636.gal : 5 ms
[2024-05-22 02:18:22] [INFO ] Time to serialize properties into /tmp/LTL4068428231187869993.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/LTL10989219706770504636.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4068428231187869993.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("(p186!=1)")))U((!("(((p112==1)&&(p271==1))&&(p83==1))"))&&(G("(p311!=1)")))))
Formula 0 simplified : GF!"(p186!=1)" R ("(((p112==1)&&(p271==1))&&(p83==1))" | F!"(p311!=1)")
Detected timeout of ITS tools.
[2024-05-22 02:18:37] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:18:37] [INFO ] Applying decomposition
[2024-05-22 02:18:37] [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/graph18443499975370212870.txt' '-o' '/tmp/graph18443499975370212870.bin' '-w' '/tmp/graph18443499975370212870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18443499975370212870.bin' '-l' '-1' '-v' '-w' '/tmp/graph18443499975370212870.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:18:37] [INFO ] Decomposing Gal with order
[2024-05-22 02:18:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:18:37] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-22 02:18:37] [INFO ] Flatten gal took : 52 ms
[2024-05-22 02:18:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 6 ms.
[2024-05-22 02:18:37] [INFO ] Time to serialize gal into /tmp/LTL1273211989527560552.gal : 4 ms
[2024-05-22 02:18:37] [INFO ] Time to serialize properties into /tmp/LTL7154999369797301127.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/LTL1273211989527560552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7154999369797301127.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("(i1.u13.p186!=1)")))U((!("(((i2.u6.p112==1)&&(i2.u6.p271==1))&&(i0.u3.p83==1))"))&&(G("(i14.u42.p311!=1)")))))
Formula 0 simplified : GF!"(i1.u13.p186!=1)" R ("(((i2.u6.p112==1)&&(i2.u6.p271==1))&&(i0.u3.p83==1))" | F!"(i14.u42.p311!=1)")
Reverse transition relation is NOT exact ! Due to transitions t7_t48, t222_t79, t36_t38_t49_t65_t66_t67_t68_t69_t70_t71_t50_t52_t54_t56_t58_t60_t62, t9_t34...557
Computing Next relation with stutter on 6.47736e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-10b-LTLFireability-10 finished in 143721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 3 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 278 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 278 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 278 transition count 221
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 274 transition count 217
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 274 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 274 transition count 214
Applied a total of 31 rules in 15 ms. Remains 274 /286 variables (removed 12) and now considering 214/233 (removed 19) transitions.
// Phase 1: matrix 214 rows 274 cols
[2024-05-22 02:18:52] [INFO ] Computed 62 invariants in 2 ms
[2024-05-22 02:18:52] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 02:18:52] [INFO ] Invariant cache hit.
[2024-05-22 02:18:52] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 377 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/286 places, 214/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 395 ms. Remains : 273/286 places, 214/233 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-10b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1902 steps with 17 reset in 6 ms.
FORMULA DES-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-12 finished in 577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))||G((p2&&X(p3))))))'
Support contains 7 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 277 transition count 213
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 263 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 262 transition count 212
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 31 place count 262 transition count 201
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 53 place count 251 transition count 201
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 57 place count 247 transition count 197
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 247 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 247 transition count 195
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 245 transition count 193
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 245 transition count 193
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 245 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 69 place count 245 transition count 190
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 71 place count 244 transition count 190
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 211 place count 174 transition count 120
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 217 place count 171 transition count 126
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 221 place count 171 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 169 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 224 place count 168 transition count 120
Applied a total of 224 rules in 43 ms. Remains 168 /286 variables (removed 118) and now considering 120/233 (removed 113) transitions.
// Phase 1: matrix 120 rows 168 cols
[2024-05-22 02:18:53] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 02:18:53] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 02:18:53] [INFO ] Invariant cache hit.
[2024-05-22 02:18:53] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-22 02:18:53] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-22 02:18:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 2/166 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/168 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 120/288 variables, 168/226 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-22 02:18:55] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 4 ms to minimize.
[2024-05-22 02:18:55] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-22 02:18:56] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-22 02:18:57] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:18:57] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:18:57] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-22 02:18:57] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/288 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-22 02:18:58] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 15 (OVERLAPS) 0/288 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 234 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6604 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 2/166 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 2/168 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 120/288 variables, 168/234 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 116/350 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-22 02:19:02] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:19:02] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:19:02] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-22 02:19:08] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-22 02:19:11] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/288 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/288 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-22 02:19:25] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/288 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 288/288 variables, and 356 constraints, problems are : Problem set: 0 solved, 116 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 14/14 constraints]
After SMT, in 36634ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 36636ms
Starting structural reductions in SI_LTL mode, iteration 1 : 168/286 places, 120/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37011 ms. Remains : 168/286 places, 120/233 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : DES-PT-10b-LTLFireability-14
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-14 finished in 37132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (!p1&&G(p2))))'
[2024-05-22 02:19:30] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6048600129893519835
[2024-05-22 02:19:30] [INFO ] Computing symmetric may disable matrix : 233 transitions.
[2024-05-22 02:19:30] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:19:30] [INFO ] Computing symmetric may enable matrix : 233 transitions.
[2024-05-22 02:19:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:19:30] [INFO ] Applying decomposition
[2024-05-22 02:19:30] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:19:30] [INFO ] Computing Do-Not-Accords matrix : 233 transitions.
[2024-05-22 02:19:30] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:19:30] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6048600129893519835
Running compilation step : cd /tmp/ltsmin6048600129893519835;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17383649192773009131.txt' '-o' '/tmp/graph17383649192773009131.bin' '-w' '/tmp/graph17383649192773009131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17383649192773009131.bin' '-l' '-1' '-v' '-w' '/tmp/graph17383649192773009131.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:19:30] [INFO ] Decomposing Gal with order
[2024-05-22 02:19:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:19:30] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-22 02:19:30] [INFO ] Flatten gal took : 20 ms
[2024-05-22 02:19:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 7 ms.
[2024-05-22 02:19:30] [INFO ] Time to serialize gal into /tmp/LTLFireability16004471996659346815.gal : 5 ms
[2024-05-22 02:19:30] [INFO ] Time to serialize properties into /tmp/LTLFireability743451805432112291.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/LTLFireability16004471996659346815.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability743451805432112291.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(G("(i12.u38.p186!=1)")))U((!("(((i5.i0.u18.p112==1)&&(i8.i2.u59.p271==1))&&(i2.u11.p83==1))"))&&(G("(i12.u77.p311!=1)")))))
Formula 0 simplified : GF!"(i12.u38.p186!=1)" R ("(((i5.i0.u18.p112==1)&&(i8.i2.u59.p271==1))&&(i2.u11.p83==1))" | F!"(i12.u77.p311!=1)")
Compilation finished in 524 ms.
Running link step : cd /tmp/ltsmin6048600129893519835;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6048600129893519835;'/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))) U (!(LTLAPp1==true)&&[]((LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t58, t93, t170, t189, t190, t222, i0.u34.t79, i1.t130, i1.u6.t135, i1.u6.t137, ...857
Computing Next relation with stutter on 2.90648e+07 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Initializing POR dependencies: labels 236, guards 233
pins2lts-mc-linux64( 7/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.452: LTL layer: formula: (<>([]((LTLAPp0==true))) U (!(LTLAPp1==true)&&[]((LTLAPp2==true))))
pins2lts-mc-linux64( 3/ 8), 0.452: "(<>([]((LTLAPp0==true))) U (!(LTLAPp1==true)&&[]((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.452: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.566: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.582: There are 237 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.582: State length is 287, there are 245 groups
pins2lts-mc-linux64( 0/ 8), 0.582: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.582: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.582: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.582: Visible groups: 0 / 245, labels: 3 / 237
pins2lts-mc-linux64( 0/ 8), 0.582: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.582: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.612: [Blue] ~87 levels ~960 states ~1240 transitions
pins2lts-mc-linux64( 6/ 8), 0.624: [Blue] ~98 levels ~1920 states ~2696 transitions
pins2lts-mc-linux64( 6/ 8), 0.649: [Blue] ~108 levels ~3840 states ~5608 transitions
pins2lts-mc-linux64( 7/ 8), 0.707: [Blue] ~111 levels ~7680 states ~9376 transitions
pins2lts-mc-linux64( 3/ 8), 0.789: [Blue] ~129 levels ~15360 states ~23024 transitions
pins2lts-mc-linux64( 2/ 8), 0.960: [Blue] ~128 levels ~30720 states ~44704 transitions
pins2lts-mc-linux64( 0/ 8), 1.197: [Blue] ~128 levels ~61440 states ~92056 transitions
pins2lts-mc-linux64( 0/ 8), 1.822: [Blue] ~128 levels ~122880 states ~185576 transitions
pins2lts-mc-linux64( 0/ 8), 2.995: [Blue] ~131 levels ~245760 states ~383728 transitions
pins2lts-mc-linux64( 0/ 8), 5.001: [Blue] ~131 levels ~491520 states ~825408 transitions
pins2lts-mc-linux64( 2/ 8), 8.089: [Blue] ~136 levels ~983040 states ~1282816 transitions
pins2lts-mc-linux64( 6/ 8), 13.943: [Blue] ~1212 levels ~1966080 states ~3277040 transitions
pins2lts-mc-linux64( 0/ 8), 25.217: [Blue] ~1219 levels ~3932160 states ~5597792 transitions
pins2lts-mc-linux64( 6/ 8), 47.584: [Blue] ~1250 levels ~7864320 states ~11167928 transitions
pins2lts-mc-linux64( 6/ 8), 93.493: [Blue] ~2448 levels ~15728640 states ~21618152 transitions
pins2lts-mc-linux64( 6/ 8), 188.886: [Blue] ~6613 levels ~31457280 states ~42358312 transitions
pins2lts-mc-linux64( 6/ 8), 376.347: [Blue] ~7746 levels ~62914560 states ~83974992 transitions
pins2lts-mc-linux64( 7/ 8), 751.722: [Blue] ~2410 levels ~125829120 states ~160615976 transitions
pins2lts-mc-linux64( 6/ 8), 818.585: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 818.608:
pins2lts-mc-linux64( 0/ 8), 818.608: Explored 134209308 states 179532765 transitions, fanout: 1.338
pins2lts-mc-linux64( 0/ 8), 818.608: Total exploration time 818.010 sec (817.980 sec minimum, 817.994 sec on average)
pins2lts-mc-linux64( 0/ 8), 818.608: States per second: 164068, Transitions per second: 219475
pins2lts-mc-linux64( 0/ 8), 818.608:
pins2lts-mc-linux64( 0/ 8), 818.608: State space has 134217035 states, 659345 are accepting
pins2lts-mc-linux64( 0/ 8), 818.608: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 818.608: blue states: 134209308 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 818.608: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 818.608: all-red states: 955271 (0.71%), bogus 32 (0.00%)
pins2lts-mc-linux64( 0/ 8), 818.608:
pins2lts-mc-linux64( 0/ 8), 818.608: Total memory used for local state coloring: 0.6MB
pins2lts-mc-linux64( 0/ 8), 818.608:
pins2lts-mc-linux64( 0/ 8), 818.608: Queue width: 8B, total height: 36799, memory: 0.28MB
pins2lts-mc-linux64( 0/ 8), 818.608: Tree memory: 1163.3MB, 9.1 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 818.608: Tree fill ratio (roots/leafs): 99.0%/54.0%
pins2lts-mc-linux64( 0/ 8), 818.608: Stored 233 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 818.608: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 818.608: Est. total memory use: 1163.6MB (~1024.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6048600129893519835;'/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))) U (!(LTLAPp1==true)&&[]((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6048600129893519835;'/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))) U (!(LTLAPp1==true)&&[]((LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-22 02:42:00] [INFO ] Applying decomposition
[2024-05-22 02:42:00] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:42:00] [INFO ] Decomposing Gal with order
[2024-05-22 02:42:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:42:00] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-22 02:42:00] [INFO ] Flatten gal took : 17 ms
[2024-05-22 02:42:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 10 ms.
[2024-05-22 02:42:00] [INFO ] Time to serialize gal into /tmp/LTLFireability681358005681355597.gal : 5 ms
[2024-05-22 02:42:00] [INFO ] Time to serialize properties into /tmp/LTLFireability685891781736157907.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/LTLFireability681358005681355597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability685891781736157907.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...274
Read 1 LTL properties
Checking formula 0 : !(((F(G("(i1.i1.i0.i1.i0.i0.i1.u143.p186!=1)")))U((!("(((i1.i0.i1.i0.u23.p112==1)&&(i1.i1.i0.i1.i0.i0.i1.i0.i1.u95.p271==1))&&(i1.i0.i...219
Formula 0 simplified : GF!"(i1.i1.i0.i1.i0.i0.i1.u143.p186!=1)" R ("(((i1.i0.i1.i0.u23.p112==1)&&(i1.i1.i0.i1.i0.i0.i1.i0.i1.u95.p271==1))&&(i1.i0.i0.i0.i0...206
Detected timeout of ITS tools.
[2024-05-22 03:04:29] [INFO ] Flatten gal took : 13 ms
[2024-05-22 03:04:29] [INFO ] Input system was already deterministic with 233 transitions.
[2024-05-22 03:04:29] [INFO ] Transformed 286 places.
[2024-05-22 03:04:29] [INFO ] Transformed 233 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 03:04:29] [INFO ] Time to serialize gal into /tmp/LTLFireability8743929298206105341.gal : 2 ms
[2024-05-22 03:04:29] [INFO ] Time to serialize properties into /tmp/LTLFireability3216500704266237952.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/LTLFireability8743929298206105341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3216500704266237952.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F(G("(p186!=1)")))U((!("(((p112==1)&&(p271==1))&&(p83==1))"))&&(G("(p311!=1)")))))
Formula 0 simplified : GF!"(p186!=1)" R ("(((p112==1)&&(p271==1))&&(p83==1))" | F!"(p311!=1)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t10, t17, t25, t34, t37, t48, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t...487
Computing Next relation with stutter on 2.90648e+07 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-10b"
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-10b, 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-171624189800676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;