About the Execution of ITS-Tools for ShieldIIPt-PT-020A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 615435.00 | 0.00 | 0.00 | FFTFTFFFFTFFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532900524.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 ShieldIIPt-PT-020A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532900524
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 105K May 29 14:32 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 ShieldIIPt-PT-020A-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-020A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749135466006
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 14:57:47] [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-05 14:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 14:57:47] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2025-06-05 14:57:47] [INFO ] Transformed 383 places.
[2025-06-05 14:57:47] [INFO ] Transformed 283 transitions.
[2025-06-05 14:57:47] [INFO ] Found NUPN structural information;
[2025-06-05 14:57:47] [INFO ] Parsed PT model containing 383 places and 283 transitions and 1206 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-020A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 35 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 383 cols
[2025-06-05 14:57:47] [INFO ] Computed 181 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:57:47] [INFO ] Implicit Places using invariants in 429 ms returned []
[2025-06-05 14:57:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:57:48] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-05 14:57:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 947 constraints, problems are : Problem set: 0 solved, 281 unsolved in 20995 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 281/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 1228 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30022 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51117ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 51127ms
Finished structural reductions in LTL mode , in 1 iterations and 51988 ms. Remains : 383/383 places, 282/282 transitions.
Support contains 55 out of 383 places after structural reductions.
[2025-06-05 14:58:39] [INFO ] Flatten gal took : 64 ms
[2025-06-05 14:58:39] [INFO ] Flatten gal took : 29 ms
[2025-06-05 14:58:39] [INFO ] Input system was already deterministic with 282 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (8 resets) in 1198 ms. (33 steps per ms) remains 12/31 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 229 ms. (173 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
[2025-06-05 14:58:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 27/51 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 27/74 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 332/383 variables, 158/232 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 332/564 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 947 constraints, problems are : Problem set: 0 solved, 11 unsolved in 638 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 27/51 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 27/74 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 332/383 variables, 158/232 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 332/564 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 11/958 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/665 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/665 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 958 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1558 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2204ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 5657 ms.
Support contains 24 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 282/282 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 383 transition count 281
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 382 transition count 281
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 4 place count 381 transition count 280
Partial Free-agglomeration rule applied 35 times.
Drop transitions (Partial Free agglomeration) removed 35 transitions
Iterating global reduction 0 with 35 rules applied. Total rules applied 39 place count 381 transition count 280
Applied a total of 39 rules in 66 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 381/383 places, 280/282 transitions.
RANDOM walk for 40000 steps (8 resets) in 1252 ms. (31 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
// Phase 1: matrix 280 rows 381 cols
[2025-06-05 14:58:49] [INFO ] Computed 181 invariants in 5 ms
[2025-06-05 14:58:49] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/10 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 371/381 variables, 177/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 371/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 280/661 variables, 381/943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 20/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/661 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 963 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Domain max(s): 381/381 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 381/381 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/10 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 371/381 variables, 177/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 371/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 280/661 variables, 381/943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 20/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 1/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/661 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 964 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Domain max(s): 381/381 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 381/381 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 452 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=75 )
Parikh walk visited 1 properties in 13 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 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' '!(G(F(p0)))'
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 383 transition count 281
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 382 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 381 transition count 280
Applied a total of 4 rules in 31 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 381 cols
[2025-06-05 14:58:50] [INFO ] Computed 181 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:58:50] [INFO ] Implicit Places using invariants in 183 ms returned [373, 374]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 185 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/383 places, 280/282 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 379 transition count 279
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 378 transition count 279
Applied a total of 2 rules in 14 ms. Remains 378 /379 variables (removed 1) and now considering 279/280 (removed 1) transitions.
// Phase 1: matrix 279 rows 378 cols
[2025-06-05 14:58:50] [INFO ] Computed 179 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:58:50] [INFO ] Implicit Places using invariants in 176 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 178 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/383 places, 279/282 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 376 transition count 278
Applied a total of 2 rules in 21 ms. Remains 376 /377 variables (removed 1) and now considering 278/279 (removed 1) transitions.
// Phase 1: matrix 278 rows 376 cols
[2025-06-05 14:58:50] [INFO ] Computed 178 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:58:50] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-05 14:58:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:58:51] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 376/383 places, 278/282 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 893 ms. Remains : 376/383 places, 278/282 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 464 ms.
Product exploration explored 100000 steps with 0 reset in 552 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3685 steps, run visited all 1 properties in 33 ms. (steps per millisecond=111 )
Probabilistic random walk after 3685 steps, saw 3510 distinct states, run finished after 37 ms. (steps per millisecond=99 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 278/278 transitions.
Applied a total of 0 rules in 14 ms. Remains 376 /376 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2025-06-05 14:58:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:58:53] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-05 14:58:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:58:53] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 14:58:53] [INFO ] Redundant transitions in 11 ms returned []
Running 277 sub problems to find dead transitions.
[2025-06-05 14:58:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 375/375 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/375 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (OVERLAPS) 1/376 variables, 178/553 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 278/654 variables, 376/930 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 0/654 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 930 constraints, problems are : Problem set: 0 solved, 277 unsolved in 20674 ms.
Refiners :[Domain max(s): 376/376 constraints, Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 375/375 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/375 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (OVERLAPS) 1/376 variables, 178/553 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 278/654 variables, 376/930 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 277/1207 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 0/654 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 1207 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30017 ms.
Refiners :[Domain max(s): 376/376 constraints, Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50729ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 50730ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51214 ms. Remains : 376/376 places, 278/278 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3685 steps, run visited all 1 properties in 26 ms. (steps per millisecond=141 )
Probabilistic random walk after 3685 steps, saw 3510 distinct states, run finished after 26 ms. (steps per millisecond=141 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 389 ms.
Product exploration explored 100000 steps with 0 reset in 503 ms.
Built C files in :
/tmp/ltsmin14695463450322243576
[2025-06-05 14:59:45] [INFO ] Computing symmetric may disable matrix : 278 transitions.
[2025-06-05 14:59:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 14:59:45] [INFO ] Computing symmetric may enable matrix : 278 transitions.
[2025-06-05 14:59:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 14:59:45] [INFO ] Computing Do-Not-Accords matrix : 278 transitions.
[2025-06-05 14:59:45] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 14:59:45] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14695463450322243576
Running compilation step : cd /tmp/ltsmin14695463450322243576;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 674 ms.
Running link step : cd /tmp/ltsmin14695463450322243576;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin14695463450322243576;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13936734447279289462.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 278/278 transitions.
Applied a total of 0 rules in 17 ms. Remains 376 /376 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2025-06-05 15:00:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:00:01] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-05 15:00:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:00:01] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:00:01] [INFO ] Redundant transitions in 3 ms returned []
Running 277 sub problems to find dead transitions.
[2025-06-05 15:00: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/375 variables, 375/375 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/375 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (OVERLAPS) 1/376 variables, 178/553 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 278/654 variables, 376/930 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 0/654 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 930 constraints, problems are : Problem set: 0 solved, 277 unsolved in 20664 ms.
Refiners :[Domain max(s): 376/376 constraints, Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 375/375 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/375 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (OVERLAPS) 1/376 variables, 178/553 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 278/654 variables, 376/930 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 277/1207 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 0/654 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 1207 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30016 ms.
Refiners :[Domain max(s): 376/376 constraints, Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50715ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 50716ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51225 ms. Remains : 376/376 places, 278/278 transitions.
Built C files in :
/tmp/ltsmin3668513055889832439
[2025-06-05 15:00:52] [INFO ] Computing symmetric may disable matrix : 278 transitions.
[2025-06-05 15:00:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:00:52] [INFO ] Computing symmetric may enable matrix : 278 transitions.
[2025-06-05 15:00:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:00:52] [INFO ] Computing Do-Not-Accords matrix : 278 transitions.
[2025-06-05 15:00:52] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:00:52] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3668513055889832439
Running compilation step : cd /tmp/ltsmin3668513055889832439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 568 ms.
Running link step : cd /tmp/ltsmin3668513055889832439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3668513055889832439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3126096264053222499.hoa' '--buchi-type=spotba'
LTSmin run took 10414 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-020A-LTLFireability-03 finished in 132964 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(p0))'
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 383 transition count 281
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 382 transition count 281
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 4 place count 381 transition count 280
Applied a total of 4 rules in 21 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 381 cols
[2025-06-05 15:01:03] [INFO ] Computed 181 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:01:03] [INFO ] Implicit Places using invariants in 184 ms returned [373, 374]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 184 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/383 places, 280/282 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 379 transition count 279
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 378 transition count 279
Applied a total of 2 rules in 10 ms. Remains 378 /379 variables (removed 1) and now considering 279/280 (removed 1) transitions.
// Phase 1: matrix 279 rows 378 cols
[2025-06-05 15:01:03] [INFO ] Computed 179 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:01:03] [INFO ] Implicit Places using invariants in 174 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 175 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/383 places, 279/282 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 376 transition count 278
Applied a total of 2 rules in 10 ms. Remains 376 /377 variables (removed 1) and now considering 278/279 (removed 1) transitions.
// Phase 1: matrix 278 rows 376 cols
[2025-06-05 15:01:03] [INFO ] Computed 178 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:01:03] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-05 15:01:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:01:04] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 376/383 places, 278/282 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 855 ms. Remains : 376/383 places, 278/282 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 545 ms.
Product exploration explored 100000 steps with 33333 reset in 552 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-020A-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020A-LTLFireability-04 finished in 2017 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' '!(((p0 U X(p1)) U (p2||X(X(F(p3))))))'
Support contains 7 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 5 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 383 cols
[2025-06-05 15:01:05] [INFO ] Computed 181 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:01:05] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-05 15:01:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:01:05] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-05 15:01:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 947 constraints, problems are : Problem set: 0 solved, 281 unsolved in 20128 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 281/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 1228 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30023 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50188ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 50188ms
Finished structural reductions in LTL mode , in 1 iterations and 50653 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 377 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-05 finished in 51428 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(F(p0))&&F(p1)))'
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-06-05 15:01:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:01:56] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-05 15:01:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:01:57] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-05 15:01:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 947 constraints, problems are : Problem set: 0 solved, 281 unsolved in 20194 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 281/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 1228 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30011 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50238ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 50239ms
Finished structural reductions in LTL mode , in 1 iterations and 50711 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-06
Product exploration explored 100000 steps with 2 reset in 374 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 57 in 1 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-06 finished in 51220 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(X(X(F(p1))))))))'
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 4 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-06-05 15:02:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:02:48] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-05 15:02:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:02:48] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-05 15:02:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 947 constraints, problems are : Problem set: 0 solved, 281 unsolved in 20431 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 281/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 1228 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30017 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50487ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 50488ms
Finished structural reductions in LTL mode , in 1 iterations and 50988 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 385 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 1 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-07 finished in 51605 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 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 383 transition count 281
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 382 transition count 281
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 4 place count 381 transition count 280
Applied a total of 4 rules in 12 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 381 cols
[2025-06-05 15:03:39] [INFO ] Computed 181 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:03:39] [INFO ] Implicit Places using invariants in 177 ms returned [373, 374]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 178 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/383 places, 280/282 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 379 transition count 279
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 378 transition count 279
Applied a total of 2 rules in 10 ms. Remains 378 /379 variables (removed 1) and now considering 279/280 (removed 1) transitions.
// Phase 1: matrix 279 rows 378 cols
[2025-06-05 15:03:39] [INFO ] Computed 179 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:03:39] [INFO ] Implicit Places using invariants in 174 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/383 places, 279/282 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 376 transition count 278
Applied a total of 2 rules in 9 ms. Remains 376 /377 variables (removed 1) and now considering 278/279 (removed 1) transitions.
// Phase 1: matrix 278 rows 376 cols
[2025-06-05 15:03:39] [INFO ] Computed 178 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:03:39] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-05 15:03:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:03:40] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 376/383 places, 278/282 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 837 ms. Remains : 376/383 places, 278/282 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 387 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-08 finished in 1280 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)) U (p1 U p2))||F((G(F(!p2))||(F(!p2)&&X(!p0))))))'
Support contains 5 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 383 cols
[2025-06-05 15:03:40] [INFO ] Computed 181 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:03:40] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-05 15:03:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:03:41] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-05 15:03:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 947 constraints, problems are : Problem set: 0 solved, 281 unsolved in 20190 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 281/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 1228 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30014 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50237ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 50240ms
Finished structural reductions in LTL mode , in 1 iterations and 50713 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 144 ms :[false, false, false, (AND p2 (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 626 ms.
Product exploration explored 100000 steps with 50000 reset in 663 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 18 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-020A-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020A-LTLFireability-09 finished in 52194 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(F(p1))||(F(p1)&&X(!p2))))&&F(G(p3)))))'
Support contains 3 out of 383 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 383 transition count 281
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 382 transition count 281
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 4 place count 381 transition count 280
Applied a total of 4 rules in 16 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 381 cols
[2025-06-05 15:04:32] [INFO ] Computed 181 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:33] [INFO ] Implicit Places using invariants in 184 ms returned [373, 374]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 184 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/383 places, 280/282 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 379 transition count 279
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 378 transition count 279
Applied a total of 2 rules in 7 ms. Remains 378 /379 variables (removed 1) and now considering 279/280 (removed 1) transitions.
// Phase 1: matrix 279 rows 378 cols
[2025-06-05 15:04:33] [INFO ] Computed 179 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:33] [INFO ] Implicit Places using invariants in 181 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 182 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/383 places, 279/282 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 376 transition count 278
Applied a total of 2 rules in 7 ms. Remains 376 /377 variables (removed 1) and now considering 278/279 (removed 1) transitions.
// Phase 1: matrix 278 rows 376 cols
[2025-06-05 15:04:33] [INFO ] Computed 178 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:33] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-05 15:04:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:33] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 376/383 places, 278/282 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 870 ms. Remains : 376/383 places, 278/282 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (NOT p0), (NOT p3), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 386 ms.
Stack based approach found an accepted trace after 303 steps with 0 reset with depth 304 and stack size 280 in 2 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-10 finished in 1425 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' '!((p0 U G(!p0)))'
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 383 transition count 281
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 382 transition count 281
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 4 place count 381 transition count 280
Applied a total of 4 rules in 15 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 381 cols
[2025-06-05 15:04:34] [INFO ] Computed 181 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:34] [INFO ] Implicit Places using invariants in 185 ms returned [373, 374]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 186 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/383 places, 280/282 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 379 transition count 279
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 378 transition count 279
Applied a total of 2 rules in 7 ms. Remains 378 /379 variables (removed 1) and now considering 279/280 (removed 1) transitions.
// Phase 1: matrix 279 rows 378 cols
[2025-06-05 15:04:34] [INFO ] Computed 179 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:34] [INFO ] Implicit Places using invariants in 174 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 175 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/383 places, 279/282 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 376 transition count 278
Applied a total of 2 rules in 10 ms. Remains 376 /377 variables (removed 1) and now considering 278/279 (removed 1) transitions.
// Phase 1: matrix 278 rows 376 cols
[2025-06-05 15:04:34] [INFO ] Computed 178 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:34] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-05 15:04:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:35] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 376/383 places, 278/282 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 852 ms. Remains : 376/383 places, 278/282 transitions.
Stuttering acceptance computed with spot in 72 ms :[p0, true, p0]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-11
Entered a terminal (fully accepting) state of product in 9106 steps with 0 reset in 45 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-11 finished in 991 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((p0 U (F(p1) U p2)))||X(p3)))'
Support contains 6 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 4 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 383 cols
[2025-06-05 15:04:35] [INFO ] Computed 181 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:35] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-05 15:04:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:35] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-05 15:04:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 947 constraints, problems are : Problem set: 0 solved, 281 unsolved in 20301 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 281/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 1228 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30022 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50356ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 50357ms
Finished structural reductions in LTL mode , in 1 iterations and 50845 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p2) (NOT p3)), (AND p2 (NOT p1) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 651 ms.
Product exploration explored 100000 steps with 50000 reset in 680 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (NOT p2)), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X p3), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 17 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-020A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020A-LTLFireability-12 finished in 52584 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(X(((F(p1) U p2)&&p0)))||(G(p1)&&G(p2))))'
Support contains 6 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 5 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-06-05 15:05:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:28] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-05 15:05:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:28] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-05 15:05:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 947 constraints, problems are : Problem set: 0 solved, 281 unsolved in 20050 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 281/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 1228 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30018 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50100ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 50101ms
Finished structural reductions in LTL mode , in 1 iterations and 50578 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-13
Product exploration explored 100000 steps with 46 reset in 399 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 1 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-13 finished in 51243 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(F(p0))||(F(p0)&&X(F((!p1 U (p2||G(!p1)))))))))'
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-06-05 15:06:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:06:19] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-05 15:06:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:06:19] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-05 15:06:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 947 constraints, problems are : Problem set: 0 solved, 281 unsolved in 20107 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 281/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 1228 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30019 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50160ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 50161ms
Finished structural reductions in LTL mode , in 1 iterations and 50637 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-14
Product exploration explored 100000 steps with 286 reset in 386 ms.
Stack based approach found an accepted trace after 17 steps with 4 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-14 finished in 51268 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(p0))))'
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-06-05 15:07:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:07:10] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-05 15:07:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:07:10] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-05 15:07:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 947 constraints, problems are : Problem set: 0 solved, 281 unsolved in 20328 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/383 variables, 181/563 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/665 variables, 383/947 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 281/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 0/665 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 1228 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30018 ms.
Refiners :[Domain max(s): 383/383 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50378ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 50379ms
Finished structural reductions in LTL mode , in 1 iterations and 50845 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020A-LTLFireability-15 finished in 50994 ms.
All properties solved by simple procedures.
Total runtime 614288 ms.
BK_STOP 1749136081441
--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="ShieldIIPt-PT-020A"
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 ShieldIIPt-PT-020A, 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-174894532900524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020A.tgz
mv ShieldIIPt-PT-020A 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 '
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 ;