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.r528-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 ltsminxred
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 r528-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 1717241944079

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:39:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:39:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:39:05] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-06-01 11:39:05] [INFO ] Transformed 139 places.
[2024-06-01 11:39:05] [INFO ] Transformed 129 transitions.
[2024-06-01 11:39:05] [INFO ] Found NUPN structural information;
[2024-06-01 11:39:05] [INFO ] Parsed PT model containing 139 places and 129 transitions and 354 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 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 30 ms. Remains 125 /139 variables (removed 14) and now considering 115/129 (removed 14) transitions.
// Phase 1: matrix 115 rows 125 cols
[2024-06-01 11:39:05] [INFO ] Computed 23 invariants in 17 ms
[2024-06-01 11:39:05] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-06-01 11:39:05] [INFO ] Invariant cache hit.
[2024-06-01 11:39:06] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-06-01 11:39:06] [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-06-01 11:39:07] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 88 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 2 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 25 places in 26 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-06-01 11:39:08] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:39:08] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:39:08] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:39:08] [INFO ] Deduced a trap composed of 20 places in 38 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-06-01 11:39:08] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:39:08] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
[2024-06-01 11:39:08] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:39:08] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:39:08] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:39:08] [INFO ] Deduced a trap composed of 34 places in 31 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-06-01 11:39:10] [INFO ] Deduced a trap composed of 22 places in 43 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-06-01 11:39:10] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:39:10] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:39:10] [INFO ] Deduced a trap composed of 29 places in 35 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-06-01 11:39:11] [INFO ] Deduced a trap composed of 25 places in 30 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-06-01 11:39:11] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:39:11] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:39:12] [INFO ] Deduced a trap composed of 37 places in 59 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-06-01 11:39:12] [INFO ] Deduced a trap composed of 9 places in 27 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-06-01 11:39:13] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 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-06-01 11:39:14] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:39:14] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:39:14] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:39:14] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:39:14] [INFO ] Deduced a trap composed of 28 places in 31 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 9811 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-06-01 11:39:16] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:39:16] [INFO ] Deduced a trap composed of 28 places in 36 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-06-01 11:39:16] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:39:16] [INFO ] Deduced a trap composed of 31 places in 37 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-06-01 11:39:17] [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-06-01 11:39:17] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:39:17] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:39:17] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 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-06-01 11:39:19] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-06-01 11:39:19] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:39:19] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:39:19] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:39:19] [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-06-01 11:39:21] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:39:21] [INFO ] Deduced a trap composed of 14 places in 32 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 12853 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 22737ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 22752ms
Starting structural reductions in LTL mode, iteration 1 : 125/139 places, 115/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23213 ms. Remains : 125/139 places, 115/129 transitions.
Support contains 18 out of 125 places after structural reductions.
[2024-06-01 11:39:29] [INFO ] Flatten gal took : 29 ms
[2024-06-01 11:39:29] [INFO ] Flatten gal took : 12 ms
[2024-06-01 11:39:29] [INFO ] Input system was already deterministic with 115 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 2033 steps (3 resets) in 141 ms. (14 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-06-01 11:39:29] [INFO ] Invariant cache hit.
[2024-06-01 11:39:29] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 11:39:29] [INFO ] Invariant cache hit.
[2024-06-01 11:39:29] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-06-01 11:39:29] [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-06-01 11:39:30] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:39:31] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:39:31] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:39:31] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:39:31] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:39:31] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:39:31] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:39:31] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:39:31] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:39:31] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:39:31] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 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-06-01 11:39:32] [INFO ] Deduced a trap composed of 22 places in 34 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-06-01 11:39:33] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:39:33] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:39:33] [INFO ] Deduced a trap composed of 29 places in 35 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-06-01 11:39:34] [INFO ] Deduced a trap composed of 25 places in 34 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-06-01 11:39:34] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:34] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:39:35] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:39:35] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:39:36] [INFO ] Deduced a trap composed of 16 places in 30 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-06-01 11:39:37] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:39:37] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:39:37] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:39:37] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:39:37] [INFO ] Deduced a trap composed of 28 places in 42 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 9588 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-06-01 11:39:39] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:39:39] [INFO ] Deduced a trap composed of 28 places in 55 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-06-01 11:39:40] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 11:39:40] [INFO ] Deduced a trap composed of 31 places in 53 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-06-01 11:39:40] [INFO ] Deduced a trap composed of 17 places in 37 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-06-01 11:39:40] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:39:41] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:39:41] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 0 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-06-01 11:39:42] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2024-06-01 11:39:42] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:39:42] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:39:42] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:39:42] [INFO ] Deduced a trap composed of 19 places in 29 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-06-01 11:39:45] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:39:45] [INFO ] Deduced a trap composed of 14 places in 35 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 13008 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 22616ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 22618ms
Finished structural reductions in LTL mode , in 1 iterations and 22760 ms. Remains : 125/125 places, 115/115 transitions.
Stuttering acceptance computed with spot in 248 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 1470 steps with 8 reset in 15 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-00 finished in 23091 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 32 ms. Remains 64 /125 variables (removed 61) and now considering 54/115 (removed 61) transitions.
// Phase 1: matrix 54 rows 64 cols
[2024-06-01 11:39:52] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:39:52] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 11:39:52] [INFO ] Invariant cache hit.
[2024-06-01 11:39:52] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-06-01 11:39:52] [INFO ] Redundant transitions in 0 ms returned []
Running 51 sub problems to find dead transitions.
[2024-06-01 11:39:52] [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-06-01 11:39:52] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:39:52] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:39:52] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 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-06-01 11:39:53] [INFO ] Deduced a trap composed of 15 places in 29 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-06-01 11:39:53] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 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-06-01 11:39:53] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 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 1392 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 918 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 2319ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2320ms
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 2468 ms. Remains : 64/125 places, 54/115 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-01
Stuttering criterion allowed to conclude after 162 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-01 finished in 2568 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-06-01 11:39:54] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 11:39:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 11:39:55] [INFO ] Invariant cache hit.
[2024-06-01 11:39:55] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 11:39:55] [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-06-01 11:39:55] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:39:55] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:39:55] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:39:55] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:39:55] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:55] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:39:56] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:39:56] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:39:56] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:39:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:39:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:56] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:39:56] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:39:56] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:39:56] [INFO ] Deduced a trap composed of 20 places in 29 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-06-01 11:39:56] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:39:56] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:39:56] [INFO ] Deduced a trap composed of 25 places in 30 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-06-01 11:39:57] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:39:57] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-06-01 11:39:57] [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-06-01 11:39:58] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:39:58] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:39:58] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:39:58] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:39:58] [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-06-01 11:39:59] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:39:59] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:39:59] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:39:59] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:59] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:59] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:39:59] [INFO ] Deduced a trap composed of 18 places in 27 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-06-01 11:39:59] [INFO ] Deduced a trap composed of 36 places in 37 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 6024 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-06-01 11:40:01] [INFO ] Deduced a trap composed of 16 places in 35 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-06-01 11:40:02] [INFO ] Deduced a trap composed of 34 places in 41 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-06-01 11:40:02] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:40:02] [INFO ] Deduced a trap composed of 20 places in 41 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-06-01 11:40:02] [INFO ] Deduced a trap composed of 20 places in 36 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-06-01 11:40:03] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:40:04] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-06-01 11:40:04] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:40:04] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:40:04] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:40:04] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:40:04] [INFO ] Deduced a trap composed of 19 places in 37 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-06-01 11:40:06] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:40:06] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:40:06] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:40:06] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:40:07] [INFO ] Deduced a trap composed of 16 places in 35 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-06-01 11:40:08] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:40:08] [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-06-01 11:40:10] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:40:10] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:40:10] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:40:10] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:40:10] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:40:10] [INFO ] Deduced a trap composed of 26 places in 32 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-06-01 11:40:12] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 18 places in 33 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-06-01 11:40:14] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-06-01 11:40:14] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:40:15] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:40:15] [INFO ] Deduced a trap composed of 24 places in 34 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 20134 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 26172ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26173ms
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 114/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26324 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 4097 reset in 252 ms.
Product exploration explored 100000 steps with 4093 reset in 167 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 76 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 101 steps (0 resets) in 7 ms. (12 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 100 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:40:22] [INFO ] Invariant cache hit.
[2024-06-01 11:40:22] [INFO ] [Real]Absence check using 23 positive place invariants in 5 ms returned sat
[2024-06-01 11:40:22] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-01 11:40:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:40:22] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2024-06-01 11:40:22] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-01 11:40:22] [INFO ] Computed and/alt/rep : 113/200/113 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 11:40:22] [INFO ] Added : 95 causal constraints over 19 iterations in 312 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 12 ms. Remains 67 /124 variables (removed 57) and now considering 57/114 (removed 57) transitions.
// Phase 1: matrix 57 rows 67 cols
[2024-06-01 11:40:22] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:40:22] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 11:40:22] [INFO ] Invariant cache hit.
[2024-06-01 11:40:22] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-06-01 11:40:22] [INFO ] Redundant transitions in 0 ms returned []
Running 56 sub problems to find dead transitions.
[2024-06-01 11:40:22] [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-06-01 11:40:23] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 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-06-01 11:40:23] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:40:23] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 11:40:23] [INFO ] Deduced a trap composed of 31 places in 35 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-06-01 11:40:23] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:40:23] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:40:23] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 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-06-01 11:40:23] [INFO ] Deduced a trap composed of 10 places in 30 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 1416 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 950 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 2379ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2380ms
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 2500 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 16 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 30403 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 1 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 38 ms. Remains 64 /125 variables (removed 61) and now considering 54/115 (removed 61) transitions.
// Phase 1: matrix 54 rows 64 cols
[2024-06-01 11:40:25] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 11:40:25] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 11:40:25] [INFO ] Invariant cache hit.
[2024-06-01 11:40:25] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-01 11:40:25] [INFO ] Redundant transitions in 0 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-01 11:40:25] [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-06-01 11:40:25] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:40:25] [INFO ] Deduced a trap composed of 28 places in 35 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 667 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 1195 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 1869ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1871ms
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 2107 ms. Remains : 64/125 places, 54/115 transitions.
Stuttering acceptance computed with spot in 143 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 193 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-08 finished in 2275 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-06-01 11:40:27] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 11:40:27] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 11:40:27] [INFO ] Invariant cache hit.
[2024-06-01 11:40:27] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 11:40:27] [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-06-01 11:40:28] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:40:28] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:40:28] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:40:28] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:40:28] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:40:28] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:40:28] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:40:28] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:40:28] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
[2024-06-01 11:40:28] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:40:28] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:40:28] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:40:28] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:40:29] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:40:29] [INFO ] Deduced a trap composed of 20 places in 29 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-06-01 11:40:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:40:29] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:40:29] [INFO ] Deduced a trap composed of 25 places in 28 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-06-01 11:40:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:40:29] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-06-01 11:40:30] [INFO ] Deduced a trap composed of 35 places in 39 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-06-01 11:40:31] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:40:31] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:40:31] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:40:31] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:40:31] [INFO ] Deduced a trap composed of 26 places in 28 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-06-01 11:40:31] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:40:31] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:40:31] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:40:31] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:40:31] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:40:32] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:40:32] [INFO ] Deduced a trap composed of 18 places in 26 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-06-01 11:40:32] [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 6047 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-06-01 11:40:34] [INFO ] Deduced a trap composed of 16 places in 33 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-06-01 11:40:34] [INFO ] Deduced a trap composed of 34 places in 28 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-06-01 11:40:35] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
[2024-06-01 11:40:35] [INFO ] Deduced a trap composed of 20 places in 46 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-06-01 11:40:35] [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-06-01 11:40:36] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:40:36] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:40:36] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:40:36] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:40:37] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:40:37] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:40:37] [INFO ] Deduced a trap composed of 19 places in 33 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-06-01 11:40:39] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:40:40] [INFO ] Deduced a trap composed of 16 places in 39 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-06-01 11:40:41] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:40:41] [INFO ] Deduced a trap composed of 17 places in 24 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-06-01 11:40:43] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-06-01 11:40:43] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:40:43] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:40:43] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:40:43] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:40:43] [INFO ] Deduced a trap composed of 26 places in 30 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-06-01 11:40:45] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:40:45] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:40:45] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:40:45] [INFO ] Deduced a trap composed of 18 places in 37 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-06-01 11:40:47] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:40:47] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:40:47] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:40:47] [INFO ] Deduced a trap composed of 24 places in 29 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 19996 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 26054ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26055ms
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 114/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26209 ms. Remains : 124/125 places, 114/115 transitions.
Stuttering acceptance computed with spot in 158 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 1517 reset in 143 ms.
Product exploration explored 100000 steps with 1535 reset in 163 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 85 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 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 262 steps (0 resets) in 6 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 107 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 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:40:55] [INFO ] Invariant cache hit.
[2024-06-01 11:40:55] [INFO ] [Real]Absence check using 23 positive place invariants in 5 ms returned sat
[2024-06-01 11:40:55] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-01 11:40:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:40:55] [INFO ] [Nat]Absence check using 23 positive place invariants in 4 ms returned sat
[2024-06-01 11:40:55] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-01 11:40:55] [INFO ] Computed and/alt/rep : 113/200/113 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 11:40:55] [INFO ] Added : 86 causal constraints over 18 iterations in 249 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-06-01 11:40:55] [INFO ] Invariant cache hit.
[2024-06-01 11:40:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 11:40:55] [INFO ] Invariant cache hit.
[2024-06-01 11:40:55] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 11:40:55] [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-06-01 11:40:56] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 20 places in 27 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-06-01 11:40:57] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:40:57] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:40:57] [INFO ] Deduced a trap composed of 25 places in 30 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-06-01 11:40:57] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:40:57] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-06-01 11:40:57] [INFO ] Deduced a trap composed of 35 places in 43 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-06-01 11:40:58] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:40:58] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:40:58] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:40:59] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:40:59] [INFO ] Deduced a trap composed of 26 places in 34 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-06-01 11:40:59] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:40:59] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:40:59] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:40:59] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:40:59] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:40:59] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:40:59] [INFO ] Deduced a trap composed of 18 places in 27 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-06-01 11:41:00] [INFO ] Deduced a trap composed of 36 places in 43 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 6004 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-06-01 11:41:02] [INFO ] Deduced a trap composed of 16 places in 35 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-06-01 11:41:02] [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-06-01 11:41:02] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:41:02] [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-06-01 11:41:03] [INFO ] Deduced a trap composed of 20 places in 35 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-06-01 11:41:04] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:41:04] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:41:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:41:04] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:41:04] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:41:04] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:41:05] [INFO ] Deduced a trap composed of 19 places in 31 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-06-01 11:41:06] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:41:07] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:41:07] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:41:07] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:41:07] [INFO ] Deduced a trap composed of 16 places in 37 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-06-01 11:41:08] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:41:09] [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-06-01 11:41:11] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:41:11] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:41:11] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:41:11] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:41:11] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:41:11] [INFO ] Deduced a trap composed of 26 places in 26 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-06-01 11:41:12] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:41:13] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:41:13] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:41:13] [INFO ] Deduced a trap composed of 18 places in 32 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-06-01 11:41:15] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:41:15] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-06-01 11:41:15] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:41:15] [INFO ] Deduced a trap composed of 24 places in 35 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 20371 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 26387ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26391ms
Finished structural reductions in LTL mode , in 1 iterations and 26525 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 69 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 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 255 steps (0 resets) in 5 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 92 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 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:41:22] [INFO ] Invariant cache hit.
[2024-06-01 11:41:22] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2024-06-01 11:41:22] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-01 11:41:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:41:22] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2024-06-01 11:41:22] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-01 11:41:22] [INFO ] Computed and/alt/rep : 113/200/113 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 11:41:23] [INFO ] Added : 86 causal constraints over 18 iterations in 296 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1526 reset in 113 ms.
Product exploration explored 100000 steps with 1527 reset in 126 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 134 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-06-01 11:41:24] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
// Phase 1: matrix 99 rows 108 cols
[2024-06-01 11:41:24] [INFO ] Computed 23 invariants in 3 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-06-01 11:41:24] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 11:41:24] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 11:41:24] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 11:41:24] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 11:41:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-06-01 11:41:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
[2024-06-01 11:41:24] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 11:41:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-06-01 11:41:24] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-06-01 11:41:25] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 11:41:25] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-01 11:41:25] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 11:41:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
[2024-06-01 11:41:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-06-01 11:41:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 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-06-01 11:41:25] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-06-01 11:41:25] [INFO ] Deduced a trap composed of 3 places in 20 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-06-01 11:41:25] [INFO ] Deduced a trap composed of 13 places in 36 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 2287 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 1525 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 3857ms problems are : Problem set: 44 solved, 54 unsolved
Search for dead transitions found 44 dead transitions in 3859ms
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.1 ms
Discarding 43 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 25 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 3924 ms. Remains : 65/124 places, 55/114 transitions.
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-06-01 11:41:27] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:41:28] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 11:41:28] [INFO ] Invariant cache hit.
[2024-06-01 11:41:28] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 11:41:28] [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-06-01 11:41:28] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:41:29] [INFO ] Deduced a trap composed of 20 places in 42 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-06-01 11:41:30] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:41:30] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:41:30] [INFO ] Deduced a trap composed of 25 places in 42 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-06-01 11:41:30] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:41:30] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:41:30] [INFO ] Deduced a trap composed of 35 places in 46 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-06-01 11:41:32] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:41:32] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:41:32] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:41:32] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:41:32] [INFO ] Deduced a trap composed of 26 places in 32 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-06-01 11:41:32] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:41:32] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:41:32] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:41:33] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:41:33] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:41:33] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:41:33] [INFO ] Deduced a trap composed of 18 places in 31 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-06-01 11:41:33] [INFO ] Deduced a trap composed of 36 places in 41 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 6722 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-06-01 11:41:35] [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-06-01 11:41:35] [INFO ] Deduced a trap composed of 34 places in 36 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-06-01 11:41:36] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:41:36] [INFO ] Deduced a trap composed of 20 places in 40 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-06-01 11:41:36] [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-06-01 11:41:37] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:41:37] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:41:37] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:41:38] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:41:38] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:41:38] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:41:38] [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-06-01 11:41:40] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:41:41] [INFO ] Deduced a trap composed of 16 places in 30 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-06-01 11:41:42] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:41:42] [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-06-01 11:41:44] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:41:44] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:41:44] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:41:44] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:41:44] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:41:44] [INFO ] Deduced a trap composed of 26 places in 28 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-06-01 11:41:46] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:41:46] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:41:46] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:41:46] [INFO ] Deduced a trap composed of 18 places in 35 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-06-01 11:41:48] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:41:48] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:41:48] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:41:49] [INFO ] Deduced a trap composed of 24 places in 32 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 20253 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 26999ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 27002ms
Finished structural reductions in LTL mode , in 1 iterations and 27238 ms. Remains : 124/124 places, 114/114 transitions.
Treatment of property ShieldPPPs-PT-002B-LTLFireability-09 finished in 87605 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 7 ms. Remains 124 /125 variables (removed 1) and now considering 114/115 (removed 1) transitions.
[2024-06-01 11:41:55] [INFO ] Invariant cache hit.
[2024-06-01 11:41:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 11:41:55] [INFO ] Invariant cache hit.
[2024-06-01 11:41:55] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 11:41:55] [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-06-01 11:41:56] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 20 places in 33 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-06-01 11:41:56] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:41:57] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:41:57] [INFO ] Deduced a trap composed of 25 places in 32 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-06-01 11:41:57] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:41:57] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:41:57] [INFO ] Deduced a trap composed of 35 places in 43 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-06-01 11:41:58] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:41:58] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:41:58] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:41:59] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:41:59] [INFO ] Deduced a trap composed of 26 places in 36 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-06-01 11:41:59] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:41:59] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:41:59] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:41:59] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:41:59] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:41:59] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:41:59] [INFO ] Deduced a trap composed of 18 places in 25 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-06-01 11:42:00] [INFO ] Deduced a trap composed of 36 places in 41 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 6151 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-06-01 11:42:02] [INFO ] Deduced a trap composed of 16 places in 37 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-06-01 11:42:02] [INFO ] Deduced a trap composed of 34 places in 39 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-06-01 11:42:02] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:42:02] [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-06-01 11:42:03] [INFO ] Deduced a trap composed of 20 places in 38 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-06-01 11:42:04] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:42:04] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:42:04] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:42:04] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:42:04] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:42:04] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:42:05] [INFO ] Deduced a trap composed of 19 places in 34 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-06-01 11:42:07] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:42:07] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:42:07] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:42:07] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:42:07] [INFO ] Deduced a trap composed of 16 places in 35 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-06-01 11:42:09] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 17 places in 27 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-06-01 11:42:11] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:42:11] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:42:11] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:42:11] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:42:11] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:42:11] [INFO ] Deduced a trap composed of 26 places in 26 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-06-01 11:42:12] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:42:13] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:42:13] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:42:13] [INFO ] Deduced a trap composed of 18 places in 29 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-06-01 11:42:15] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 24 places in 35 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 20295 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 26460ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26461ms
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 114/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26596 ms. Remains : 124/125 places, 114/115 transitions.
Stuttering acceptance computed with spot in 150 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 2498 reset in 106 ms.
Product exploration explored 100000 steps with 2514 reset in 169 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 142 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 213 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 (99 resets) in 319 ms. (125 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
[2024-06-01 11:42:22] [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 68 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 35 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 108ms 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 101 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 27830 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-06-01 11:42:23] [INFO ] Invariant cache hit.
[2024-06-01 11:42:23] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 11:42:23] [INFO ] Invariant cache hit.
[2024-06-01 11:42:23] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 11:42:23] [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-06-01 11:42:23] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:42:23] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:42:23] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:42:24] [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-06-01 11:42:24] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:42:24] [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-06-01 11:42:25] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:42:25] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-06-01 11:42:25] [INFO ] Deduced a trap composed of 35 places in 39 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-06-01 11:42:26] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:42:26] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:42:26] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:42:26] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:42:26] [INFO ] Deduced a trap composed of 26 places in 30 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-06-01 11:42:27] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:42:27] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:42:27] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:42:27] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:42:27] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 2 ms to minimize.
[2024-06-01 11:42:27] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:42:27] [INFO ] Deduced a trap composed of 18 places in 28 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-06-01 11:42:27] [INFO ] Deduced a trap composed of 36 places in 37 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 6054 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-06-01 11:42:29] [INFO ] Deduced a trap composed of 16 places in 38 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-06-01 11:42:30] [INFO ] Deduced a trap composed of 34 places in 33 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-06-01 11:42:30] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:42:30] [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-06-01 11:42:30] [INFO ] Deduced a trap composed of 20 places in 35 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-06-01 11:42:32] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:42:32] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:42:32] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:42:32] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:42:32] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:42:32] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:42:32] [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-06-01 11:42:34] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:42:35] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:42:35] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:42:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:42:35] [INFO ] Deduced a trap composed of 16 places in 47 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-06-01 11:42:36] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:42:36] [INFO ] Deduced a trap composed of 17 places in 27 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-06-01 11:42:38] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:42:38] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:42:38] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:42:38] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:42:38] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:42:38] [INFO ] Deduced a trap composed of 26 places in 27 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-06-01 11:42:40] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:42:40] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:42:40] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:42:40] [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-06-01 11:42:43] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-06-01 11:42:43] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:42:43] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:42:43] [INFO ] Deduced a trap composed of 24 places in 31 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 20358 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 26424ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26427ms
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 114/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26574 ms. Remains : 124/125 places, 114/115 transitions.
Stuttering acceptance computed with spot in 122 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 69 ms.
Product exploration explored 100000 steps with 33333 reset in 71 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 20 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 26874 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 7 ms. Remains 124 /125 variables (removed 1) and now considering 114/115 (removed 1) transitions.
[2024-06-01 11:42:49] [INFO ] Invariant cache hit.
[2024-06-01 11:42:50] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 11:42:50] [INFO ] Invariant cache hit.
[2024-06-01 11:42:50] [INFO ] Implicit Places using invariants and state equation in 90 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-06-01 11:42:50] [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-06-01 11:42:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:42:50] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:42:50] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:42:50] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:42:50] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:42:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:42:50] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:42:51] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:42:51] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:42:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:42:51] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:42:51] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:42:51] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:42:51] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:42:51] [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-06-01 11:42:51] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:42:51] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:42:51] [INFO ] Deduced a trap composed of 25 places in 32 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-06-01 11:42:52] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:42:52] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:42:52] [INFO ] Deduced a trap composed of 35 places in 44 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-06-01 11:42:53] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:42:53] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:42:53] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:42:53] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:42:53] [INFO ] Deduced a trap composed of 26 places in 34 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-06-01 11:42:54] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:42:54] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:42:54] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:42:54] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:42:54] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:42:54] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:42:54] [INFO ] Deduced a trap composed of 18 places in 30 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-06-01 11:42:54] [INFO ] Deduced a trap composed of 36 places in 36 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 5892 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-06-01 11:42:56] [INFO ] Deduced a trap composed of 16 places in 35 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-06-01 11:42:56] [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-06-01 11:42:57] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:42:57] [INFO ] Deduced a trap composed of 20 places in 36 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-06-01 11:42:57] [INFO ] Deduced a trap composed of 20 places in 34 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-06-01 11:42:58] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:42:58] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:42:58] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:42:59] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:42:59] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-06-01 11:42:59] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:42:59] [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-06-01 11:43:01] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:43:01] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:43:01] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:43:01] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:43:02] [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-06-01 11:43:03] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:43:03] [INFO ] Deduced a trap composed of 17 places in 24 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-06-01 11:43:05] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:43:05] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:43:05] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:43:05] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:43:05] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:43:05] [INFO ] Deduced a trap composed of 26 places in 29 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-06-01 11:43:07] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:43:07] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:43:07] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:43:07] [INFO ] Deduced a trap composed of 18 places in 32 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-06-01 11:43:09] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:43:09] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:43:09] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:43:09] [INFO ] Deduced a trap composed of 24 places in 36 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 20185 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 26088ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26089ms
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 114/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26245 ms. Remains : 124/125 places, 114/115 transitions.
Stuttering acceptance computed with spot in 205 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 26482 steps with 486 reset in 37 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-12 finished in 26503 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 30 ms. Remains 65 /125 variables (removed 60) and now considering 55/115 (removed 60) transitions.
// Phase 1: matrix 55 rows 65 cols
[2024-06-01 11:43:16] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:43:16] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 11:43:16] [INFO ] Invariant cache hit.
[2024-06-01 11:43:16] [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-06-01 11:43:16] [INFO ] Redundant transitions in 0 ms returned []
Running 51 sub problems to find dead transitions.
[2024-06-01 11:43:16] [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-06-01 11:43:16] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:43:16] [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 753 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 895 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 1655ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1656ms
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 1793 ms. Remains : 65/125 places, 55/115 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-13
Product exploration explored 100000 steps with 8262 reset in 120 ms.
Product exploration explored 100000 steps with 8287 reset in 132 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 38 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 39 steps (0 resets) in 7 ms. (4 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 423 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 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 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 4 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-06-01 11:43:19] [INFO ] Invariant cache hit.
[2024-06-01 11:43:19] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 11:43:19] [INFO ] Invariant cache hit.
[2024-06-01 11:43:19] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-06-01 11:43:19] [INFO ] Redundant transitions in 0 ms returned []
Running 51 sub problems to find dead transitions.
[2024-06-01 11:43:19] [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-06-01 11:43:19] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:43:19] [INFO ] Deduced a trap composed of 31 places in 28 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 783 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 887 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 1676ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1676ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1789 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 410 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 60 steps (0 resets) in 4 ms. (12 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 470 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 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8269 reset in 124 ms.
Product exploration explored 100000 steps with 8258 reset in 139 ms.
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 1 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-06-01 11:43:22] [INFO ] Invariant cache hit.
[2024-06-01 11:43:22] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 11:43:22] [INFO ] Invariant cache hit.
[2024-06-01 11:43:22] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-06-01 11:43:22] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-06-01 11:43:22] [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-06-01 11:43:22] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:43:23] [INFO ] Deduced a trap composed of 31 places in 30 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 759 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 882 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 1648ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1649ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1757 ms. Remains : 65/65 places, 55/55 transitions.
Treatment of property ShieldPPPs-PT-002B-LTLFireability-13 finished in 7933 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 0 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 9 ms. Remains 64 /125 variables (removed 61) and now considering 54/115 (removed 61) transitions.
// Phase 1: matrix 54 rows 64 cols
[2024-06-01 11:43:24] [INFO ] Computed 23 invariants in 0 ms
[2024-06-01 11:43:24] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 11:43:24] [INFO ] Invariant cache hit.
[2024-06-01 11:43:24] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-06-01 11:43:24] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-01 11:43:24] [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-06-01 11:43:24] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:43:24] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:43:24] [INFO ] Deduced a trap composed of 29 places in 24 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-06-01 11:43:25] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:43:25] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 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 1454 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 2269ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2270ms
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 2374 ms. Remains : 64/125 places, 54/115 transitions.
Stuttering acceptance computed with spot in 145 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 168 steps with 2 reset in 2 ms.
FORMULA ShieldPPPs-PT-002B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLFireability-14 finished in 2544 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)))))'
Found a Shortening insensitive property : ShieldPPPs-PT-002B-LTLFireability-09
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in LI_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 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 30 place count 109 transition count 90
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 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 20 ms. Remains 64 /125 variables (removed 61) and now considering 54/115 (removed 61) transitions.
// Phase 1: matrix 54 rows 64 cols
[2024-06-01 11:43:27] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:43:27] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 11:43:27] [INFO ] Invariant cache hit.
[2024-06-01 11:43:27] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-01 11:43:27] [INFO ] Invariant cache hit.
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, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 54/118 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 0/118 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 87 constraints, problems are : Problem set: 0 solved, 52 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 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, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 54/118 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 52/139 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 0/118 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 139 constraints, problems are : Problem set: 0 solved, 52 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1198ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1198ms
Starting structural reductions in LI_LTL mode, iteration 1 : 64/125 places, 54/115 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1324 ms. Remains : 64/125 places, 54/115 transitions.
Running random walk in product with property : ShieldPPPs-PT-002B-LTLFireability-09
Product exploration explored 100000 steps with 5812 reset in 151 ms.
Product exploration explored 100000 steps with 5810 reset in 127 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 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 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 79 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 111 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 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:43:29] [INFO ] Invariant cache hit.
[2024-06-01 11:43:29] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2024-06-01 11:43:29] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 11:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:43:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2024-06-01 11:43:29] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 11:43:29] [INFO ] Computed and/alt/rep : 52/95/52 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 11:43:29] [INFO ] Added : 35 causal constraints over 7 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-06-01 11:43:29] [INFO ] Invariant cache hit.
[2024-06-01 11:43:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 11:43:29] [INFO ] Invariant cache hit.
[2024-06-01 11:43:29] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-01 11:43:29] [INFO ] Invariant cache hit.
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, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 54/118 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 0/118 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 87 constraints, problems are : Problem set: 0 solved, 52 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 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, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 54/118 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 52/139 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 0/118 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 139 constraints, problems are : Problem set: 0 solved, 52 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1197ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1197ms
Finished structural reductions in LTL mode , in 1 iterations and 1300 ms. Remains : 64/64 places, 54/54 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 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 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 62 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 94 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 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:43:31] [INFO ] Invariant cache hit.
[2024-06-01 11:43:31] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2024-06-01 11:43:31] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 11:43:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:43:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2024-06-01 11:43:31] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 11:43:31] [INFO ] Computed and/alt/rep : 52/95/52 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 11:43:31] [INFO ] Added : 35 causal constraints over 7 iterations in 45 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5739 reset in 120 ms.
Product exploration explored 100000 steps with 5843 reset in 129 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-06-01 11:43:32] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-01 11:43: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
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 54/118 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 0/118 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 87 constraints, problems are : Problem set: 0 solved, 52 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 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, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 54/118 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 52/139 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 0/118 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 139 constraints, problems are : Problem set: 0 solved, 52 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1211ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1212ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1221 ms. Remains : 64/64 places, 54/54 transitions.
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-06-01 11:43:33] [INFO ] Invariant cache hit.
[2024-06-01 11:43:33] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 11:43:33] [INFO ] Invariant cache hit.
[2024-06-01 11:43:33] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-01 11:43:33] [INFO ] Invariant cache hit.
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, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 54/118 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 0/118 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 87 constraints, problems are : Problem set: 0 solved, 52 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 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, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 54/118 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 52/139 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 0/118 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 139 constraints, problems are : Problem set: 0 solved, 52 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1217ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1218ms
Finished structural reductions in LTL mode , in 1 iterations and 1323 ms. Remains : 64/64 places, 54/54 transitions.
Treatment of property ShieldPPPs-PT-002B-LTLFireability-09 finished in 8063 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-06-01 11:43:35] [INFO ] Flatten gal took : 12 ms
[2024-06-01 11:43:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 11:43:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 125 places, 115 transitions and 326 arcs took 4 ms.
Total runtime 269934 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldPPPs-PT-002B-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPs-PT-002B-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717242353880

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldPPPs-PT-002B-LTLFireability-09
ltl formula formula --ltl=/tmp/3479/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 125 places, 115 transitions and 326 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3479/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3479/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3479/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3479/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 127 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 126, there are 120 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~148 levels ~10000 states ~21872 transitions
pnml2lts-mc( 2/ 4): ~148 levels ~20000 states ~45952 transitions
pnml2lts-mc( 3/ 4): ~168 levels ~40000 states ~108328 transitions
pnml2lts-mc( 3/ 4): ~168 levels ~80000 states ~228764 transitions
pnml2lts-mc( 3/ 4): ~168 levels ~160000 states ~497380 transitions
pnml2lts-mc( 2/ 4): ~150 levels ~320000 states ~928720 transitions
pnml2lts-mc( 2/ 4): ~150 levels ~640000 states ~1893988 transitions
pnml2lts-mc( 2/ 4): ~150 levels ~1280000 states ~3899396 transitions
pnml2lts-mc( 2/ 4): ~150 levels ~2560000 states ~8047576 transitions
pnml2lts-mc( 2/ 4): ~165 levels ~5120000 states ~16374136 transitions
pnml2lts-mc( 2/ 4): ~165 levels ~10240000 states ~34174664 transitions
pnml2lts-mc( 2/ 4): ~166 levels ~20480000 states ~73044732 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33552032
pnml2lts-mc( 0/ 4): unique states count: 33552537
pnml2lts-mc( 0/ 4): unique transitions count: 131340950
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 97789911
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33553961
pnml2lts-mc( 0/ 4): - cum. max stack depth: 686
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553961 states 131349130 transitions, fanout: 3.915
pnml2lts-mc( 0/ 4): Total exploration time 65.190 sec (65.160 sec minimum, 65.175 sec on average)
pnml2lts-mc( 0/ 4): States per second: 514710, Transitions per second: 2014866
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.6MB, 8.1 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 115 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.6MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-002B-LTLFireability-13
ltl formula formula --ltl=/tmp/3479/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 125 places, 115 transitions and 326 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3479/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3479/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3479/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3479/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 126 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 126, there are 139 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~136 levels ~10000 states ~27320 transitions
pnml2lts-mc( 0/ 4): ~159 levels ~20000 states ~52544 transitions
pnml2lts-mc( 0/ 4): ~159 levels ~40000 states ~113864 transitions
pnml2lts-mc( 0/ 4): ~160 levels ~80000 states ~225064 transitions
pnml2lts-mc( 0/ 4): ~160 levels ~160000 states ~463964 transitions
pnml2lts-mc( 0/ 4): ~160 levels ~320000 states ~983748 transitions
pnml2lts-mc( 0/ 4): ~160 levels ~640000 states ~2127816 transitions
pnml2lts-mc( 0/ 4): ~162 levels ~1280000 states ~4190376 transitions
pnml2lts-mc( 0/ 4): ~162 levels ~2560000 states ~8540812 transitions
pnml2lts-mc( 0/ 4): ~162 levels ~5120000 states ~18609496 transitions
pnml2lts-mc( 0/ 4): ~173 levels ~10240000 states ~38713540 transitions
pnml2lts-mc( 3/ 4): ~165 levels ~20480000 states ~78356556 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33552521
pnml2lts-mc( 0/ 4): unique states count: 33552953
pnml2lts-mc( 0/ 4): unique transitions count: 143356682
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 109802645
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33553336
pnml2lts-mc( 0/ 4): - cum. max stack depth: 639
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553336 states 143359033 transitions, fanout: 4.273
pnml2lts-mc( 0/ 4): Total exploration time 72.230 sec (72.210 sec minimum, 72.215 sec on average)
pnml2lts-mc( 0/ 4): States per second: 464535, Transitions per second: 1984758
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 264.7MB, 8.3 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/13.0%
pnml2lts-mc( 0/ 4): Stored 115 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 264.7MB (~256.0MB paged-in)

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="ltsminxred"
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 ltsminxred"
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 r528-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 ;