fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r198-tall-174894533400788
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ShieldPPPt-PT-001B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 96486.00 0.00 0.00 FFFTFFFFFFFFFFFF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533400788.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ShieldPPPt-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533400788
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 19K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749294898892

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 11:15:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 11:15:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 11:15:00] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2025-06-07 11:15:00] [INFO ] Transformed 81 places.
[2025-06-07 11:15:00] [INFO ] Transformed 74 transitions.
[2025-06-07 11:15:00] [INFO ] Found NUPN structural information;
[2025-06-07 11:15:00] [INFO ] Parsed PT model containing 81 places and 74 transitions and 184 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-001B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 76 transition count 69
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 76 transition count 69
Applied a total of 10 rules in 17 ms. Remains 76 /81 variables (removed 5) and now considering 69/74 (removed 5) transitions.
// Phase 1: matrix 69 rows 76 cols
[2025-06-07 11:15:00] [INFO ] Computed 12 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:00] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-07 11:15:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:00] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2025-06-07 11:15:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:01] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:01] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:01] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:01] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:01] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:01] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:01] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:01] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:01] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 69/145 variables, 76/97 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 97 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2500 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:03] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:03] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 69/145 variables, 76/99 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 68/167 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:03] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:04] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:04] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:04] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:04] [INFO ] Deduced a trap along path composed of 6 places in 56 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:04] [INFO ] Deduced a trap along path composed of 5 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:05] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:05] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:07] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:08] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/145 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 178 constraints, problems are : Problem set: 0 solved, 68 unsolved in 10030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 12559ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 12571ms
Starting structural reductions in LTL mode, iteration 1 : 76/81 places, 69/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12921 ms. Remains : 76/81 places, 69/74 transitions.
Support contains 31 out of 76 places after structural reductions.
[2025-06-07 11:15:13] [INFO ] Flatten gal took : 26 ms
[2025-06-07 11:15:13] [INFO ] Flatten gal took : 23 ms
[2025-06-07 11:15:13] [INFO ] Input system was already deterministic with 69 transitions.
RANDOM walk for 988 steps (0 resets) in 82 ms. (11 steps per ms) remains 0/28 properties
Computed a total of 18 stabilizing places and 18 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((p0 U (p1||G(p0)))))||(F((p0 U (p1||G(p0))))&&F((G(F(!p2))||(!p0&&F(!p2))))))))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 69/69 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 69 transition count 62
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 68 transition count 61
Applied a total of 16 rules in 7 ms. Remains 68 /76 variables (removed 8) and now considering 61/69 (removed 8) transitions.
// Phase 1: matrix 61 rows 68 cols
[2025-06-07 11:15:14] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:14] [INFO ] Implicit Places using invariants in 380 ms returned []
[2025-06-07 11:15:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:14] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-07 11:15:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:15] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:15] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:15] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:15] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:15] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:15] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/129 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 86 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2306 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/129 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 60/146 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:17] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:17] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:17] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:17] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:17] [INFO ] Deduced a trap along path composed of 4 places in 68 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:18] [INFO ] Deduced a trap along path composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 152 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2881 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 5207ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 5208ms
Starting structural reductions in LTL mode, iteration 1 : 68/76 places, 61/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5697 ms. Remains : 68/76 places, 61/69 transitions.
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-00
Product exploration explored 100000 steps with 1919 reset in 285 ms.
Stack based approach found an accepted trace after 137 steps with 1 reset with depth 35 and stack size 35 in 0 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-00 finished in 6449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X(p1)&&(G(p2)||G(!p2))))))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 70 transition count 63
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 70 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 69 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 69 transition count 62
Applied a total of 14 rules in 13 ms. Remains 69 /76 variables (removed 7) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 69 cols
[2025-06-07 11:15:20] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:20] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-07 11:15:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:20] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-07 11:15:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:21] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:21] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:21] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:21] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:21] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:21] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:21] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:21] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 62/131 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 89 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1632 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 62/131 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 61/150 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:22] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:22] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:22] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:22] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:22] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:23] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:23] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:23] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:24] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/131 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:25] [INFO ] Deduced a trap along path composed of 7 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:25] [INFO ] Deduced a trap along path composed of 5 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:26] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:27] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/131 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/131 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 163 constraints, problems are : Problem set: 0 solved, 61 unsolved in 9798 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 11438ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 11439ms
Starting structural reductions in LTL mode, iteration 1 : 69/76 places, 62/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11557 ms. Remains : 69/76 places, 62/69 transitions.
Stuttering acceptance computed with spot in 391 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), p2, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-01 finished in 11978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 69/69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 75 transition count 49
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 56 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 55 transition count 47
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 41 place count 55 transition count 43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 49 place count 51 transition count 43
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 48 transition count 40
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 48 transition count 40
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 89 place count 31 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 30 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 29 transition count 22
Applied a total of 92 rules in 24 ms. Remains 29 /76 variables (removed 47) and now considering 22/69 (removed 47) transitions.
// Phase 1: matrix 22 rows 29 cols
[2025-06-07 11:15:32] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:32] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-07 11:15:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:32] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 11:15:32] [INFO ] Redundant transitions in 1 ms returned []
Running 19 sub problems to find dead transitions.
[2025-06-07 11:15:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 22/51 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 41 constraints, problems are : Problem set: 0 solved, 19 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 22/51 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 60 constraints, problems are : Problem set: 0 solved, 19 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 468ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 470ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/76 places, 22/69 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 567 ms. Remains : 29/76 places, 22/69 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-02
Stuttering criterion allowed to conclude after 1725 steps with 3 reset in 7 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-02 finished in 712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 70 transition count 63
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 70 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 69 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 69 transition count 62
Applied a total of 14 rules in 16 ms. Remains 69 /76 variables (removed 7) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 69 cols
[2025-06-07 11:15:33] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:33] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 11:15:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:33] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-07 11:15:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:33] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:33] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:33] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:33] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:33] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:33] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:33] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 62/131 variables, 69/88 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 88 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1565 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 62/131 variables, 69/88 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 61/149 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:35] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:35] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:35] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:35] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:35] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:35] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:35] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:35] [INFO ] Deduced a trap along path composed of 4 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:35] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:36] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 159 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4643 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 6228ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 6229ms
Starting structural reductions in LTL mode, iteration 1 : 69/76 places, 62/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6341 ms. Remains : 69/76 places, 62/69 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 46 ms.
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 46 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-001B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-001B-LTLFireability-03 finished in 6631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 69/69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 75 transition count 48
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 55 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 54 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 43 place count 54 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 53 place count 49 transition count 41
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 57 place count 45 transition count 37
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 45 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 61 place count 45 transition count 36
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 63 place count 44 transition count 36
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 93 place count 29 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 27 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 26 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 25 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 99 place count 25 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 103 place count 23 transition count 18
Applied a total of 103 rules in 30 ms. Remains 23 /76 variables (removed 53) and now considering 18/69 (removed 51) transitions.
// Phase 1: matrix 18 rows 23 cols
[2025-06-07 11:15:39] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:39] [INFO ] Implicit Places using invariants in 43 ms returned [6, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/76 places, 18/69 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 19 transition count 16
Applied a total of 4 rules in 1 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 19 cols
[2025-06-07 11:15:39] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:40] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-07 11:15:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:40] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/76 places, 16/69 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 19/76 places, 16/69 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-04
Product exploration explored 100000 steps with 3131 reset in 92 ms.
Stack based approach found an accepted trace after 406 steps with 16 reset with depth 19 and stack size 18 in 1 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-04 finished in 402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G((G(p1)||(p1&&F(p2))))||((G(p1)||(p1&&F(p2)))&&F(!p3))))))'
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 71 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 71 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 70 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 70 transition count 63
Applied a total of 12 rules in 9 ms. Remains 70 /76 variables (removed 6) and now considering 63/69 (removed 6) transitions.
// Phase 1: matrix 63 rows 70 cols
[2025-06-07 11:15:40] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:40] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-07 11:15:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:40] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2025-06-07 11:15:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:41] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:41] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:41] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:41] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:41] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:41] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 63/133 variables, 70/89 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 89 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2093 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/133 variables, 70/89 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 62/151 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:43] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:43] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:43] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:43] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:43] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:43] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:43] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:43] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:44] [INFO ] Deduced a trap along path composed of 5 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:44] [INFO ] Deduced a trap along path composed of 6 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:44] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:45] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 0/133 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 163 constraints, problems are : Problem set: 0 solved, 62 unsolved in 4633 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 6760ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 6761ms
Starting structural reductions in LTL mode, iteration 1 : 70/76 places, 63/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6933 ms. Remains : 70/76 places, 63/69 transitions.
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) p3), (NOT p2), p3]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-05
Product exploration explored 100000 steps with 348 reset in 128 ms.
Product exploration explored 100000 steps with 352 reset in 221 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1 p2 (NOT p3)), (X p2), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT p3)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT p3))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 151 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) p3), (NOT p2), p3]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (12 resets) in 242 ms. (164 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (11 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
[2025-06-07 11:15:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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
Problem apf3 is UNSAT
After SMT solving in domain Real declared 14/133 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/12 constraints, State Equation: 0/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65ms 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 p2 (NOT p3)), (X p2), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT p3)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT p3))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p3)))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (OR p1 p2))), (F (NOT p2)), (F p3), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F (NOT (OR p1 (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2)))]
Knowledge based reduction with 23 factoid took 433 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter insensitive) to 5 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p2) p0 (NOT p1)), (AND p3 p0 (NOT p1)), (NOT p2), p3]
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p2) p0 (NOT p1)), (AND p3 p0 (NOT p1)), (NOT p2), p3]
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 63/63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 69 transition count 50
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 57 transition count 50
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 24 place count 57 transition count 44
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 36 place count 51 transition count 44
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 68 place count 35 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 35 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 33 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 33 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 32 transition count 26
Applied a total of 75 rules in 13 ms. Remains 32 /70 variables (removed 38) and now considering 26/63 (removed 37) transitions.
// Phase 1: matrix 26 rows 32 cols
[2025-06-07 11:15:49] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:49] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-07 11:15:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:49] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 11:15:49] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-07 11:15:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 26/58 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/58 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 44 constraints, problems are : Problem set: 0 solved, 24 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 26/58 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 24/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/58 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 68 constraints, problems are : Problem set: 0 solved, 24 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 651ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 651ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/70 places, 26/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 752 ms. Remains : 32/70 places, 26/63 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 p0 p1 p2 (NOT p3)), (X p2), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT p3)), (X (NOT (AND p0 p1 p3))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p0 p1 p3))), (X (X (NOT (AND p0 p1 p3))))]
Knowledge based reduction with 15 factoid took 230 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter insensitive) to 5 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p2) p0 (NOT p1)), (AND p3 p0 (NOT p1)), (NOT p2), p3]
RANDOM walk for 40000 steps (15 resets) in 139 ms. (285 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
[2025-06-07 11:15:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf5 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 14/58 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 4/12 constraints, State Equation: 0/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2 (NOT p3)), (X p2), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT p3)), (X (NOT (AND p0 p1 p3))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p0 p1 p2)), (G (OR p0 p1 (NOT p3)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p0 p1 p3))), (X (X (NOT (AND p0 p1 p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1) p2)))]
Knowledge based reduction with 17 factoid took 499 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter insensitive) to 5 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p2) p0 (NOT p1)), (AND p3 p0 (NOT p1)), (NOT p2), p3]
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p2) p0 (NOT p1)), (AND p3 p0 (NOT p1)), (NOT p2), p3]
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p2) p0 (NOT p1)), (AND p3 p0 (NOT p1)), (NOT p2), p3]
Product exploration explored 100000 steps with 1319 reset in 124 ms.
Stack based approach found an accepted trace after 3152 steps with 37 reset with depth 150 and stack size 144 in 5 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-05 finished in 11768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 69/69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 75 transition count 50
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 57 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 56 transition count 48
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 39 place count 56 transition count 43
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 49 place count 51 transition count 43
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 48 transition count 40
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 48 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 55 place count 48 transition count 39
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 57 place count 47 transition count 39
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 87 place count 32 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 30 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 29 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 28 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 93 place count 28 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 97 place count 26 transition count 21
Applied a total of 97 rules in 14 ms. Remains 26 /76 variables (removed 50) and now considering 21/69 (removed 48) transitions.
// Phase 1: matrix 21 rows 26 cols
[2025-06-07 11:15:52] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:52] [INFO ] Implicit Places using invariants in 75 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/76 places, 21/69 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 20
Applied a total of 2 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 20/21 (removed 1) transitions.
// Phase 1: matrix 20 rows 23 cols
[2025-06-07 11:15:52] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:52] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 11:15:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:52] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/76 places, 20/69 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 23/76 places, 20/69 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-06
Product exploration explored 100000 steps with 72 reset in 110 ms.
Stack based approach found an accepted trace after 92 steps with 0 reset with depth 93 and stack size 90 in 0 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-06 finished in 334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((X(X(X(p1)))&&F((G(F(p2))||(!p3&&F(p2)))))||p0)))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 70 transition count 63
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 70 transition count 63
Applied a total of 12 rules in 2 ms. Remains 70 /76 variables (removed 6) and now considering 63/69 (removed 6) transitions.
// Phase 1: matrix 63 rows 70 cols
[2025-06-07 11:15:52] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:52] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-07 11:15:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:15:52] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2025-06-07 11:15:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:53] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:53] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:53] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:53] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:53] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:53] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/133 variables, 70/88 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 0/133 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 88 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1914 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/133 variables, 70/88 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 62/150 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:54] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:55] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:55] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:55] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:55] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:55] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:55] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:55] [INFO ] Deduced a trap along path composed of 4 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:55] [INFO ] Deduced a trap along path composed of 5 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:55] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:57] [INFO ] Deduced a trap along path composed of 7 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:15:57] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/133 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 163 constraints, problems are : Problem set: 0 solved, 62 unsolved in 5922 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 7846ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 7846ms
Starting structural reductions in LTL mode, iteration 1 : 70/76 places, 63/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8051 ms. Remains : 70/76 places, 63/69 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND p0 (NOT p2)), (NOT p2), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-08
Entered a terminal (fully accepting) state of product in 4308 steps with 130 reset in 8 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-08 finished in 8412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1&&X(X(G(p0))))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 71 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 71 transition count 64
Applied a total of 10 rules in 1 ms. Remains 71 /76 variables (removed 5) and now considering 64/69 (removed 5) transitions.
// Phase 1: matrix 64 rows 71 cols
[2025-06-07 11:16:00] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:00] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-07 11:16:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:01] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2025-06-07 11:16:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:01] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:01] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:01] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:01] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:01] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:01] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/135 variables, 71/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/135 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 89 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/135 variables, 71/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 63/152 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:03] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:03] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:03] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:03] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:03] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:03] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:03] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:03] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:03] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:03] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:03] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:04] [INFO ] Deduced a trap along path composed of 6 places in 35 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:04] [INFO ] Deduced a trap along path composed of 7 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:04] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:05] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:05] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:05] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:07] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:10] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:10] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/135 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/135 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 15 (OVERLAPS) 0/135 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 172 constraints, problems are : Problem set: 0 solved, 63 unsolved in 11726 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 13435ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 13435ms
Starting structural reductions in LTL mode, iteration 1 : 71/76 places, 64/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13660 ms. Remains : 71/76 places, 64/69 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-10
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-10 finished in 13856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0)||X(G(p1))) U (p2&&(G(p0)||X(G(p1)))))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 70 transition count 63
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 70 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 69 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 69 transition count 62
Applied a total of 14 rules in 3 ms. Remains 69 /76 variables (removed 7) and now considering 62/69 (removed 7) transitions.
// Phase 1: matrix 62 rows 69 cols
[2025-06-07 11:16:14] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:14] [INFO ] Implicit Places using invariants in 325 ms returned []
[2025-06-07 11:16:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:15] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-07 11:16:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:15] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:15] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:15] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:15] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:15] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:15] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:15] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:15] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 62/131 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 89 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1903 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 62/131 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 61/150 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:17] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:17] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:17] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:17] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:17] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:17] [INFO ] Deduced a trap along path composed of 5 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:18] [INFO ] Deduced a trap along path composed of 5 places in 205 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:18] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/131 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:20] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:20] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:20] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:22] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/131 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/131 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 163 constraints, problems are : Problem set: 0 solved, 61 unsolved in 9615 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 11537ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 11537ms
Starting structural reductions in LTL mode, iteration 1 : 69/76 places, 62/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11942 ms. Remains : 69/76 places, 62/69 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-11 finished in 12134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 69/69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 75 transition count 50
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 57 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 56 transition count 48
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 39 place count 56 transition count 43
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 49 place count 51 transition count 43
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 53 place count 47 transition count 39
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 47 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 57 place count 47 transition count 38
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 59 place count 46 transition count 38
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 89 place count 31 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 29 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 29 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 28 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 27 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 96 place count 27 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 100 place count 25 transition count 20
Applied a total of 100 rules in 28 ms. Remains 25 /76 variables (removed 51) and now considering 20/69 (removed 49) transitions.
// Phase 1: matrix 20 rows 25 cols
[2025-06-07 11:16:26] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:26] [INFO ] Implicit Places using invariants in 70 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/76 places, 20/69 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 19
Applied a total of 2 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 22 cols
[2025-06-07 11:16:26] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-07 11:16:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/76 places, 19/69 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 22/76 places, 19/69 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-13
Stuttering criterion allowed to conclude after 15419 steps with 817 reset in 17 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-13 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0)&&F(p1)&&(X(p2) U ((!p1&&X(p2))||X(G(p2))))))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 70 transition count 63
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 70 transition count 63
Applied a total of 12 rules in 2 ms. Remains 70 /76 variables (removed 6) and now considering 63/69 (removed 6) transitions.
// Phase 1: matrix 63 rows 70 cols
[2025-06-07 11:16:27] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:27] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-07 11:16:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:27] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2025-06-07 11:16:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:27] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:27] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:27] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:27] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:27] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:27] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/133 variables, 70/88 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 0/133 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 88 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1658 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/133 variables, 70/88 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 62/150 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:29] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:29] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:29] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:29] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:29] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:29] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:29] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:29] [INFO ] Deduced a trap along path composed of 5 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:29] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:30] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:30] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:31] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:16:31] [INFO ] Deduced a trap along path composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/133 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 163 constraints, problems are : Problem set: 0 solved, 62 unsolved in 5845 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 7539ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 7542ms
Starting structural reductions in LTL mode, iteration 1 : 70/76 places, 63/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7738 ms. Remains : 70/76 places, 63/69 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (NOT p1) p0), (AND p0 p2), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-14 finished in 7936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 69/69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 75 transition count 49
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 56 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 55 transition count 47
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 41 place count 55 transition count 42
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 51 place count 50 transition count 42
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 55 place count 46 transition count 38
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 46 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 59 place count 46 transition count 37
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 45 transition count 37
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 91 place count 30 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 28 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 28 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 27 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 26 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 98 place count 26 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 102 place count 24 transition count 19
Applied a total of 102 rules in 7 ms. Remains 24 /76 variables (removed 52) and now considering 19/69 (removed 50) transitions.
// Phase 1: matrix 19 rows 24 cols
[2025-06-07 11:16:35] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:35] [INFO ] Implicit Places using invariants in 53 ms returned [5, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/76 places, 19/69 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 17
Applied a total of 4 rules in 1 ms. Remains 20 /22 variables (removed 2) and now considering 17/19 (removed 2) transitions.
// Phase 1: matrix 17 rows 20 cols
[2025-06-07 11:16:35] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:35] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-07 11:16:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:16:35] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/76 places, 17/69 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 20/76 places, 17/69 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-15
Product exploration explored 100000 steps with 46 reset in 88 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 64 in 0 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-15 finished in 312 ms.
All properties solved by simple procedures.
Total runtime 95274 ms.

BK_STOP 1749294995378

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-001B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-001B, 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 r198-tall-174894533400788"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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