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-171683761000380.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-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761000380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.5K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 13 11:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 13 11:53 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 35K 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-002B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-002B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716951853157

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-002B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 03:04:14] [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:04:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:04:14] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-29 03:04:14] [INFO ] Transformed 139 places.
[2024-05-29 03:04:14] [INFO ] Transformed 129 transitions.
[2024-05-29 03:04:14] [INFO ] Found NUPN structural information;
[2024-05-29 03:04:14] [INFO ] Parsed PT model containing 139 places and 129 transitions and 354 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldPPPs-PT-002B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 129/129 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 125 transition count 115
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 125 transition count 115
Applied a total of 28 rules in 28 ms. Remains 125 /139 variables (removed 14) and now considering 115/129 (removed 14) transitions.
// Phase 1: matrix 115 rows 125 cols
[2024-05-29 03:04:14] [INFO ] Computed 23 invariants in 16 ms
[2024-05-29 03:04:14] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-29 03:04:14] [INFO ] Invariant cache hit.
[2024-05-29 03:04:15] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-29 03:04:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 11 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 2 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:04:16] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:04:17] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:17] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:04:17] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:04:17] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:04:17] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:04:17] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:04:17] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/240 variables, 125/174 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:18] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:19] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:04:19] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:04:19] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:20] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:20] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:04:20] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:04:20] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:21] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:21] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:23] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:04:23] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:04:23] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:04:23] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 2 ms to minimize.
[2024-05-29 03:04:23] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/240 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 16 (OVERLAPS) 0/240 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 189 constraints, problems are : Problem set: 0 solved, 114 unsolved in 9732 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 41/64 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:25] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:04:25] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:25] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:04:25] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:26] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:26] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:04:26] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:04:26] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 115/240 variables, 125/197 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 114/311 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:27] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:30] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:04:30] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 318 constraints, problems are : Problem set: 0 solved, 114 unsolved in 12528 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 56/56 constraints]
After SMT, in 22310ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 22324ms
Starting structural reductions in LTL mode, iteration 1 : 125/139 places, 115/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22707 ms. Remains : 125/139 places, 115/129 transitions.
Support contains 18 out of 125 places after structural reductions.
[2024-05-29 03:04:37] [INFO ] Flatten gal took : 28 ms
[2024-05-29 03:04:37] [INFO ] Flatten gal took : 11 ms
[2024-05-29 03:04:37] [INFO ] Input system was already deterministic with 115 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 1409 steps (1 resets) in 119 ms. (11 steps per ms) remains 0/16 properties
Computed a total of 24 stabilizing places and 24 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' '!(X((G(p0)||F(p1))))'
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 115/115 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-29 03:04:37] [INFO ] Invariant cache hit.
[2024-05-29 03:04:38] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 03:04:38] [INFO ] Invariant cache hit.
[2024-05-29 03:04:38] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-29 03:04:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:38] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:04:38] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:04:38] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:04:38] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:04:38] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 2 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:04:39] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:40] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:04:40] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:04:40] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:04:40] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:04:40] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:04:40] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/240 variables, 125/174 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:41] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:41] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:04:42] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:04:42] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:42] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:43] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:04:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:04:43] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:44] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:45] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:04:45] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:04:45] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:04:46] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:04:46] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/240 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 16 (OVERLAPS) 0/240 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 189 constraints, problems are : Problem set: 0 solved, 114 unsolved in 9308 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 41/64 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:47] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:04:48] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:48] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:04:48] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:48] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:49] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:04:49] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:04:49] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 115/240 variables, 125/197 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 114/311 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:50] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:04:50] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:04:50] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:04:50] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:04:50] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:04:52] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:04:53] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 318 constraints, problems are : Problem set: 0 solved, 114 unsolved in 12517 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 56/56 constraints]
After SMT, in 21842ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 21843ms
Finished structural reductions in LTL mode , in 1 iterations and 21999 ms. Remains : 125/125 places, 115/115 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-00
Stuttering criterion allowed to conclude after 59878 steps with 456 reset in 229 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-00 finished in 22570 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 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 115/115 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 124 transition count 99
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 109 transition count 99
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 109 transition count 89
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 99 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 98 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 98 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 52 place count 98 transition count 87
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 97 transition count 87
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 116 place count 66 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 64 transition count 54
Applied a total of 118 rules in 35 ms. Remains 64 /125 variables (removed 61) and now considering 54/115 (removed 61) transitions.
// Phase 1: matrix 54 rows 64 cols
[2024-05-29 03:05:00] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:05:00] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 03:05:00] [INFO ] Invariant cache hit.
[2024-05-29 03:05:00] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-29 03:05:00] [INFO ] Redundant transitions in 0 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-29 03:05:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 03:05:00] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:05:00] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:05:00] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 54/118 variables, 64/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 03:05:01] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 03:05:01] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 03:05:01] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/118 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (OVERLAPS) 0/118 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 93 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1370 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 54/118 variables, 64/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 51/144 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/118 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 144 constraints, problems are : Problem set: 0 solved, 51 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints]
After SMT, in 2230ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2231ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/125 places, 54/115 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2379 ms. Remains : 64/125 places, 54/115 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-01
Stuttering criterion allowed to conclude after 181 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-01 finished in 2481 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 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 115/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 114
Applied a total of 2 rules in 10 ms. Remains 124 /125 variables (removed 1) and now considering 114/115 (removed 1) transitions.
// Phase 1: matrix 114 rows 124 cols
[2024-05-29 03:05:02] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 03:05:03] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 03:05:03] [INFO ] Invariant cache hit.
[2024-05-29 03:05:03] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-29 03:05:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:03] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:05:03] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:05:03] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:05:03] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:05:03] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:05:03] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:05:03] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:05:03] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:05:04] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:05:04] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:05:04] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:05:04] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:05:04] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:05:04] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:05:04] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:04] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:05:04] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:05:04] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:05] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:05:05] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:05:05] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:06] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:05:06] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:05:06] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:05:06] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
[2024-05-29 03:05:06] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:06] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:05:06] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:05:07] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:05:07] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:05:07] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:05:07] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:05:07] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:07] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5819 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:09] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:09] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:10] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:05:10] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:10] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:11] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:05:11] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:05:11] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:05:11] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:05:12] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:05:12] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:05:12] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:14] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:05:14] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:05:14] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:05:14] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:05:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:16] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:05:16] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:18] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:05:18] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:05:18] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:05:18] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:05:18] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:05:18] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:19] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:22] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:05:22] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:05:22] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:05:22] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 19554 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 25391ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 25396ms
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 114/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25545 ms. Remains : 124/125 places, 114/115 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-06
Product exploration explored 100000 steps with 4072 reset in 136 ms.
Product exploration explored 100000 steps with 4097 reset in 141 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 85 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
[2024-05-29 03:05:29] [INFO ] Invariant cache hit.
[2024-05-29 03:05:29] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2024-05-29 03:05:29] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-29 03:05:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 03:05:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 4 ms returned sat
[2024-05-29 03:05:29] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-29 03:05:29] [INFO ] Computed and/alt/rep : 113/200/113 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-29 03:05:29] [INFO ] Added : 95 causal constraints over 19 iterations in 307 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 123 transition count 97
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 107 transition count 97
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 32 place count 107 transition count 88
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 50 place count 98 transition count 88
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 108 place count 69 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 67 transition count 57
Applied a total of 110 rules in 16 ms. Remains 67 /124 variables (removed 57) and now considering 57/114 (removed 57) transitions.
// Phase 1: matrix 57 rows 67 cols
[2024-05-29 03:05:29] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:05:29] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 03:05:29] [INFO ] Invariant cache hit.
[2024-05-29 03:05:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-29 03:05:29] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-29 03:05:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 03:05:30] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 03:05:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:05:30] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-29 03:05:30] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 03:05:30] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:05:30] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:05:30] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 57/124 variables, 67/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 03:05:30] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 98 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1229 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 57/124 variables, 67/98 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 56/154 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 154 constraints, problems are : Problem set: 0 solved, 56 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 8/8 constraints]
After SMT, in 2127ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2128ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/124 places, 57/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2236 ms. Remains : 67/124 places, 57/114 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-002B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-002B-LTLFireability-06 finished in 29162 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||F((G(p2)&&p1)))))'
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 115/115 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 124 transition count 100
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 110 transition count 100
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 28 place count 110 transition count 90
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 48 place count 100 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 99 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 99 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 99 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 98 transition count 88
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 116 place count 66 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 64 transition count 54
Applied a total of 118 rules in 17 ms. Remains 64 /125 variables (removed 61) and now considering 54/115 (removed 61) transitions.
// Phase 1: matrix 54 rows 64 cols
[2024-05-29 03:05:32] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:05:32] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 03:05:32] [INFO ] Invariant cache hit.
[2024-05-29 03:05:32] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-29 03:05:32] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-29 03:05:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 03:05:32] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:05:32] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 54/118 variables, 64/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 0/118 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 89 constraints, problems are : Problem set: 0 solved, 52 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 54/118 variables, 64/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 52/141 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/118 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 141 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 2/2 constraints]
After SMT, in 1723ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1723ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/125 places, 54/115 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1869 ms. Remains : 64/125 places, 54/115 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-08
Stuttering criterion allowed to conclude after 142 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-08 finished in 2004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 115/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 114
Applied a total of 2 rules in 5 ms. Remains 124 /125 variables (removed 1) and now considering 114/115 (removed 1) transitions.
// Phase 1: matrix 114 rows 124 cols
[2024-05-29 03:05:34] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:05:34] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 03:05:34] [INFO ] Invariant cache hit.
[2024-05-29 03:05:34] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-29 03:05:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:34] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:05:34] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:05:34] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:05:34] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:05:35] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:36] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:05:36] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-29 03:05:36] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:37] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:05:37] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:05:37] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:05:37] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:05:37] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:38] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:05:38] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:05:38] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:05:38] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:05:38] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:05:38] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:05:38] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:38] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5799 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:40] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:41] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
[2024-05-29 03:05:41] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:41] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:42] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:05:42] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:05:42] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:05:43] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:05:43] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:05:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:05:43] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:05:45] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:05:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:05:45] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:05:46] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:47] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:05:47] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:49] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:05:49] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:05:49] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:05:49] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:05:49] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:05:49] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:51] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:05:51] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:05:51] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:05:51] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:05:53] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:05:53] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:05:53] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:05:53] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 19719 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 25530ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 25532ms
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 114/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25680 ms. Remains : 124/125 places, 114/115 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-09
Product exploration explored 100000 steps with 1536 reset in 118 ms.
Product exploration explored 100000 steps with 1534 reset in 121 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 246 steps (0 resets) in 6 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 03:06:00] [INFO ] Invariant cache hit.
[2024-05-29 03:06:00] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2024-05-29 03:06:00] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-29 03:06:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 03:06:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 4 ms returned sat
[2024-05-29 03:06:01] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-29 03:06:01] [INFO ] Computed and/alt/rep : 113/200/113 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-29 03:06:01] [INFO ] Added : 86 causal constraints over 18 iterations in 243 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-29 03:06:01] [INFO ] Invariant cache hit.
[2024-05-29 03:06:01] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 03:06:01] [INFO ] Invariant cache hit.
[2024-05-29 03:06:01] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-29 03:06:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:06:03] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:06:03] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:03] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:06:03] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:06:03] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:04] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:06:04] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:06:04] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:06:04] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:06:05] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:05] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:06:05] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:06:05] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:06:05] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:06:05] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:06:05] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:06:05] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:06] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5980 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:07] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:08] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:08] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:06:08] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:08] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:10] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:06:10] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:06:10] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:06:10] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:06:10] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:06:10] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:06:10] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:06:13] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:14] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:06:14] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:16] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:06:16] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:06:16] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:06:16] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:06:16] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:06:16] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:18] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:06:18] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:06:18] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:06:18] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:20] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:06:20] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:06:20] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:06:20] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 19615 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 25607ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 25608ms
Finished structural reductions in LTL mode , in 1 iterations and 25755 ms. Remains : 124/124 places, 114/114 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 264 steps (0 resets) in 5 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 03:06:27] [INFO ] Invariant cache hit.
[2024-05-29 03:06:27] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2024-05-29 03:06:27] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-29 03:06:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 03:06:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 4 ms returned sat
[2024-05-29 03:06:27] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-29 03:06:27] [INFO ] Computed and/alt/rep : 113/200/113 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-29 03:06:28] [INFO ] Added : 86 causal constraints over 18 iterations in 232 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1541 reset in 103 ms.
Product exploration explored 100000 steps with 1529 reset in 117 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 124 transition count 114
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 15 place count 124 transition count 115
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 124 transition count 115
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 59 place count 124 transition count 115
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 75 place count 108 transition count 99
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 91 place count 108 transition count 99
Deduced a syphon composed of 43 places in 0 ms
Applied a total of 91 rules in 21 ms. Remains 108 /124 variables (removed 16) and now considering 99/114 (removed 15) transitions.
[2024-05-29 03:06:28] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
// Phase 1: matrix 99 rows 108 cols
[2024-05-29 03:06:28] [INFO ] Computed 23 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 17/40 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/40 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 99/207 variables, 108/148 constraints. Problems are: Problem set: 44 solved, 54 unsolved
[2024-05-29 03:06:30] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 1/149 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/149 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/149 constraints. Problems are: Problem set: 44 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 149 constraints, problems are : Problem set: 44 solved, 54 unsolved in 1854 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 44 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 44/108 variables, 23/23 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 18/41 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/41 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 99/207 variables, 108/149 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 54/203 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/203 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/203 constraints. Problems are: Problem set: 44 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 203 constraints, problems are : Problem set: 44 solved, 54 unsolved in 1445 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 54/98 constraints, Known Traps: 18/18 constraints]
After SMT, in 3315ms problems are : Problem set: 44 solved, 54 unsolved
Search for dead transitions found 44 dead transitions in 3317ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 108/124 places, 55/114 transitions.
Graph (complete) has 170 edges and 108 vertex of which 65 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.3 ms
Discarding 43 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 65 /108 variables (removed 43) and now considering 55/55 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/124 places, 55/114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3357 ms. Remains : 65/124 places, 55/114 transitions.
Built C files in :
/tmp/ltsmin5356451625793424575
[2024-05-29 03:06:32] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5356451625793424575
Running compilation step : cd /tmp/ltsmin5356451625793424575;'/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 316 ms.
Running link step : cd /tmp/ltsmin5356451625793424575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5356451625793424575;'/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/stateBased1110473452356432769.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 124 cols
[2024-05-29 03:06:47] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:06:47] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 03:06:47] [INFO ] Invariant cache hit.
[2024-05-29 03:06:47] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-29 03:06:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:06:48] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:06:49] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:49] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 1 ms to minimize.
[2024-05-29 03:06:49] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:06:49] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:50] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:06:50] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:06:50] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:06:50] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:06:50] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:51] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:06:51] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:06:51] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:06:51] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:06:51] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:06:51] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:06:51] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:51] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5831 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:53] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:54] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:54] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:06:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:54] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:55] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:06:55] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:06:56] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:06:56] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:06:56] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:06:56] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:06:56] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:06:58] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:06:58] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:06:58] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:06:58] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:07:00] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:07:00] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:07:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:07:02] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:07:02] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:07:02] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:07:02] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:07:02] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:07:03] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:07:04] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:07:04] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:07:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:07:06] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:07:06] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:07:06] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:07:06] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 19581 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 25430ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 25432ms
Finished structural reductions in LTL mode , in 1 iterations and 25581 ms. Remains : 124/124 places, 114/114 transitions.
Built C files in :
/tmp/ltsmin987980748490113529
[2024-05-29 03:07:12] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin987980748490113529
Running compilation step : cd /tmp/ltsmin987980748490113529;'/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 216 ms.
Running link step : cd /tmp/ltsmin987980748490113529;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin987980748490113529;'/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/stateBased8525350981771564869.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:07:27] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:07:27] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:07:27] [INFO ] Time to serialize gal into /tmp/LTL1129297912387523992.gal : 3 ms
[2024-05-29 03:07:27] [INFO ] Time to serialize properties into /tmp/LTL17990334486095287145.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/LTL1129297912387523992.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7295951461203326926.hoa' '-atoms' '/tmp/LTL17990334486095287145.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/LTL17990334486095287145.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7295951461203326926.hoa
Detected timeout of ITS tools.
[2024-05-29 03:07:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:07:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:07:43] [INFO ] Time to serialize gal into /tmp/LTL12353084895334948427.gal : 1 ms
[2024-05-29 03:07:43] [INFO ] Time to serialize properties into /tmp/LTL15466498303628106848.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/LTL12353084895334948427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15466498303628106848.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p64==1)"))))))
Formula 0 simplified : XXXG!"(p64==1)"
Detected timeout of ITS tools.
[2024-05-29 03:07:58] [INFO ] Flatten gal took : 12 ms
[2024-05-29 03:07:58] [INFO ] Applying decomposition
[2024-05-29 03:07:58] [INFO ] Flatten gal took : 5 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/graph17178974232726319876.txt' '-o' '/tmp/graph17178974232726319876.bin' '-w' '/tmp/graph17178974232726319876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17178974232726319876.bin' '-l' '-1' '-v' '-w' '/tmp/graph17178974232726319876.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:07:58] [INFO ] Decomposing Gal with order
[2024-05-29 03:07:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:07:58] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:07:58] [INFO ] Flatten gal took : 44 ms
[2024-05-29 03:07:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-29 03:07:58] [INFO ] Time to serialize gal into /tmp/LTL14505523085134537552.gal : 12 ms
[2024-05-29 03:07:58] [INFO ] Time to serialize properties into /tmp/LTL10429082059406245755.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/LTL14505523085134537552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10429082059406245755.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i0.u24.p64==1)"))))))
Formula 0 simplified : XXXG!"(i0.u24.p64==1)"
Reverse transition relation is NOT exact ! Due to transitions t41, t44, t47, t68, t71, i0.u23.t54, i0.u24.t9, i0.u24.t10, i0.u24.t11, i1.i0.u10.t73, i1.i1....634
Computing Next relation with stutter on 162 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
1112 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.1539,247596,1,0,490413,438,1658,572949,201,1769,378648
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPs-PT-002B-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldPPPs-PT-002B-LTLFireability-09 finished in 156308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(p1))||p0))))'
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 115/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 114
Applied a total of 2 rules in 3 ms. Remains 124 /125 variables (removed 1) and now considering 114/115 (removed 1) transitions.
[2024-05-29 03:08:10] [INFO ] Invariant cache hit.
[2024-05-29 03:08:10] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 03:08:10] [INFO ] Invariant cache hit.
[2024-05-29 03:08:10] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-29 03:08:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:08:11] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:12] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:08:12] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:08:12] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:12] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:08:12] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-29 03:08:12] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:08:13] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:08:13] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:08:13] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:08:13] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:14] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:08:14] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:08:14] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:08:14] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:08:14] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:08:14] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:08:14] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:15] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5729 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:16] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:17] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:17] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:08:17] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:17] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:18] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:08:19] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:08:19] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:08:19] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:08:19] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:08:19] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:08:19] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:21] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:08:21] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:08:21] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:08:21] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:08:22] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:23] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:08:23] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:25] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:08:25] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:08:25] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:08:25] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:08:25] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:08:25] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:27] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:08:27] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:08:27] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:08:27] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:29] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:08:29] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:08:29] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:08:29] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 19511 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 25263ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 25264ms
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 114/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25420 ms. Remains : 124/125 places, 114/115 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-10
Product exploration explored 100000 steps with 2515 reset in 109 ms.
Product exploration explored 100000 steps with 2520 reset in 156 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/124 stabilizing places and 23/114 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (98 resets) in 164 ms. (242 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
[2024-05-29 03:08:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/124 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 114/238 variables, 124/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/238 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 75/238 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 13/23 constraints, State Equation: 0/124 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 5 states, 14 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-002B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-002B-LTLFireability-10 finished in 26369 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 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 115/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 114
Applied a total of 2 rules in 7 ms. Remains 124 /125 variables (removed 1) and now considering 114/115 (removed 1) transitions.
[2024-05-29 03:08:36] [INFO ] Invariant cache hit.
[2024-05-29 03:08:36] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 03:08:36] [INFO ] Invariant cache hit.
[2024-05-29 03:08:36] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-29 03:08:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:37] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:08:37] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:08:37] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:08:37] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:08:37] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:08:37] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:08:37] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:08:37] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:08:37] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:08:37] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:08:38] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:08:38] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:08:38] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:08:38] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:08:38] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:38] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:08:38] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:08:38] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:38] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:08:38] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:08:39] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 2 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:41] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5763 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:43] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:43] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:43] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:08:43] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:44] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:45] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:08:45] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:08:45] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:08:45] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:08:45] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:08:46] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:08:46] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:47] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:08:48] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:08:48] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:08:48] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:08:48] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:49] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:08:49] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:51] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:08:51] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:08:51] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:08:51] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:08:52] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:08:52] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:53] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:08:53] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:08:53] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:08:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:08:56] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:08:56] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:08:56] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:08:56] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 19690 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 25465ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 25466ms
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 114/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25622 ms. Remains : 124/125 places, 114/115 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 58 ms.
Product exploration explored 100000 steps with 33333 reset in 63 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-002B-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-002B-LTLFireability-11 finished in 25871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&X(G(p1))))))'
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 115/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 114
Applied a total of 2 rules in 6 ms. Remains 124 /125 variables (removed 1) and now considering 114/115 (removed 1) transitions.
[2024-05-29 03:09:02] [INFO ] Invariant cache hit.
[2024-05-29 03:09:02] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 03:09:02] [INFO ] Invariant cache hit.
[2024-05-29 03:09:02] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-29 03:09:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 29 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:05] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:09:05] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:09:05] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:07] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5734 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:09] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:09] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:09] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:09:09] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:10] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:11] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:09:11] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:09:11] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:09:11] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:09:11] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:09:11] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:09:11] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:13] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:09:14] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:09:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:09:14] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:09:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:15] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:09:15] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:17] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:09:17] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:09:17] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:09:17] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:09:17] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:09:17] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:19] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:09:19] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:09:19] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:09:19] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:09:21] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:09:21] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:09:21] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:09:22] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 19464 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 25208ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 25209ms
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 114/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25358 ms. Remains : 124/125 places, 114/115 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-12
Stuttering criterion allowed to conclude after 35550 steps with 654 reset in 46 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-12 finished in 25563 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(p1))))'
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 115/115 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 124 transition count 100
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 110 transition count 100
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 28 place count 110 transition count 92
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 44 place count 102 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 101 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 101 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 46 place count 101 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 100 transition count 90
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 114 place count 67 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 65 transition count 55
Applied a total of 116 rules in 21 ms. Remains 65 /125 variables (removed 60) and now considering 55/115 (removed 60) transitions.
// Phase 1: matrix 55 rows 65 cols
[2024-05-29 03:09:28] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:09:28] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 03:09:28] [INFO ] Invariant cache hit.
[2024-05-29 03:09:28] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-29 03:09:28] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-29 03:09:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 03:09:28] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:09:28] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 55/120 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 51 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 55/120 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 51/141 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 141 constraints, problems are : Problem set: 0 solved, 51 unsolved in 835 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints]
After SMT, in 1583ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1584ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/125 places, 55/115 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1710 ms. Remains : 65/125 places, 55/115 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-13
Product exploration explored 100000 steps with 8314 reset in 108 ms.
Product exploration explored 100000 steps with 8234 reset in 122 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 p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 370 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 79 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 418 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-05-29 03:09:31] [INFO ] Invariant cache hit.
[2024-05-29 03:09:31] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 03:09:31] [INFO ] Invariant cache hit.
[2024-05-29 03:09:31] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-29 03:09:31] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-29 03:09:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 03:09:31] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-05-29 03:09:31] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 55/120 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 51 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 55/120 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 51/141 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 141 constraints, problems are : Problem set: 0 solved, 51 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints]
After SMT, in 1559ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1560ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1667 ms. Remains : 65/65 places, 55/55 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 : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 374 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 50 steps (0 resets) in 7 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 429 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8250 reset in 117 ms.
Product exploration explored 100000 steps with 8240 reset in 127 ms.
Built C files in :
/tmp/ltsmin17543183667570996270
[2024-05-29 03:09:34] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2024-05-29 03:09:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:09:34] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2024-05-29 03:09:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:09:34] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2024-05-29 03:09:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:09:34] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17543183667570996270
Running compilation step : cd /tmp/ltsmin17543183667570996270;'/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 165 ms.
Running link step : cd /tmp/ltsmin17543183667570996270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17543183667570996270;'/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/stateBased8234994759061616129.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 6 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-05-29 03:09:49] [INFO ] Invariant cache hit.
[2024-05-29 03:09:49] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 03:09:49] [INFO ] Invariant cache hit.
[2024-05-29 03:09:49] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-29 03:09:49] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-29 03:09:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 03:09:49] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:09:49] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 55/120 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 51 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 55/120 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 51/141 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 141 constraints, problems are : Problem set: 0 solved, 51 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints]
After SMT, in 1631ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1632ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1749 ms. Remains : 65/65 places, 55/55 transitions.
Built C files in :
/tmp/ltsmin6790177595698032845
[2024-05-29 03:09:50] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2024-05-29 03:09:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:09:50] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2024-05-29 03:09:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:09:50] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2024-05-29 03:09:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:09:50] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6790177595698032845
Running compilation step : cd /tmp/ltsmin6790177595698032845;'/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 157 ms.
Running link step : cd /tmp/ltsmin6790177595698032845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6790177595698032845;'/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/stateBased5573473553360972146.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:10:06] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:10:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:10:06] [INFO ] Time to serialize gal into /tmp/LTL12333490480010256532.gal : 5 ms
[2024-05-29 03:10:06] [INFO ] Time to serialize properties into /tmp/LTL14349089573106691659.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/LTL12333490480010256532.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16164169101931696618.hoa' '-atoms' '/tmp/LTL14349089573106691659.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...320
Loading property file /tmp/LTL14349089573106691659.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16164169101931696618.hoa
Reverse transition relation is NOT exact ! Due to transitions t0.t76, t1.t73, t2.t70, t4, t5, t7, t8, t10, t11, t12.t49, t13.t46, t16, t17, t19, t20, t22, ...374
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2024-05-29 03:10:21] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:10:21] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:10:21] [INFO ] Time to serialize gal into /tmp/LTL15376734632512125047.gal : 1 ms
[2024-05-29 03:10:21] [INFO ] Time to serialize properties into /tmp/LTL4927986850369671266.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/LTL15376734632512125047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4927986850369671266.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(p70!=1)"))||("((p82==1)&&(p117==1))"))))
Formula 0 simplified : G(!"((p82==1)&&(p117==1))" & F!"(p70!=1)")
Reverse transition relation is NOT exact ! Due to transitions t0.t76, t1.t73, t2.t70, t4, t5, t7, t8, t10, t11, t12.t49, t13.t46, t16, t17, t19, t20, t22, ...374
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2024-05-29 03:10:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:10:36] [INFO ] Applying decomposition
[2024-05-29 03:10:36] [INFO ] Flatten gal took : 2 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/graph4480556638797180821.txt' '-o' '/tmp/graph4480556638797180821.bin' '-w' '/tmp/graph4480556638797180821.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4480556638797180821.bin' '-l' '-1' '-v' '-w' '/tmp/graph4480556638797180821.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:10:36] [INFO ] Decomposing Gal with order
[2024-05-29 03:10:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:10:36] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-29 03:10:36] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:10:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 2 ms.
[2024-05-29 03:10:36] [INFO ] Time to serialize gal into /tmp/LTL9317948999679853421.gal : 1 ms
[2024-05-29 03:10:36] [INFO ] Time to serialize properties into /tmp/LTL521867242621728965.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/LTL9317948999679853421.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL521867242621728965.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...253
Read 1 LTL properties
Checking formula 0 : !((F((G("(i3.u12.p70!=1)"))||("((i4.u13.p82==1)&&(i4.u21.p117==1))"))))
Formula 0 simplified : G(!"((i4.u13.p82==1)&&(i4.u21.p117==1))" & F!"(i3.u12.p70!=1)")
Reverse transition relation is NOT exact ! Due to transitions t0_t76, t1_t73, t2_t70, t12_t49, t13_t46, t14_t43_t79_t42, i0.t107_t3, i0.t67_t66_t106, i0.u8...503
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-002B-LTLFireability-13 finished in 82957 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))&&F(p1)))'
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 115/115 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 125 transition count 101
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 111 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 110 transition count 100
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 30 place count 110 transition count 90
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 50 place count 100 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 99 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 99 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 99 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 98 transition count 88
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 122 place count 64 transition count 54
Applied a total of 122 rules in 16 ms. Remains 64 /125 variables (removed 61) and now considering 54/115 (removed 61) transitions.
// Phase 1: matrix 54 rows 64 cols
[2024-05-29 03:10:51] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:10:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 03:10:51] [INFO ] Invariant cache hit.
[2024-05-29 03:10:51] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-29 03:10:51] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-29 03:10:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 03:10:51] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 3 ms to minimize.
[2024-05-29 03:10:51] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:10:51] [INFO ] Deduced a trap composed of 29 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 54/118 variables, 64/90 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 0/118 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 90 constraints, problems are : Problem set: 0 solved, 53 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 54/118 variables, 64/90 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 53/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 03:10:52] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-29 03:10:52] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 145 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1381 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 5/5 constraints]
After SMT, in 2194ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2195ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/125 places, 54/115 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2301 ms. Remains : 64/125 places, 54/115 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-14
Stuttering criterion allowed to conclude after 182 steps with 1 reset in 1 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-14 finished in 2448 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(p1))))'
[2024-05-29 03:10:53] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3869630158226498940
[2024-05-29 03:10:53] [INFO ] Computing symmetric may disable matrix : 115 transitions.
[2024-05-29 03:10:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:10:53] [INFO ] Computing symmetric may enable matrix : 115 transitions.
[2024-05-29 03:10:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:10:53] [INFO ] Applying decomposition
[2024-05-29 03:10:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:10:53] [INFO ] Computing Do-Not-Accords matrix : 115 transitions.
[2024-05-29 03:10:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:10:53] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3869630158226498940
Running compilation step : cd /tmp/ltsmin3869630158226498940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph815672311102665151.txt' '-o' '/tmp/graph815672311102665151.bin' '-w' '/tmp/graph815672311102665151.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph815672311102665151.bin' '-l' '-1' '-v' '-w' '/tmp/graph815672311102665151.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:10:53] [INFO ] Decomposing Gal with order
[2024-05-29 03:10:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:10:53] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:10:53] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:10:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:10:53] [INFO ] Time to serialize gal into /tmp/LTLFireability12528868238841190683.gal : 2 ms
[2024-05-29 03:10:53] [INFO ] Time to serialize properties into /tmp/LTLFireability3260786553031537061.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/LTLFireability12528868238841190683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3260786553031537061.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 1 LTL properties
Checking formula 0 : !((F(("((i5.i1.u30.p82==1)&&(i5.i1.u43.p117==1))")||(G("(i2.u25.p70!=1)")))))
Formula 0 simplified : G(!"((i5.i1.u30.p82==1)&&(i5.i1.u43.p117==1))" & F!"(i2.u25.p70!=1)")
Compilation finished in 245 ms.
Running link step : cd /tmp/ltsmin3869630158226498940;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin3869630158226498940;'/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 t41, t44, t47, t68, t71, i0.u1.t78, i1.t74, i1.i1.u6.t77, i1.i2.u7.t76, i2.u23.t54, i2.u24.t9...660
Computing Next relation with stutter on 162 deadlock states
LTSmin run took 44651 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 444449 ms.

BK_STOP 1716952298780

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-002B"
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-002B, 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-171683761000380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-002B.tgz
mv ShieldPPPs-PT-002B 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 ;