MCC'2024- Execution of r356-tall-171683761000396

About the Execution of ITS-Tools for ShieldPPPs-PT-003B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16206.415	3154961.00	5534329.00	7066.00	F?FFFFFFFFFFFFF?	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.r356-tall-171683761000396.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 ShieldPPPs-PT-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761000396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 11:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 11:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 52K May 18 16:43 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 ShieldPPPs-PT-003B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716954678146

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 03:51:19] [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-29 03:51:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:51:19] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-29 03:51:19] [INFO ] Transformed 207 places.
[2024-05-29 03:51:19] [INFO ] Transformed 192 transitions.
[2024-05-29 03:51:19] [INFO ] Found NUPN structural information;
[2024-05-29 03:51:19] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 167 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 ShieldPPPs-PT-003B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 192/192 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 188 transition count 173
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 188 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 187 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 187 transition count 172
Applied a total of 40 rules in 52 ms. Remains 187 /207 variables (removed 20) and now considering 172/192 (removed 20) transitions.
// Phase 1: matrix 172 rows 187 cols
[2024-05-29 03:51:19] [INFO ] Computed 34 invariants in 18 ms
[2024-05-29 03:51:19] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-29 03:51:19] [INFO ] Invariant cache hit.
[2024-05-29 03:51:20] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-29 03:51:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:21] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 17 ms to minimize.
[2024-05-29 03:51:21] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-29 03:51:22] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-29 03:51:22] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 0 ms to minimize.
[2024-05-29 03:51:22] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:51:22] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-29 03:51:22] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-29 03:51:22] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 2 ms to minimize.
[2024-05-29 03:51:22] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-29 03:51:22] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:51:22] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 3 ms to minimize.
[2024-05-29 03:51:22] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 11 ms to minimize.
[2024-05-29 03:51:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:51:23] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2024-05-29 03:51:23] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:51:23] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
[2024-05-29 03:51:23] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:51:23] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:51:23] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:51:23] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:23] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:51:23] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:51:23] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:51:23] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:51:24] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:51:24] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:51:24] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:25] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:51:25] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:51:25] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:51:25] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:26] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:51:26] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 172/359 variables, 187/254 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:28] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:51:28] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:51:28] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:51:28] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:51:28] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:29] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 3 ms to minimize.
[2024-05-29 03:51:29] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:51:29] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:31] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:32] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:33] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:34] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:51:34] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:51:35] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:51:35] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:51:35] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:51:35] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:51:35] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:51:35] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:51:35] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/359 variables, 9/274 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:37] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:51:37] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:51:37] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:51:37] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:51:37] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 4 ms to minimize.
[2024-05-29 03:51:37] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/359 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:39] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:51:40] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:51:40] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:51:40] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:51:40] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/359 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:40] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:51:41] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-29 03:51:41] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:51:41] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:51:41] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-29 03:51:41] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:51:41] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/359 variables, 7/292 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/359 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 20 (OVERLAPS) 0/359 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 292 constraints, problems are : Problem set: 0 solved, 171 unsolved in 24598 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 71/105 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 172/359 variables, 187/292 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 171/463 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:48] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:51:48] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:51:48] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:51:48] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-29 03:51:48] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:51:49] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:51:49] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:51:49] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:51:49] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:51:50] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:51:50] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 11/474 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:51:54] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:51:54] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:51:54] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:51:55] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:51:55] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:51:55] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:51:55] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:51:56] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 8/482 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:52:00] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-29 03:52:00] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-29 03:52:00] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:52:01] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:52:02] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:52:08] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:52:08] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:52:08] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 03:52:14] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
SMT process timed out in 54704ms, After SMT, problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 54717ms
Starting structural reductions in LTL mode, iteration 1 : 187/207 places, 172/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55241 ms. Remains : 187/207 places, 172/192 transitions.
Support contains 26 out of 187 places after structural reductions.
[2024-05-29 03:52:15] [INFO ] Flatten gal took : 41 ms
[2024-05-29 03:52:15] [INFO ] Flatten gal took : 18 ms
[2024-05-29 03:52:15] [INFO ] Input system was already deterministic with 172 transitions.
RANDOM walk for 40000 steps (71 resets) in 774 ms. (51 steps per ms) remains 1/21 properties
BEST_FIRST walk for 5997 steps (1 resets) in 29 ms. (199 steps per ms) remains 0/1 properties
Computed a total of 35 stabilizing places and 35 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 186 transition count 149
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 164 transition count 149
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 164 transition count 134
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 74 place count 149 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 147 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 147 transition count 132
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 176 place count 98 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 96 transition count 81
Applied a total of 178 rules in 42 ms. Remains 96 /187 variables (removed 91) and now considering 81/172 (removed 91) transitions.
// Phase 1: matrix 81 rows 96 cols
[2024-05-29 03:52:15] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 03:52:15] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-29 03:52:15] [INFO ] Invariant cache hit.
[2024-05-29 03:52:15] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-29 03:52:15] [INFO ] Redundant transitions in 2 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-29 03:52:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 2/96 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:52:16] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2024-05-29 03:52:16] [INFO ] Deduced a trap composed of 45 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 81/177 variables, 96/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 132 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1447 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 2/96 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 81/177 variables, 96/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 77/209 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:52:18] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:52:18] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:52:19] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:52:20] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/177 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 213 constraints, problems are : Problem set: 0 solved, 77 unsolved in 6315 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 6/6 constraints]
After SMT, in 7780ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 7783ms
Starting structural reductions in SI_LTL mode, iteration 1 : 96/187 places, 81/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8049 ms. Remains : 96/187 places, 81/172 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-01
Product exploration explored 100000 steps with 1855 reset in 333 ms.
Product exploration explored 100000 steps with 1853 reset in 235 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 213 steps (0 resets) in 8 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 03:52:24] [INFO ] Invariant cache hit.
[2024-05-29 03:52:25] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-29 03:52:25] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-29 03:52:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 03:52:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 03:52:25] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-29 03:52:25] [INFO ] Computed and/alt/rep : 77/151/77 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 03:52:25] [INFO ] Added : 63 causal constraints over 13 iterations in 160 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 03:52:25] [INFO ] Invariant cache hit.
[2024-05-29 03:52:25] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 03:52:25] [INFO ] Invariant cache hit.
[2024-05-29 03:52:25] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-29 03:52:25] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-29 03:52:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 2/96 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:52:25] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:52:26] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 81/177 variables, 96/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 132 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 2/96 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 81/177 variables, 96/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 77/209 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:52:27] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:52:27] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:52:28] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:52:29] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/177 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 213 constraints, problems are : Problem set: 0 solved, 77 unsolved in 6305 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 6/6 constraints]
After SMT, in 7683ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 7684ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7818 ms. Remains : 96/96 places, 81/81 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 96 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 240 steps (0 resets) in 12 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 03:52:33] [INFO ] Invariant cache hit.
[2024-05-29 03:52:33] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 03:52:33] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-29 03:52:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 03:52:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 03:52:33] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-29 03:52:33] [INFO ] Computed and/alt/rep : 77/151/77 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 03:52:33] [INFO ] Added : 63 causal constraints over 13 iterations in 161 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1868 reset in 214 ms.
Product exploration explored 100000 steps with 1854 reset in 204 ms.
Built C files in :
/tmp/ltsmin4997174340209566676
[2024-05-29 03:52:34] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-29 03:52:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:52:34] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-29 03:52:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:52:34] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-29 03:52:34] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:52:34] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4997174340209566676
Running compilation step : cd /tmp/ltsmin4997174340209566676;'/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 319 ms.
Running link step : cd /tmp/ltsmin4997174340209566676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4997174340209566676;'/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/stateBased14242740228823375052.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 03:52:49] [INFO ] Invariant cache hit.
[2024-05-29 03:52:49] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 03:52:49] [INFO ] Invariant cache hit.
[2024-05-29 03:52:49] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-29 03:52:49] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-29 03:52:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 2/96 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:52:50] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:52:50] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 81/177 variables, 96/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 132 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1370 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 2/96 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 81/177 variables, 96/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 77/209 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:52:51] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:52:51] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:52:52] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:52:53] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/177 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 213 constraints, problems are : Problem set: 0 solved, 77 unsolved in 6292 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 6/6 constraints]
After SMT, in 7673ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 7675ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7839 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin2524962745328899449
[2024-05-29 03:52:57] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-29 03:52:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:52:57] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-29 03:52:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:52:57] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-29 03:52:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:52:57] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2524962745328899449
Running compilation step : cd /tmp/ltsmin2524962745328899449;'/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 204 ms.
Running link step : cd /tmp/ltsmin2524962745328899449;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2524962745328899449;'/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/stateBased12686690558992659790.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:53:12] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:53:12] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:53:12] [INFO ] Time to serialize gal into /tmp/LTL6948125761604526330.gal : 16 ms
[2024-05-29 03:53:12] [INFO ] Time to serialize properties into /tmp/LTL11066276590236868575.prop : 8 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/LTL6948125761604526330.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16255963726950118880.hoa' '-atoms' '/tmp/LTL11066276590236868575.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((p16==1)&&(p51==1))"))||("((p107==1)&&(p158==1))")))))
Formula 0 simplified : G(F!"((p16==1)&&(p51==1))" & FG!"((p107==1)&&(p158==1))")
Detected timeout of ITS tools.
[2024-05-29 03:53:42] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:53:42] [INFO ] Applying decomposition
[2024-05-29 03:53:42] [INFO ] Flatten gal took : 4 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/graph14025118789017273112.txt' '-o' '/tmp/graph14025118789017273112.bin' '-w' '/tmp/graph14025118789017273112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14025118789017273112.bin' '-l' '-1' '-v' '-w' '/tmp/graph14025118789017273112.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:53:42] [INFO ] Decomposing Gal with order
[2024-05-29 03:53:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:53:42] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:53:42] [INFO ] Flatten gal took : 41 ms
[2024-05-29 03:53:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 4 ms.
[2024-05-29 03:53:42] [INFO ] Time to serialize gal into /tmp/LTL15064197736364108990.gal : 3 ms
[2024-05-29 03:53:42] [INFO ] Time to serialize properties into /tmp/LTL6391144783310191646.ltl : 4 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/LTL15064197736364108990.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6391144783310191646.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i1.u1.p16==1)&&(i1.u9.p51==1))"))||("((i5.u19.p107==1)&&(i8.i1.u26.p158==1))")))))
Formula 0 simplified : G(F!"((i1.u1.p16==1)&&(i1.u9.p51==1))" & FG!"((i5.u19.p107==1)&&(i8.i1.u26.p158==1))")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-01 finished in 102357 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 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 186 transition count 149
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 164 transition count 149
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 44 place count 164 transition count 133
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 76 place count 148 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 146 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 131
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 180 place count 96 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 182 place count 94 transition count 79
Applied a total of 182 rules in 24 ms. Remains 94 /187 variables (removed 93) and now considering 79/172 (removed 93) transitions.
// Phase 1: matrix 79 rows 94 cols
[2024-05-29 03:53:58] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 03:53:58] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 03:53:58] [INFO ] Invariant cache hit.
[2024-05-29 03:53:58] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-29 03:53:58] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-29 03:53:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 03:53:58] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 2 ms to minimize.
[2024-05-29 03:53:58] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:53:58] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 79/173 variables, 94/131 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 03:53:59] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/173 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/173 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 132 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2029 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 79/173 variables, 94/132 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 76/208 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/173 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 208 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3919 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 4/4 constraints]
After SMT, in 5962ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 5963ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/187 places, 79/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6168 ms. Remains : 94/187 places, 79/172 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-02
Stuttering criterion allowed to conclude after 235 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-02 finished in 6235 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)&&F(G((p1 U p2))))))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 187 transition count 151
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 166 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 165 transition count 150
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 44 place count 165 transition count 135
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 74 place count 150 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 148 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 148 transition count 133
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 176 place count 99 transition count 84
Applied a total of 176 rules in 17 ms. Remains 99 /187 variables (removed 88) and now considering 84/172 (removed 88) transitions.
// Phase 1: matrix 84 rows 99 cols
[2024-05-29 03:54:04] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 03:54:04] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 03:54:04] [INFO ] Invariant cache hit.
[2024-05-29 03:54:04] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-29 03:54:04] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-29 03:54:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-29 03:54:04] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:54:04] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:54:04] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-05-29 03:54:04] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:54:05] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:54:05] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:54:05] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:54:05] [INFO ] Deduced a trap composed of 46 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/183 variables, 99/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 141 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1736 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/183 variables, 99/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 83/224 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-29 03:54:06] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:54:06] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
[2024-05-29 03:54:06] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:54:08] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-29 03:54:08] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:54:08] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-29 03:54:10] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/183 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 231 constraints, problems are : Problem set: 0 solved, 83 unsolved in 7286 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 15/15 constraints]
After SMT, in 9032ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 9033ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/187 places, 84/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9209 ms. Remains : 99/187 places, 84/172 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-03
Stuttering criterion allowed to conclude after 281 steps with 2 reset in 6 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-03 finished in 9457 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 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 186 transition count 148
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 163 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 163 transition count 133
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 148 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 146 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 131
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 178 place count 97 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 95 transition count 80
Applied a total of 180 rules in 23 ms. Remains 95 /187 variables (removed 92) and now considering 80/172 (removed 92) transitions.
// Phase 1: matrix 80 rows 95 cols
[2024-05-29 03:54:13] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 03:54:13] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 03:54:13] [INFO ] Invariant cache hit.
[2024-05-29 03:54:13] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-29 03:54:13] [INFO ] Redundant transitions in 0 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-29 03:54:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 03:54:14] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-05-29 03:54:14] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 10/36 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 03:54:14] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:54:14] [INFO ] Deduced a trap composed of 42 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 80/175 variables, 95/133 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 133 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1633 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 80/175 variables, 95/133 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 79/212 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 03:54:16] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/175 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 213 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2560 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
After SMT, in 4205ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4207ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/187 places, 80/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4413 ms. Remains : 95/187 places, 80/172 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-05
Stuttering criterion allowed to conclude after 225 steps with 2 reset in 1 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-05 finished in 4494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 186 transition count 171
Applied a total of 2 rules in 9 ms. Remains 186 /187 variables (removed 1) and now considering 171/172 (removed 1) transitions.
// Phase 1: matrix 171 rows 186 cols
[2024-05-29 03:54:18] [INFO ] Computed 34 invariants in 4 ms
[2024-05-29 03:54:18] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-29 03:54:18] [INFO ] Invariant cache hit.
[2024-05-29 03:54:18] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-29 03:54:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:19] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:54:19] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:54:19] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:54:19] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:54:19] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-05-29 03:54:19] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-29 03:54:19] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:54:19] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:54:20] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:54:21] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:54:21] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:54:21] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:22] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:54:22] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:54:22] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:54:22] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:54:22] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/357 variables, 186/250 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:24] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:54:24] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:54:24] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:54:24] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:54:24] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:54:24] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:54:24] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:54:24] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:25] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:54:25] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:54:25] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:54:25] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:54:26] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:26] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:54:26] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:54:26] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:28] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:54:29] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:54:29] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:54:29] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/357 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:30] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:54:30] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:31] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:32] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:54:33] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:54:33] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:54:33] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:54:33] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 5/278 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:33] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:54:33] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:54:34] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:54:34] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:35] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:54:35] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:54:36] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:54:36] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:36] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:54:37] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:54:37] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:54:37] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:54:37] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:54:37] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 6/292 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:38] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:39] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:54:39] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:54:39] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:54:39] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:54:39] [INFO ] Deduced a trap composed of 27 places in 19 ms of which 0 ms to minimize.
[2024-05-29 03:54:40] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/357 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/357 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:42] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/357 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/357 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 23 (OVERLAPS) 0/357 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 300 constraints, problems are : Problem set: 0 solved, 170 unsolved in 27147 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 80/114 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:46] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:54:46] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:54:46] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:54:46] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:54:46] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:54:46] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:54:46] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:54:46] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:54:46] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:54:46] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:47] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:54:47] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:54:47] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/357 variables, 186/313 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 170/483 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:50] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:54:50] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:54:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:54:50] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:54:50] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:54:50] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:54:50] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:54:51] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-29 03:54:51] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:54:51] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:54:51] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:54:51] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:54:51] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 13/496 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:54:54] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:54:55] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:54:55] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:54:55] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:54:56] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:54:56] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:54:56] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:54:56] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 8/504 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:55:00] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:55:00] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:55:00] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:55:00] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:55:00] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:55:01] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:55:01] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:55:01] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:55:01] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 9/513 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:55:05] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:55:06] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:55:06] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:55:06] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 4/517 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-29 03:55:12] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:55:12] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:55:12] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:55:12] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:55:13] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:55:13] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 6/523 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/357 variables, and 523 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 133/133 constraints]
After SMT, in 57186ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 57188ms
Starting structural reductions in LTL mode, iteration 1 : 186/187 places, 171/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57446 ms. Remains : 186/187 places, 171/172 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-06
Stuttering criterion allowed to conclude after 607 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-06 finished in 57542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X((X(p1) U p2))))))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 170
Applied a total of 4 rules in 5 ms. Remains 185 /187 variables (removed 2) and now considering 170/172 (removed 2) transitions.
// Phase 1: matrix 170 rows 185 cols
[2024-05-29 03:55:15] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 03:55:15] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-29 03:55:15] [INFO ] Invariant cache hit.
[2024-05-29 03:55:15] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-29 03:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:55:17] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:18] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:55:18] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:55:18] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:55:18] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:55:18] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:55:18] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:19] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:55:19] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:55:19] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:55:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:55:19] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:55:19] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:55:19] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/355 variables, 185/252 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:21] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:55:21] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:55:21] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:55:22] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:55:22] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:55:22] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:55:22] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:55:22] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:55:22] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:22] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:55:23] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:55:23] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:55:23] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:55:23] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:55:23] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:55:23] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:55:23] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:55:23] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:24] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:55:24] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:55:24] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:55:25] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:55:25] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:55:25] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:55:25] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:26] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:55:26] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:27] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:55:27] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:55:28] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:28] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:30] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:55:31] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:34] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:55:34] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/355 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 288 constraints, problems are : Problem set: 0 solved, 169 unsolved in 21635 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 69/103 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:38] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:55:38] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:55:38] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/355 variables, 185/291 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 169/460 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:41] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:55:41] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:55:41] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 03:55:41] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:55:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:55:42] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:55:42] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:55:42] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:55:42] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/469 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:45] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:55:45] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:55:45] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:55:46] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:55:46] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:50] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:55] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:55:55] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:55:59] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:04] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-29 03:56:04] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 480 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 92/92 constraints]
After SMT, in 51666ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 51668ms
Starting structural reductions in LTL mode, iteration 1 : 185/187 places, 170/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51853 ms. Remains : 185/187 places, 170/172 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-07 finished in 52134 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)||(p1&&G(p2)))))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 186 transition count 149
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 164 transition count 149
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 164 transition count 134
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 74 place count 149 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 147 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 147 transition count 132
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 176 place count 98 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 96 transition count 81
Applied a total of 178 rules in 19 ms. Remains 96 /187 variables (removed 91) and now considering 81/172 (removed 91) transitions.
// Phase 1: matrix 81 rows 96 cols
[2024-05-29 03:56:07] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 03:56:07] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 03:56:07] [INFO ] Invariant cache hit.
[2024-05-29 03:56:07] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-29 03:56:07] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-29 03:56:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 03:56:08] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:56:08] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 03:56:08] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 03:56:09] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 81/177 variables, 96/134 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 03:56:09] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 135 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2259 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 81/177 variables, 96/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 79/214 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 214 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2393 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
After SMT, in 4660ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4661ms
Starting structural reductions in SI_LTL mode, iteration 1 : 96/187 places, 81/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4817 ms. Remains : 96/187 places, 81/172 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-09
Product exploration explored 100000 steps with 413 reset in 308 ms.
Product exploration explored 100000 steps with 415 reset in 278 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 90 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (165 resets) in 282 ms. (141 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (41 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
[2024-05-29 03:56:13] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 4/177 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 13 ms.
Refiners :[Positive P Invariants (semi-flows): 0/34 constraints, State Equation: 0/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 17ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p2))))), (G (OR p0 (NOT p2))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p2 p1))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p0) p1)))), (F (NOT (AND (OR p0 p2) (OR p0 p1))))]
Knowledge based reduction with 25 factoid took 356 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 03:56:14] [INFO ] Invariant cache hit.
[2024-05-29 03:56:14] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 03:56:14] [INFO ] Invariant cache hit.
[2024-05-29 03:56:14] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-29 03:56:14] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-29 03:56:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 03:56:14] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:56:14] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 03:56:15] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 03:56:15] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 81/177 variables, 96/134 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 03:56:15] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 135 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2296 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 81/177 variables, 96/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 79/214 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 214 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2448 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
After SMT, in 4753ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4755ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4893 ms. Remains : 96/96 places, 81/81 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 1385 steps (4 resets) in 9 ms. (138 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 417 reset in 205 ms.
Product exploration explored 100000 steps with 415 reset in 215 ms.
Built C files in :
/tmp/ltsmin13949441806162316498
[2024-05-29 03:56:19] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-29 03:56:19] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:56:19] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-29 03:56:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:56:19] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-29 03:56:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:56:19] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13949441806162316498
Running compilation step : cd /tmp/ltsmin13949441806162316498;'/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 198 ms.
Running link step : cd /tmp/ltsmin13949441806162316498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13949441806162316498;'/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/stateBased10030756436733255445.hoa' '--buchi-type=spotba'
LTSmin run took 488 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-003B-LTLFireability-09 finished in 12769 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||G(F(p1)))))'
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 186 transition count 148
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 163 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 163 transition count 133
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 148 transition count 133
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 178 place count 97 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 95 transition count 80
Applied a total of 180 rules in 12 ms. Remains 95 /187 variables (removed 92) and now considering 80/172 (removed 92) transitions.
// Phase 1: matrix 80 rows 95 cols
[2024-05-29 03:56:20] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 03:56:20] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 03:56:20] [INFO ] Invariant cache hit.
[2024-05-29 03:56:20] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-29 03:56:20] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-29 03:56:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-29 03:56:20] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 1 ms to minimize.
[2024-05-29 03:56:21] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 80/175 variables, 95/131 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 0/175 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 131 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1100 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 80/175 variables, 95/131 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 78/209 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/175 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 209 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2651 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
After SMT, in 3759ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3760ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/187 places, 80/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3893 ms. Remains : 95/187 places, 80/172 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-11
Stuttering criterion allowed to conclude after 506 steps with 3 reset in 3 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-11 finished in 3983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(!p0))) U G(!p0)))'
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 186 transition count 149
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 164 transition count 149
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 44 place count 164 transition count 133
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 76 place count 148 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 146 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 131
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 178 place count 97 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 95 transition count 80
Applied a total of 180 rules in 13 ms. Remains 95 /187 variables (removed 92) and now considering 80/172 (removed 92) transitions.
// Phase 1: matrix 80 rows 95 cols
[2024-05-29 03:56:24] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 03:56:24] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 03:56:24] [INFO ] Invariant cache hit.
[2024-05-29 03:56:24] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-29 03:56:24] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-29 03:56:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:56:25] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:56:25] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:56:25] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
[2024-05-29 03:56:25] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 03:56:25] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 1 ms to minimize.
[2024-05-29 03:56:25] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:56:25] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:56:25] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 80/175 variables, 95/137 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 137 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1752 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 80/175 variables, 95/137 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 77/214 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 03:56:28] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/175 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 215 constraints, problems are : Problem set: 0 solved, 77 unsolved in 6704 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 9/9 constraints]
After SMT, in 8463ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 8464ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/187 places, 80/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8622 ms. Remains : 95/187 places, 80/172 transitions.
Stuttering acceptance computed with spot in 108 ms :[p0, true, p0]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-12 finished in 8746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G((p1&&F(p2))))))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 170
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 170/172 (removed 2) transitions.
// Phase 1: matrix 170 rows 185 cols
[2024-05-29 03:56:33] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 03:56:33] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 03:56:33] [INFO ] Invariant cache hit.
[2024-05-29 03:56:33] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-29 03:56:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:34] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:56:34] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:56:34] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:56:34] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:56:34] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:56:34] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:56:34] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:56:35] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:56:36] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:56:36] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:56:36] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:36] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:56:37] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:56:37] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-29 03:56:37] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:56:37] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:56:37] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:56:37] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/355 variables, 185/252 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:39] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:56:39] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:56:39] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:56:39] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:56:39] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:56:40] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:56:40] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:56:40] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:56:40] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:40] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:56:40] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:56:41] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:56:41] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-29 03:56:41] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:56:41] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:56:41] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:56:41] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:56:41] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:42] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:56:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:56:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:56:42] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:56:42] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:56:42] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:56:42] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:44] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:56:44] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:45] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:56:45] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:56:45] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:46] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:47] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:48] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:56:49] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:51] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:56:51] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/355 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 288 constraints, problems are : Problem set: 0 solved, 169 unsolved in 21564 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 69/103 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:55] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-29 03:56:56] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:56:56] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/355 variables, 185/291 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 169/460 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:56:58] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:56:58] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:56:58] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:56:59] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:56:59] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:56:59] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:56:59] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:56:59] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:57:00] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/469 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:03] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:57:03] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:57:03] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:57:03] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:57:04] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:08] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:12] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:57:12] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:17] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:22] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-29 03:57:22] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 480 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 92/92 constraints]
After SMT, in 51590ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 51592ms
Starting structural reductions in LTL mode, iteration 1 : 185/187 places, 170/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51765 ms. Remains : 185/187 places, 170/172 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-13 finished in 52056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 170
Applied a total of 4 rules in 3 ms. Remains 185 /187 variables (removed 2) and now considering 170/172 (removed 2) transitions.
[2024-05-29 03:57:25] [INFO ] Invariant cache hit.
[2024-05-29 03:57:25] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 03:57:25] [INFO ] Invariant cache hit.
[2024-05-29 03:57:25] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-29 03:57:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:26] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:57:26] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:57:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:57:26] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:57:26] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:57:26] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:57:26] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:57:27] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:57:28] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:57:28] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:57:28] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:57:28] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:29] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:57:29] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:57:29] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:57:29] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:57:29] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:57:29] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
[2024-05-29 03:57:29] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/355 variables, 185/252 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:31] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:57:31] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:57:31] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:57:31] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:57:31] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:57:31] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:57:31] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:57:32] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:57:32] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:32] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:57:32] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:57:32] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:57:33] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:57:33] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:57:33] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:57:33] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:57:33] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:57:33] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:34] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:57:34] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:57:34] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:57:34] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:57:34] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:57:34] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:57:34] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:35] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:57:36] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:37] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:57:37] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:57:37] [INFO ] Deduced a trap composed of 27 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:38] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:39] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:41] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:57:41] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:43] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:57:43] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/355 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 288 constraints, problems are : Problem set: 0 solved, 169 unsolved in 21434 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 69/103 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:47] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:57:47] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:57:47] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/355 variables, 185/291 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 169/460 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:50] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:57:50] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:57:50] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:57:50] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:57:51] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:57:51] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:57:51] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:57:51] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:57:52] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/469 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:57:55] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:57:55] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:57:55] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:57:55] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:57:55] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:00] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:04] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:58:04] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:09] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:13] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:58:14] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 480 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 92/92 constraints]
After SMT, in 51466ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 51467ms
Starting structural reductions in LTL mode, iteration 1 : 185/187 places, 170/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51641 ms. Remains : 185/187 places, 170/172 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-14
Stuttering criterion allowed to conclude after 445 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-14 finished in 51756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 170
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 170/172 (removed 2) transitions.
[2024-05-29 03:58:17] [INFO ] Invariant cache hit.
[2024-05-29 03:58:17] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 03:58:17] [INFO ] Invariant cache hit.
[2024-05-29 03:58:17] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-29 03:58:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:58:18] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:58:19] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:20] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:58:20] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-29 03:58:20] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-05-29 03:58:21] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:58:21] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:58:21] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:58:21] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/355 variables, 185/252 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:23] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:58:23] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-29 03:58:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:58:23] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:58:23] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:58:23] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:58:23] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:58:23] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:58:23] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:24] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:58:24] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:58:24] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:58:24] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:58:24] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:58:24] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:58:25] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:58:25] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:58:25] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:25] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:58:25] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:58:26] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:58:26] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:58:26] [INFO ] Deduced a trap composed of 37 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:58:26] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:58:26] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:27] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:58:28] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:28] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:58:29] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:58:29] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:30] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:31] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:58:32] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:35] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-29 03:58:35] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/355 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 288 constraints, problems are : Problem set: 0 solved, 169 unsolved in 21338 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 69/103 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:39] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-29 03:58:39] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:58:39] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/355 variables, 185/291 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 169/460 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:42] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:58:42] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:58:42] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:58:42] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:58:42] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:58:43] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:58:43] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:58:43] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:58:43] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/469 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:46] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:58:46] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:58:47] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:58:47] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:58:47] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:52] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:58:56] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:58:56] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:01] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:05] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 03:59:05] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 480 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 92/92 constraints]
After SMT, in 51364ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 51366ms
Starting structural reductions in LTL mode, iteration 1 : 185/187 places, 170/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51541 ms. Remains : 185/187 places, 170/172 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-15
Product exploration explored 100000 steps with 5071 reset in 97 ms.
Product exploration explored 100000 steps with 5094 reset in 145 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/185 stabilizing places and 35/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 56 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 03:59:09] [INFO ] Invariant cache hit.
[2024-05-29 03:59:09] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-29 03:59:09] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-29 03:59:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 03:59:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-29 03:59:09] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-29 03:59:09] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:59:09] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:59:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-29 03:59:09] [INFO ] Computed and/alt/rep : 169/299/169 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-29 03:59:10] [INFO ] Added : 151 causal constraints over 33 iterations in 630 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 1 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2024-05-29 03:59:10] [INFO ] Invariant cache hit.
[2024-05-29 03:59:10] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 03:59:10] [INFO ] Invariant cache hit.
[2024-05-29 03:59:10] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-29 03:59:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:11] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:59:11] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:59:12] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:13] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:59:13] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:59:13] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:59:13] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:59:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:59:13] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:14] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:59:14] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-29 03:59:14] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-29 03:59:14] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:59:14] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2024-05-29 03:59:14] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:59:14] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/355 variables, 185/252 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:16] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:59:16] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:59:16] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:59:16] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:59:17] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:59:17] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:59:17] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:59:17] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:59:17] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:17] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:59:17] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:59:18] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 37 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:59:19] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:21] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:59:21] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:22] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:59:22] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:59:22] [INFO ] Deduced a trap composed of 27 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:23] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:25] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:26] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:59:26] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:29] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:59:29] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/355 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 288 constraints, problems are : Problem set: 0 solved, 169 unsolved in 21709 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 69/103 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:33] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:59:33] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:59:33] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/355 variables, 185/291 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 169/460 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:36] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:59:36] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:59:36] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
[2024-05-29 03:59:36] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:59:36] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:59:36] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:59:36] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:59:37] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:59:37] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/469 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:40] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:59:40] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:59:40] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:59:41] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:59:41] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:45] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:50] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:59:50] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:55] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 03:59:59] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-29 03:59:59] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 480 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 92/92 constraints]
After SMT, in 51740ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 51741ms
Finished structural reductions in LTL mode , in 1 iterations and 51924 ms. Remains : 185/185 places, 170/170 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/185 stabilizing places and 35/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 82 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 04:00:03] [INFO ] Invariant cache hit.
[2024-05-29 04:00:03] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-29 04:00:03] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-29 04:00:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 04:00:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-29 04:00:03] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-29 04:00:03] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 04:00:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 04:00:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2024-05-29 04:00:03] [INFO ] Computed and/alt/rep : 169/299/169 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-29 04:00:04] [INFO ] Added : 151 causal constraints over 33 iterations in 636 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5124 reset in 174 ms.
Product exploration explored 100000 steps with 5049 reset in 139 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 185 transition count 170
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 22 place count 185 transition count 171
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 185 transition count 171
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 89 place count 185 transition count 171
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 112 place count 162 transition count 148
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 135 place count 162 transition count 148
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 135 rules in 33 ms. Remains 162 /185 variables (removed 23) and now considering 148/170 (removed 22) transitions.
[2024-05-29 04:00:04] [INFO ] Redundant transitions in 1 ms returned []
Running 147 sub problems to find dead transitions.
// Phase 1: matrix 148 rows 162 cols
[2024-05-29 04:00:04] [INFO ] Computed 34 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-29 04:00:05] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 04:00:05] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-29 04:00:05] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-29 04:00:05] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-29 04:00:05] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-29 04:00:05] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-29 04:00:05] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-29 04:00:05] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/54 constraints. Problems are: Problem set: 49 solved, 98 unsolved
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
[2024-05-29 04:00:06] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 11/65 constraints. Problems are: Problem set: 67 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/65 constraints. Problems are: Problem set: 67 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 148/310 variables, 162/227 constraints. Problems are: Problem set: 67 solved, 80 unsolved
[2024-05-29 04:00:07] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:00:07] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-29 04:00:07] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 04:00:07] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:00:07] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:00:07] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 6/233 constraints. Problems are: Problem set: 67 solved, 80 unsolved
[2024-05-29 04:00:08] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/234 constraints. Problems are: Problem set: 67 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/234 constraints. Problems are: Problem set: 67 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/234 constraints. Problems are: Problem set: 67 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 234 constraints, problems are : Problem set: 67 solved, 80 unsolved in 4915 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 67 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 67 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 67/162 variables, 34/34 constraints. Problems are: Problem set: 67 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 38/72 constraints. Problems are: Problem set: 67 solved, 80 unsolved
[2024-05-29 04:00:10] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/73 constraints. Problems are: Problem set: 67 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/73 constraints. Problems are: Problem set: 67 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 148/310 variables, 162/235 constraints. Problems are: Problem set: 67 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 80/315 constraints. Problems are: Problem set: 67 solved, 80 unsolved
[2024-05-29 04:00:11] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 04:00:12] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 2/317 constraints. Problems are: Problem set: 67 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/317 constraints. Problems are: Problem set: 67 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/317 constraints. Problems are: Problem set: 67 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 317 constraints, problems are : Problem set: 67 solved, 80 unsolved in 7685 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 80/147 constraints, Known Traps: 41/41 constraints]
After SMT, in 12616ms problems are : Problem set: 67 solved, 80 unsolved
Search for dead transitions found 67 dead transitions in 12618ms
Found 67 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 67 transitions
Dead transitions reduction (with SMT) removed 67 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 162/185 places, 81/170 transitions.
Graph (complete) has 250 edges and 162 vertex of which 96 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.2 ms
Discarding 66 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 96 /162 variables (removed 66) and now considering 81/81 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/185 places, 81/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12679 ms. Remains : 96/185 places, 81/170 transitions.
Built C files in :
/tmp/ltsmin8834143737459713460
[2024-05-29 04:00:17] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8834143737459713460
Running compilation step : cd /tmp/ltsmin8834143737459713460;'/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/ltsmin8834143737459713460;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8834143737459713460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13863227657495937044.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 185 cols
[2024-05-29 04:00:32] [INFO ] Computed 34 invariants in 3 ms
[2024-05-29 04:00:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 04:00:32] [INFO ] Invariant cache hit.
[2024-05-29 04:00:32] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-29 04:00:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:33] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:00:34] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:35] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-29 04:00:35] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:00:35] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:00:35] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-29 04:00:35] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:00:35] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:36] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 04:00:36] [INFO ] Deduced a trap composed of 17 places in 15 ms of which 1 ms to minimize.
[2024-05-29 04:00:36] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-29 04:00:36] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 04:00:36] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:00:36] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 04:00:36] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/355 variables, 185/252 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:38] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 04:00:38] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-29 04:00:38] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:00:39] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:00:39] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:00:39] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 04:00:39] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:00:39] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:00:39] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:39] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-05-29 04:00:40] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-29 04:00:40] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:00:40] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-29 04:00:40] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-29 04:00:40] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:00:40] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:00:40] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:00:40] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:41] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:00:41] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 04:00:41] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 04:00:41] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:00:41] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 0 ms to minimize.
[2024-05-29 04:00:41] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-05-29 04:00:42] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:43] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:00:43] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:44] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:00:44] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 04:00:45] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:45] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:47] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:48] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-29 04:00:48] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:51] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 04:00:51] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/355 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 18 (OVERLAPS) 0/355 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 288 constraints, problems are : Problem set: 0 solved, 169 unsolved in 21603 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 69/103 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:55] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-29 04:00:55] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-29 04:00:55] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/355 variables, 185/291 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 169/460 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:00:58] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:00:58] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:00:58] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 04:00:58] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:00:58] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 04:00:58] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-29 04:00:59] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:00:59] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:00:59] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 9/469 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:01:02] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:01:02] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 04:01:03] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-29 04:01:03] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-29 04:01:03] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:01:08] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:01:12] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2024-05-29 04:01:12] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:01:17] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-29 04:01:21] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 04:01:21] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 480 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 92/92 constraints]
After SMT, in 51635ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 51636ms
Finished structural reductions in LTL mode , in 1 iterations and 51832 ms. Remains : 185/185 places, 170/170 transitions.
Built C files in :
/tmp/ltsmin4825265494324465714
[2024-05-29 04:01:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4825265494324465714
Running compilation step : cd /tmp/ltsmin4825265494324465714;'/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 290 ms.
Running link step : cd /tmp/ltsmin4825265494324465714;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4825265494324465714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10800160499982180852.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:01:39] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:01:39] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:01:39] [INFO ] Time to serialize gal into /tmp/LTL4136704846246161819.gal : 2 ms
[2024-05-29 04:01:39] [INFO ] Time to serialize properties into /tmp/LTL5256873604080422632.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/LTL4136704846246161819.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13601423256380535599.hoa' '-atoms' '/tmp/LTL5256873604080422632.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/LTL5256873604080422632.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13601423256380535599.hoa
Detected timeout of ITS tools.
[2024-05-29 04:01:54] [INFO ] Flatten gal took : 11 ms
[2024-05-29 04:01:54] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:01:54] [INFO ] Time to serialize gal into /tmp/LTL3549914651260499630.gal : 1 ms
[2024-05-29 04:01:54] [INFO ] Time to serialize properties into /tmp/LTL5399393988320674097.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/LTL3549914651260499630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5399393988320674097.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p144==1)")))))
Formula 0 simplified : XXG!"(p144==1)"
Detected timeout of ITS tools.
[2024-05-29 04:02:09] [INFO ] Flatten gal took : 11 ms
[2024-05-29 04:02:09] [INFO ] Applying decomposition
[2024-05-29 04:02:09] [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/graph5148969084819299261.txt' '-o' '/tmp/graph5148969084819299261.bin' '-w' '/tmp/graph5148969084819299261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5148969084819299261.bin' '-l' '-1' '-v' '-w' '/tmp/graph5148969084819299261.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:02:09] [INFO ] Decomposing Gal with order
[2024-05-29 04:02:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:02:09] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-29 04:02:09] [INFO ] Flatten gal took : 15 ms
[2024-05-29 04:02:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 04:02:09] [INFO ] Time to serialize gal into /tmp/LTL3040377398021371350.gal : 3 ms
[2024-05-29 04:02:09] [INFO ] Time to serialize properties into /tmp/LTL12202736270422743830.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/LTL3040377398021371350.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12202736270422743830.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i9.i0.i1.u51.p144==1)")))))
Formula 0 simplified : XXG!"(i9.i0.i1.u51.p144==1)"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-15 finished in 247681 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||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ShieldPPPs-PT-003B-LTLFireability-15
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 186 transition count 148
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 163 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 163 transition count 133
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 148 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 146 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 131
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 178 place count 97 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 95 transition count 80
Applied a total of 180 rules in 20 ms. Remains 95 /187 variables (removed 92) and now considering 80/172 (removed 92) transitions.
// Phase 1: matrix 80 rows 95 cols
[2024-05-29 04:02:25] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 04:02:25] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 04:02:25] [INFO ] Invariant cache hit.
[2024-05-29 04:02:25] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-29 04:02:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 04:02:25] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 04:02:25] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 04:02:26] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:02:26] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-29 04:02:26] [INFO ] Deduced a trap composed of 43 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 80/175 variables, 95/134 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 134 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1628 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 80/175 variables, 95/134 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 79/213 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 04:02:27] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/175 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 214 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5075 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 6/6 constraints]
After SMT, in 6710ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 6712ms
Starting structural reductions in LI_LTL mode, iteration 1 : 95/187 places, 80/172 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6866 ms. Remains : 95/187 places, 80/172 transitions.
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-15
Stuttering criterion allowed to conclude after 218 steps with 0 reset in 2 ms.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-15 finished in 7053 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-29 04:02:31] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
[2024-05-29 04:02:31] [INFO ] Applying decomposition
[2024-05-29 04:02:31] [INFO ] Flatten gal took : 6 ms
Built C files in :
/tmp/ltsmin7046840454299626211
[2024-05-29 04:02:31] [INFO ] Computing symmetric may disable matrix : 172 transitions.
[2024-05-29 04:02:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:02:31] [INFO ] Computing symmetric may enable matrix : 172 transitions.
[2024-05-29 04:02:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:02:32] [INFO ] Computing Do-Not-Accords matrix : 172 transitions.
[2024-05-29 04:02:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:02:32] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7046840454299626211
Running compilation step : cd /tmp/ltsmin7046840454299626211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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/graph12928852305583223540.txt' '-o' '/tmp/graph12928852305583223540.bin' '-w' '/tmp/graph12928852305583223540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12928852305583223540.bin' '-l' '-1' '-v' '-w' '/tmp/graph12928852305583223540.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:02:32] [INFO ] Decomposing Gal with order
[2024-05-29 04:02:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:02:32] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-29 04:02:32] [INFO ] Flatten gal took : 11 ms
[2024-05-29 04:02:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 04:02:32] [INFO ] Time to serialize gal into /tmp/LTLFireability13033369492660076790.gal : 3 ms
[2024-05-29 04:02:32] [INFO ] Time to serialize properties into /tmp/LTLFireability17784168431012439169.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/LTLFireability13033369492660076790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17784168431012439169.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...278
Read 2 LTL properties
Checking formula 0 : !((G(F(("((i7.i1.u40.p107==1)&&(i11.u56.p158==1))")||(G("((i1.i1.u5.p16==1)&&(i1.i1.u18.p51==1))"))))))
Formula 0 simplified : G(F!"((i1.i1.u5.p16==1)&&(i1.i1.u18.p51==1))" & FG!"((i7.i1.u40.p107==1)&&(i11.u56.p158==1))")
Compilation finished in 399 ms.
Running link step : cd /tmp/ltsmin7046840454299626211;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7046840454299626211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t55, t58, t61, t82, t85, t109, t112, i0.i0.u9.t114, i0.i1.u15.t106, i0.i1.u16.t3, i0.i1.u16.t...938
Computing Next relation with stutter on 7758 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: Initializing POR dependencies: labels 175, guards 172
pins2lts-mc-linux64( 6/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.050: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.050: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.204: LTL layer: formula: [](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 1/ 8), 0.204: "[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.204: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.285: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.290: There are 176 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.290: State length is 188, there are 178 groups
pins2lts-mc-linux64( 0/ 8), 0.290: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.290: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.290: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.290: Visible groups: 0 / 178, labels: 2 / 176
pins2lts-mc-linux64( 0/ 8), 0.290: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.290: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.305: [Blue] ~119 levels ~960 states ~1528 transitions
pins2lts-mc-linux64( 5/ 8), 0.328: [Blue] ~226 levels ~1920 states ~3376 transitions
pins2lts-mc-linux64( 5/ 8), 0.352: [Blue] ~431 levels ~3840 states ~6776 transitions
pins2lts-mc-linux64( 3/ 8), 0.394: [Blue] ~382 levels ~7680 states ~10744 transitions
pins2lts-mc-linux64( 5/ 8), 0.473: [Blue] ~439 levels ~15360 states ~22080 transitions
pins2lts-mc-linux64( 6/ 8), 0.639: [Blue] ~339 levels ~30720 states ~44640 transitions
pins2lts-mc-linux64( 5/ 8), 0.945: [Blue] ~439 levels ~61440 states ~93136 transitions
pins2lts-mc-linux64( 2/ 8), 1.450: [Blue] ~344 levels ~122880 states ~163984 transitions
pins2lts-mc-linux64( 2/ 8), 2.400: [Blue] ~353 levels ~245760 states ~326584 transitions
pins2lts-mc-linux64( 0/ 8), 4.063: [Blue] ~389 levels ~491520 states ~675720 transitions
pins2lts-mc-linux64( 0/ 8), 6.694: [Blue] ~389 levels ~983040 states ~1347792 transitions
pins2lts-mc-linux64( 0/ 8), 11.615: [Blue] ~389 levels ~1966080 states ~2915096 transitions
pins2lts-mc-linux64( 3/ 8), 20.990: [Blue] ~388 levels ~3932160 states ~5353608 transitions
pins2lts-mc-linux64( 4/ 8), 40.137: [Blue] ~348 levels ~7864320 states ~10446304 transitions
pins2lts-mc-linux64( 4/ 8), 78.073: [Blue] ~348 levels ~15728640 states ~20705416 transitions
pins2lts-mc-linux64( 4/ 8), 153.557: [Blue] ~367 levels ~31457280 states ~41608536 transitions
pins2lts-mc-linux64( 4/ 8), 306.363: [Blue] ~367 levels ~62914560 states ~84472824 transitions
pins2lts-mc-linux64( 4/ 8), 615.423: [Blue] ~367 levels ~125829120 states ~169844672 transitions
pins2lts-mc-linux64( 0/ 8), 699.760: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 699.796:
pins2lts-mc-linux64( 0/ 8), 699.796: Explored 134214376 states 207389796 transitions, fanout: 1.545
pins2lts-mc-linux64( 0/ 8), 699.796: Total exploration time 699.480 sec (699.450 sec minimum, 699.464 sec on average)
pins2lts-mc-linux64( 0/ 8), 699.796: States per second: 191877, Transitions per second: 296491
pins2lts-mc-linux64( 0/ 8), 699.796:
pins2lts-mc-linux64( 0/ 8), 699.796: State space has 134216594 states, 111602663 are accepting
pins2lts-mc-linux64( 0/ 8), 699.796: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 699.796: blue states: 134214376 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 699.796: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 699.796: all-red states: 134211662 (100.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 699.796:
pins2lts-mc-linux64( 0/ 8), 699.796: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 699.796:
pins2lts-mc-linux64( 0/ 8), 699.796: Queue width: 8B, total height: 3236, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 699.796: Tree memory: 1038.8MB, 8.1 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 699.796: Tree fill ratio (roots/leafs): 99.0%/5.0%
pins2lts-mc-linux64( 0/ 8), 699.796: Stored 172 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 699.797: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 699.797: Est. total memory use: 1038.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7046840454299626211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7046840454299626211;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
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-29 04:26:16] [INFO ] Applying decomposition
[2024-05-29 04:26:16] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:26:16] [INFO ] Decomposing Gal with order
[2024-05-29 04:26:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:26:16] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 04:26:16] [INFO ] Flatten gal took : 9 ms
[2024-05-29 04:26:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 3 ms.
[2024-05-29 04:26:16] [INFO ] Time to serialize gal into /tmp/LTLFireability1889653701003233631.gal : 2 ms
[2024-05-29 04:26:16] [INFO ] Time to serialize properties into /tmp/LTLFireability12023851903203319828.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/LTLFireability1889653701003233631.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12023851903203319828.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F(("((i0.i1.i0.i0.i0.u42.p107==1)&&(i1.i0.i0.i0.i0.i0.i1.u81.p158==1))")||(G("((i0.i0.i1.i0.i0.i0.i0.i0.i0.u11.p16==1)&&(i0.i0.i1...181
Formula 0 simplified : G(F!"((i0.i0.i1.i0.i0.i0.i0.i0.i0.u11.p16==1)&&(i0.i0.i1.i0.i0.u22.p51==1))" & FG!"((i0.i1.i0.i0.i0.u42.p107==1)&&(i1.i0.i0.i0.i0.i0...174
ITS-tools command line returned an error code 137
[2024-05-29 04:33:37] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:33:37] [INFO ] Input system was already deterministic with 172 transitions.
[2024-05-29 04:33:37] [INFO ] Transformed 187 places.
[2024-05-29 04:33:37] [INFO ] Transformed 172 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-29 04:33:37] [INFO ] Time to serialize gal into /tmp/LTLFireability4804332612852322354.gal : 4 ms
[2024-05-29 04:33:37] [INFO ] Time to serialize properties into /tmp/LTLFireability5388861890986271845.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/LTLFireability4804332612852322354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5388861890986271845.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 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p107==1)&&(p158==1))")||(G("((p16==1)&&(p51==1))"))))))
Formula 0 simplified : G(F!"((p16==1)&&(p51==1))" & FG!"((p107==1)&&(p158==1))")
ITS-tools command line returned an error code 137
Total runtime 3153699 ms.

BK_STOP 1716957833107

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.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="ShieldPPPs-PT-003B"
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 ShieldPPPs-PT-003B, 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 r356-tall-171683761000396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-003B.tgz
mv ShieldPPPs-PT-003B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;