About the Execution of ITS-Tools for ShieldPPPs-PT-004A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFFF?FF?FFFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533100652.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 ShieldPPPs-PT-004A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533100652
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 35K 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 ShieldPPPs-PT-004A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749201343081
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-004A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 09:15:44] [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-06 09:15:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 09:15:44] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2025-06-06 09:15:44] [INFO ] Transformed 127 places.
[2025-06-06 09:15:44] [INFO ] Transformed 107 transitions.
[2025-06-06 09:15:44] [INFO ] Found NUPN structural information;
[2025-06-06 09:15:44] [INFO ] Parsed PT model containing 127 places and 107 transitions and 406 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-004A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 29 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 127 cols
[2025-06-06 09:15:44] [INFO ] Computed 45 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:15:44] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-06-06 09:15:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:15:44] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 09:15:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:15:46] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:15:46] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:15:47] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:15:48] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:15:50] [INFO ] Deduced a trap along path composed of 9 places in 34 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:15:50] [INFO ] Deduced a trap along path composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/234 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 305 constraints, problems are : Problem set: 0 solved, 106 unsolved in 7022 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 106/409 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 411 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9663 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 16753ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 16770ms
Finished structural reductions in LTL mode , in 1 iterations and 17175 ms. Remains : 127/127 places, 107/107 transitions.
Support contains 56 out of 127 places after structural reductions.
[2025-06-06 09:16:02] [INFO ] Flatten gal took : 40 ms
[2025-06-06 09:16:02] [INFO ] Flatten gal took : 12 ms
[2025-06-06 09:16:02] [INFO ] Input system was already deterministic with 107 transitions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 13869 steps (43 resets) in 311 ms. (44 steps per ms) remains 0/34 properties
FORMULA ShieldPPPs-PT-004A-LTLFireability-03 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' '!((F((G(!p0)&&F(p1)&&X(F(!p2)))) U X(p3)))'
Support contains 8 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-06-06 09:16:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:16:03] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-06 09:16:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:16:03] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 09:16:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:04] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:05] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:05] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:06] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:08] [INFO ] Deduced a trap along path composed of 9 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:08] [INFO ] Deduced a trap along path composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/234 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 305 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6427 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 106/409 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 411 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8641 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15087ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 15088ms
Finished structural reductions in LTL mode , in 1 iterations and 15302 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 478 ms :[(NOT p3), (OR (AND p2 (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3)) (AND p0 (NOT p3))), (OR (NOT p1) p2 p0), p0, (NOT p1), p2]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-00
Stuttering criterion allowed to conclude after 4071 steps with 32 reset in 21 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-00 finished in 15869 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(X(G(X(!p0))))&&F(p1))) U p2))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-06-06 09:16:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:16:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-06 09:16:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:16:19] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 09:16: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/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:20] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:20] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:20] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:22] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:23] [INFO ] Deduced a trap along path composed of 9 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:23] [INFO ] Deduced a trap along path composed of 16 places in 28 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/234 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 305 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6548 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 106/409 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 411 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9247 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15812ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 15814ms
Finished structural reductions in LTL mode , in 1 iterations and 15998 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-01
Stuttering criterion allowed to conclude after 15764 steps with 165 reset in 56 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-01 finished in 16353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Reduce places removed 1 places and 1 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 125 transition count 105
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 124 transition count 104
Applied a total of 4 rules in 32 ms. Remains 124 /127 variables (removed 3) and now considering 104/107 (removed 3) transitions.
// Phase 1: matrix 104 rows 124 cols
[2025-06-06 09:16:35] [INFO ] Computed 45 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:16:35] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-06 09:16:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:16:35] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:16:35] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-06 09:16: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/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/293 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:36] [INFO ] Deduced a trap along path composed of 9 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/228 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 294 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3402 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/293 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 102/395 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:39] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:39] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:39] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:16:42] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 228/228 variables, and 400 constraints, problems are : Problem set: 0 solved, 102 unsolved in 30011 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33421ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 33422ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/127 places, 104/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33644 ms. Remains : 124/127 places, 104/107 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-02
Stuttering criterion allowed to conclude after 11587 steps with 105 reset in 35 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-02 finished in 33757 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(p1)))))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 127 cols
[2025-06-06 09:17:09] [INFO ] Computed 45 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:17:09] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-06 09:17:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:17:09] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 09:17:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:10] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:10] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:11] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:11] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:13] [INFO ] Deduced a trap along path composed of 9 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:13] [INFO ] Deduced a trap along path composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/234 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 305 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6214 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 106/409 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 411 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8599 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 14823ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 14824ms
Finished structural reductions in LTL mode , in 1 iterations and 15033 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-04 finished in 15153 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(((G(F(!p0))||(F(!p0)&&F(!p1))) U X(!p2))))'
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-06-06 09:17:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:17:24] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 09:17:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:17:24] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 09:17:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:25] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:26] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:26] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:27] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:29] [INFO ] Deduced a trap along path composed of 9 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:29] [INFO ] Deduced a trap along path composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/234 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 305 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6537 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 106/409 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 411 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8999 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15545ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 15546ms
Finished structural reductions in LTL mode , in 1 iterations and 15712 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 252 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-05
Product exploration explored 100000 steps with 34512 reset in 285 ms.
Product exploration explored 100000 steps with 34407 reset in 259 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 141 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 9787 steps (30 resets) in 71 ms. (135 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 14 factoid took 345 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 270 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-06-06 09:17:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:17:42] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 09:17:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:17:42] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 09:17:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:43] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:43] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:44] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:46] [INFO ] Deduced a trap along path composed of 9 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:17:47] [INFO ] Deduced a trap along path composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/234 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 305 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6519 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 106/409 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 411 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9108 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15642ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 15642ms
Finished structural reductions in LTL mode , in 1 iterations and 15809 ms. Remains : 127/127 places, 107/107 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 139 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 17268 steps (55 resets) in 89 ms. (191 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 14 factoid took 337 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 226 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 243 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Product exploration explored 100000 steps with 34421 reset in 148 ms.
Product exploration explored 100000 steps with 34404 reset in 161 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 257 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 107
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 14 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:18:00] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
// Phase 1: matrix 107 rows 127 cols
[2025-06-06 09:18:00] [INFO ] Computed 45 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
Problem TDEAD36 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/300 constraints. Problems are: Problem set: 1 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:02] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:02] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:02] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:02] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:02] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 5/305 constraints. Problems are: Problem set: 1 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:02] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:02] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:02] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 3/308 constraints. Problems are: Problem set: 1 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:03] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:03] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:03] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 3/311 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 311 constraints, problems are : Problem set: 1 solved, 105 unsolved in 5182 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 2/127 variables, 45/170 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 2/172 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 12/184 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/311 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 105/416 constraints. Problems are: Problem set: 1 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:06] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:06] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/418 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/418 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/418 constraints. Problems are: Problem set: 1 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 418 constraints, problems are : Problem set: 1 solved, 105 unsolved in 13391 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 105/106 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18585ms problems are : Problem set: 1 solved, 105 unsolved
Search for dead transitions found 1 dead transitions in 18585ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 127/127 places, 106/107 transitions.
Graph (complete) has 329 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 126 /127 variables (removed 1) and now considering 106/106 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 126/127 places, 106/107 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18625 ms. Remains : 126/127 places, 106/107 transitions.
Built C files in :
/tmp/ltsmin16084381445224719034
[2025-06-06 09:18:18] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16084381445224719034
Running compilation step : cd /tmp/ltsmin16084381445224719034;'/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 318 ms.
Running link step : cd /tmp/ltsmin16084381445224719034;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16084381445224719034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3070183655530521322.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 127 cols
[2025-06-06 09:18:33] [INFO ] Computed 45 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:18:33] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-06 09:18:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:18:34] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 09:18:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:35] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:35] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:35] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:36] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:38] [INFO ] Deduced a trap along path composed of 9 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:18:38] [INFO ] Deduced a trap along path composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/234 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 305 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6342 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 106/409 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 411 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9391 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15741ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 15741ms
Finished structural reductions in LTL mode , in 1 iterations and 15918 ms. Remains : 127/127 places, 107/107 transitions.
Built C files in :
/tmp/ltsmin15107777233396826278
[2025-06-06 09:18:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15107777233396826278
Running compilation step : cd /tmp/ltsmin15107777233396826278;'/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 190 ms.
Running link step : cd /tmp/ltsmin15107777233396826278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15107777233396826278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17988428713965891330.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 09:19:04] [INFO ] Flatten gal took : 9 ms
[2025-06-06 09:19:04] [INFO ] Flatten gal took : 8 ms
[2025-06-06 09:19:04] [INFO ] Time to serialize gal into /tmp/LTL18111938360308574640.gal : 3 ms
[2025-06-06 09:19:04] [INFO ] Time to serialize properties into /tmp/LTL15958706453599901796.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18111938360308574640.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4370840416662332693.hoa' '-atoms' '/tmp/LTL15958706453599901796.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15958706453599901796.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4370840416662332693.hoa
Detected timeout of ITS tools.
[2025-06-06 09:19:20] [INFO ] Flatten gal took : 8 ms
[2025-06-06 09:19:20] [INFO ] Flatten gal took : 8 ms
[2025-06-06 09:19:20] [INFO ] Time to serialize gal into /tmp/LTL5299119993598291906.gal : 2 ms
[2025-06-06 09:19:20] [INFO ] Time to serialize properties into /tmp/LTL3858586032015350029.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5299119993598291906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3858586032015350029.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(((G(F(!("((p101==1)&&(p121==1))"))))||((F(!("((p101==1)&&(p121==1))")))&&(F(!("((p109==1)&&(p126==1))")))))U(X(!("(((p101==1)&&(p...193
Formula 0 simplified : F((FG"((p101==1)&&(p121==1))" & (G"((p101==1)&&(p121==1))" | G"((p109==1)&&(p126==1))")) R X"(((p101==1)&&(p121==1))&&((p79==1)&&(p8...164
Detected timeout of ITS tools.
[2025-06-06 09:19:35] [INFO ] Flatten gal took : 11 ms
[2025-06-06 09:19:35] [INFO ] Applying decomposition
[2025-06-06 09:19:35] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9786245450483968531.txt' '-o' '/tmp/graph9786245450483968531.bin' '-w' '/tmp/graph9786245450483968531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9786245450483968531.bin' '-l' '-1' '-v' '-w' '/tmp/graph9786245450483968531.weights' '-q' '0' '-e' '0.001'
[2025-06-06 09:19:35] [INFO ] Decomposing Gal with order
[2025-06-06 09:19:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 09:19:35] [INFO ] Removed a total of 24 redundant transitions.
[2025-06-06 09:19:35] [INFO ] Flatten gal took : 38 ms
[2025-06-06 09:19:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 8 ms.
[2025-06-06 09:19:35] [INFO ] Time to serialize gal into /tmp/LTL10112940558935566986.gal : 3 ms
[2025-06-06 09:19:35] [INFO ] Time to serialize properties into /tmp/LTL2614038904303862527.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10112940558935566986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2614038904303862527.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(((G(F(!("((i10.i1.u36.p101==1)&&(i10.i1.u43.p121==1))"))))||((F(!("((i10.i1.u36.p101==1)&&(i10.i1.u43.p121==1))")))&&(F(!("((i10....298
Formula 0 simplified : F((FG"((i10.i1.u36.p101==1)&&(i10.i1.u43.p121==1))" & (G"((i10.i1.u36.p101==1)&&(i10.i1.u43.p121==1))" | G"((i10.i0.u39.p109==1)&&(i...269
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-004A-LTLFireability-05 finished in 146094 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(X(p0))) U ((X(X(X(p0)))&&p1)||X(X(X(G(p0)))))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-06-06 09:19:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:19:50] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-06 09:19:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:19:50] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 09:19:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:19:52] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:19:52] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:19:52] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:19:53] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:19:55] [INFO ] Deduced a trap along path composed of 9 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:19:55] [INFO ] Deduced a trap along path composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/234 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 305 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6264 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 106/409 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 411 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8847 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15119ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 15120ms
Finished structural reductions in LTL mode , in 1 iterations and 15369 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-06 finished in 15540 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 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Reduce places removed 1 places and 1 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 125 transition count 105
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 124 transition count 104
Applied a total of 4 rules in 9 ms. Remains 124 /127 variables (removed 3) and now considering 104/107 (removed 3) transitions.
// Phase 1: matrix 104 rows 124 cols
[2025-06-06 09:20:05] [INFO ] Computed 45 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:20:05] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-06 09:20:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:20:06] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:20:06] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-06 09:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/293 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:20:07] [INFO ] Deduced a trap along path composed of 9 places in 24 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/228 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 294 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3333 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/293 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 102/395 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:20:09] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:20:09] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:20:09] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:20:13] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 228/228 variables, and 400 constraints, problems are : Problem set: 0 solved, 102 unsolved in 30013 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33354ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 33354ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/127 places, 104/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33567 ms. Remains : 124/127 places, 104/107 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-07
Product exploration explored 100000 steps with 7938 reset in 171 ms.
Product exploration explored 100000 steps with 7896 reset in 191 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 43 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2025-06-06 09:20:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:20:40] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2025-06-06 09:20:40] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2025-06-06 09:20:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:20:40] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2025-06-06 09:20:40] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-06 09:20:40] [INFO ] Computed and/alt/rep : 102/193/102 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-06 09:20:40] [INFO ] Added : 102 causal constraints over 21 iterations in 509 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 104/104 transitions.
Applied a total of 0 rules in 9 ms. Remains 124 /124 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2025-06-06 09:20:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:20:41] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 09:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:20:41] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:20:41] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-06 09:20: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/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/293 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:20:42] [INFO ] Deduced a trap along path composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/228 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 294 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3360 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/293 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 102/395 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:20:44] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:20:45] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:20:45] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:20:48] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 228/228 variables, and 400 constraints, problems are : Problem set: 0 solved, 102 unsolved in 30011 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33382ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 33382ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33559 ms. Remains : 124/124 places, 104/104 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 64 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2025-06-06 09:21:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:21:14] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2025-06-06 09:21:15] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-06-06 09:21:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:21:15] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-06 09:21:15] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-06-06 09:21:15] [INFO ] Computed and/alt/rep : 102/193/102 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-06 09:21:15] [INFO ] Added : 102 causal constraints over 21 iterations in 518 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7848 reset in 147 ms.
Product exploration explored 100000 steps with 8025 reset in 160 ms.
Built C files in :
/tmp/ltsmin8070452257686664962
[2025-06-06 09:21:16] [INFO ] Computing symmetric may disable matrix : 104 transitions.
[2025-06-06 09:21:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:21:16] [INFO ] Computing symmetric may enable matrix : 104 transitions.
[2025-06-06 09:21:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:21:16] [INFO ] Computing Do-Not-Accords matrix : 104 transitions.
[2025-06-06 09:21:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:21:16] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8070452257686664962
Running compilation step : cd /tmp/ltsmin8070452257686664962;'/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 218 ms.
Running link step : cd /tmp/ltsmin8070452257686664962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8070452257686664962;'/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/stateBased9473508060932263106.hoa' '--buchi-type=spotba'
LTSmin run took 269 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-004A-LTLFireability-07 finished in 70719 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((G(F((!p1 U (p2||G(!p1)))))||(F((!p1 U (p2||G(!p1))))&&X(!p3)))))))'
Support contains 9 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 127 cols
[2025-06-06 09:21:16] [INFO ] Computed 45 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:21:16] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-06 09:21:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:21:16] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 09:21:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:21:18] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:21:18] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:21:18] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:21:19] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:21:21] [INFO ] Deduced a trap along path composed of 9 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:21:21] [INFO ] Deduced a trap along path composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/234 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 305 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6631 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 106/409 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 411 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9424 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 16069ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 16069ms
Finished structural reductions in LTL mode , in 1 iterations and 16260 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (AND (NOT p2) p1 p3)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-08
Product exploration explored 100000 steps with 7696 reset in 160 ms.
Product exploration explored 100000 steps with 7671 reset in 243 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 p0) p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 72 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 83 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 09:21:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:21:34] [INFO ] [Real]Absence check using 45 positive place invariants in 16 ms returned sat
[2025-06-06 09:21:34] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2025-06-06 09:21:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:21:34] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2025-06-06 09:21:34] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-06-06 09:21:34] [INFO ] Computed and/alt/rep : 106/291/106 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-06 09:21:35] [INFO ] Added : 90 causal constraints over 20 iterations in 779 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 127 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-06-06 09:21:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:21:35] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 09:21:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:21:35] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 09:21: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/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:21:36] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:21:37] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:21:37] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:21:38] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:21:40] [INFO ] Deduced a trap along path composed of 9 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:21:40] [INFO ] Deduced a trap along path composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/234 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 305 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6592 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 106/409 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 411 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9285 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15887ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 15887ms
Finished structural reductions in LTL mode , in 1 iterations and 16046 ms. Remains : 127/127 places, 107/107 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 35 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 09:21:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:21:51] [INFO ] [Real]Absence check using 45 positive place invariants in 16 ms returned sat
[2025-06-06 09:21:52] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2025-06-06 09:21:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:21:52] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2025-06-06 09:21:52] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-06-06 09:21:52] [INFO ] Computed and/alt/rep : 106/291/106 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-06 09:21:53] [INFO ] Added : 90 causal constraints over 20 iterations in 766 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4333 reset in 194 ms.
Product exploration explored 100000 steps with 4313 reset in 199 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 107
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 10 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:21:53] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
// Phase 1: matrix 107 rows 127 cols
[2025-06-06 09:21:53] [INFO ] Computed 45 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:21:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/300 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/234 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 300 constraints, problems are : Problem set: 1 solved, 105 unsolved in 3380 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 2/127 variables, 45/170 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 2/172 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/300 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 105/405 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 405 constraints, problems are : Problem set: 1 solved, 105 unsolved in 30009 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 105/106 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33398ms problems are : Problem set: 1 solved, 105 unsolved
Search for dead transitions found 1 dead transitions in 33399ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 127/127 places, 106/107 transitions.
Graph (complete) has 331 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 126 /127 variables (removed 1) and now considering 106/106 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 126/127 places, 106/107 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33426 ms. Remains : 126/127 places, 106/107 transitions.
Built C files in :
/tmp/ltsmin11984679346117926957
[2025-06-06 09:22:27] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11984679346117926957
Running compilation step : cd /tmp/ltsmin11984679346117926957;'/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 195 ms.
Running link step : cd /tmp/ltsmin11984679346117926957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11984679346117926957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1310965270389092819.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 127 cols
[2025-06-06 09:22:42] [INFO ] Computed 45 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:22:42] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-06 09:22:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:22:42] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 09:22:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:22:43] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:22:44] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:22:44] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:22:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:22:47] [INFO ] Deduced a trap along path composed of 9 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:22:47] [INFO ] Deduced a trap along path composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/234 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 305 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6717 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 106/409 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 411 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9412 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 16138ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 16138ms
Finished structural reductions in LTL mode , in 1 iterations and 16316 ms. Remains : 127/127 places, 107/107 transitions.
Built C files in :
/tmp/ltsmin2634529356837091567
[2025-06-06 09:22:58] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2634529356837091567
Running compilation step : cd /tmp/ltsmin2634529356837091567;'/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 198 ms.
Running link step : cd /tmp/ltsmin2634529356837091567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2634529356837091567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9221579908935115379.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 09:23:13] [INFO ] Flatten gal took : 6 ms
[2025-06-06 09:23:13] [INFO ] Flatten gal took : 5 ms
[2025-06-06 09:23:13] [INFO ] Time to serialize gal into /tmp/LTL17856328207276417328.gal : 1 ms
[2025-06-06 09:23:13] [INFO ] Time to serialize properties into /tmp/LTL889027827016726138.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17856328207276417328.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5455102912931822287.hoa' '-atoms' '/tmp/LTL889027827016726138.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL889027827016726138.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5455102912931822287.hoa
Detected timeout of ITS tools.
[2025-06-06 09:23:28] [INFO ] Flatten gal took : 6 ms
[2025-06-06 09:23:28] [INFO ] Flatten gal took : 5 ms
[2025-06-06 09:23:28] [INFO ] Time to serialize gal into /tmp/LTL12148559495622263819.gal : 1 ms
[2025-06-06 09:23:28] [INFO ] Time to serialize properties into /tmp/LTL14753736895853805940.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12148559495622263819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14753736895853805940.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("((p99==1)&&(p116==1))"))&&(F((G(F((!("((p7==1)&&(p9==1))"))U(("((!((p37==1)&&(p54==1)))&&(!((p7==1)&&(p9==1))))")||(G(!("((p7...354
Formula 0 simplified : X(G!"((p99==1)&&(p116==1))" | G(FG("((p7==1)&&(p9==1))" M !"((!((p37==1)&&(p54==1)))&&(!((p7==1)&&(p9==1))))") & (X!"(((p37==0)||(p5...268
Detected timeout of ITS tools.
[2025-06-06 09:23:43] [INFO ] Flatten gal took : 8 ms
[2025-06-06 09:23:43] [INFO ] Applying decomposition
[2025-06-06 09:23:43] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4000562056441332367.txt' '-o' '/tmp/graph4000562056441332367.bin' '-w' '/tmp/graph4000562056441332367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4000562056441332367.bin' '-l' '-1' '-v' '-w' '/tmp/graph4000562056441332367.weights' '-q' '0' '-e' '0.001'
[2025-06-06 09:23:43] [INFO ] Decomposing Gal with order
[2025-06-06 09:23:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 09:23:43] [INFO ] Removed a total of 24 redundant transitions.
[2025-06-06 09:23:43] [INFO ] Flatten gal took : 16 ms
[2025-06-06 09:23:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 19 ms.
[2025-06-06 09:23:43] [INFO ] Time to serialize gal into /tmp/LTL14490199155916010392.gal : 2 ms
[2025-06-06 09:23:43] [INFO ] Time to serialize properties into /tmp/LTL16516593082259566508.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14490199155916010392.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16516593082259566508.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((F("((i10.u35.p99==1)&&(i10.u41.p116==1))"))&&(F((G(F((!("((i1.u2.p7==1)&&(i2.u3.p9==1))"))U(("((!((i3.u13.p37==1)&&(i3.u19.p54==...501
Formula 0 simplified : X(G!"((i10.u35.p99==1)&&(i10.u41.p116==1))" | G(FG("((i1.u2.p7==1)&&(i2.u3.p9==1))" M !"((!((i3.u13.p37==1)&&(i3.u19.p54==1)))&&(!((...391
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-004A-LTLFireability-08 finished in 162411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(((F(p1) U p0)&&(F(p2) U p3))))))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-06-06 09:23:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:23:59] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 09:23:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:23:59] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 09:23:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:24:00] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:24:00] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:24:00] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:24:02] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:24:03] [INFO ] Deduced a trap along path composed of 9 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:24:04] [INFO ] Deduced a trap along path composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/234 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 305 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6577 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 106/409 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 411 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9463 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 16047ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 16048ms
Finished structural reductions in LTL mode , in 1 iterations and 16214 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (OR (NOT p0) (NOT p3)), (NOT p1), (NOT p0), (NOT p2), (NOT p3)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-10 finished in 16530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Reduce places removed 1 places and 1 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 125 transition count 105
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 124 transition count 104
Applied a total of 4 rules in 12 ms. Remains 124 /127 variables (removed 3) and now considering 104/107 (removed 3) transitions.
// Phase 1: matrix 104 rows 124 cols
[2025-06-06 09:24:15] [INFO ] Computed 45 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:24:15] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 09:24:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:24:15] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:24:15] [INFO ] Redundant transitions in 1 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-06 09:24:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/293 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:24:17] [INFO ] Deduced a trap along path composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/228 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 294 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3464 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 104/228 variables, 124/293 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 102/395 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:24:19] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:24:19] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:24:19] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:24:23] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 228/228 variables, and 400 constraints, problems are : Problem set: 0 solved, 102 unsolved in 30016 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33490ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 33491ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/127 places, 104/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33663 ms. Remains : 124/127 places, 104/107 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-11
Stuttering criterion allowed to conclude after 301 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-11 finished in 33712 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 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 105
Applied a total of 4 rules in 9 ms. Remains 125 /127 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 125 cols
[2025-06-06 09:24:49] [INFO ] Computed 45 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:24:49] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 09:24:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:24:49] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:24:49] [INFO ] Redundant transitions in 1 ms returned []
Running 104 sub problems to find dead transitions.
[2025-06-06 09:24:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 105/230 variables, 125/295 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:24:51] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/230 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 296 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4764 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 105/230 variables, 125/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 104/400 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:25:00] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 401 constraints, problems are : Problem set: 0 solved, 104 unsolved in 19936 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24705ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 24706ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/127 places, 105/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24890 ms. Remains : 125/127 places, 105/107 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-12
Product exploration explored 100000 steps with 11105 reset in 164 ms.
Product exploration explored 100000 steps with 11136 reset in 155 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 (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 38 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2025-06-06 09:25:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:25:14] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2025-06-06 09:25:14] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2025-06-06 09:25:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:25:15] [INFO ] [Nat]Absence check using 45 positive place invariants in 12 ms returned sat
[2025-06-06 09:25:15] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-06-06 09:25:15] [INFO ] Computed and/alt/rep : 104/295/104 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-06 09:25:15] [INFO ] Added : 100 causal constraints over 21 iterations in 494 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 105/105 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2025-06-06 09:25:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:25:15] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 09:25:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:25:15] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:25:15] [INFO ] Redundant transitions in 1 ms returned []
Running 104 sub problems to find dead transitions.
[2025-06-06 09:25:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 105/230 variables, 125/295 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:25:18] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/230 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 296 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4827 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 105/230 variables, 125/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 104/400 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:25:27] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 401 constraints, problems are : Problem set: 0 solved, 104 unsolved in 19961 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24794ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 24794ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24975 ms. Remains : 125/125 places, 105/105 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 34 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2025-06-06 09:25:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:25:40] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2025-06-06 09:25:41] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-06 09:25:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:25:41] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2025-06-06 09:25:41] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-06 09:25:41] [INFO ] Computed and/alt/rep : 104/295/104 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-06 09:25:41] [INFO ] Added : 100 causal constraints over 21 iterations in 498 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11187 reset in 149 ms.
Product exploration explored 100000 steps with 11167 reset in 154 ms.
Built C files in :
/tmp/ltsmin3305421962273267477
[2025-06-06 09:25:42] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2025-06-06 09:25:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:25:42] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2025-06-06 09:25:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:25:42] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2025-06-06 09:25:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:25:42] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3305421962273267477
Running compilation step : cd /tmp/ltsmin3305421962273267477;'/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 219 ms.
Running link step : cd /tmp/ltsmin3305421962273267477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin3305421962273267477;'/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/stateBased2560450612430272301.hoa' '--buchi-type=spotba'
LTSmin run took 232 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-004A-LTLFireability-12 finished in 53343 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((F((p0&&G(p1)))&&G(p2))))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 105
Applied a total of 4 rules in 8 ms. Remains 125 /127 variables (removed 2) and now considering 105/107 (removed 2) transitions.
[2025-06-06 09:25:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:25:42] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-06 09:25:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:25:42] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:25:42] [INFO ] Redundant transitions in 1 ms returned []
Running 104 sub problems to find dead transitions.
[2025-06-06 09:25:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 105/230 variables, 125/295 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:25:45] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/230 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 296 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4740 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 105/230 variables, 125/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 104/400 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:25:53] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 401 constraints, problems are : Problem set: 0 solved, 104 unsolved in 20083 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24844ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 24845ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/127 places, 105/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25078 ms. Remains : 125/127 places, 105/107 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-13
Product exploration explored 100000 steps with 341 reset in 279 ms.
Product exploration explored 100000 steps with 331 reset in 299 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 p2 p0 p1), (X p2), (X (AND p0 p1 p2)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (OR (NOT p0) (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), (X (X p2)), (X (X (AND p0 p1 p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 138 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 714 steps (1 resets) in 13 ms. (51 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (AND p0 p1 p2)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (OR (NOT p0) (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), (X (X p2)), (X (X (AND p0 p1 p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p2 p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) p1))))]
Knowledge based reduction with 15 factoid took 342 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Support contains 5 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 105/105 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2025-06-06 09:26:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:26:09] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-06 09:26:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:26:09] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:26:09] [INFO ] Redundant transitions in 1 ms returned []
Running 104 sub problems to find dead transitions.
[2025-06-06 09:26:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 105/230 variables, 125/295 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:26:12] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/230 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 296 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4868 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 105/230 variables, 125/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 104/400 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:26:20] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 401 constraints, problems are : Problem set: 0 solved, 104 unsolved in 20019 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24904ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 24904ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25094 ms. Remains : 125/125 places, 105/105 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p2 p1)), (X p0), (X (AND p0 p1)), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 139 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 599 steps (0 resets) in 10 ms. (54 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p2 p1)), (X p0), (X (AND p0 p1)), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p2 p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) p1))))]
Knowledge based reduction with 15 factoid took 405 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 337 reset in 224 ms.
Product exploration explored 100000 steps with 336 reset in 248 ms.
Built C files in :
/tmp/ltsmin1140041120354027653
[2025-06-06 09:26:36] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2025-06-06 09:26:36] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:26:36] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2025-06-06 09:26:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:26:36] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2025-06-06 09:26:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:26:36] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1140041120354027653
Running compilation step : cd /tmp/ltsmin1140041120354027653;'/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 209 ms.
Running link step : cd /tmp/ltsmin1140041120354027653;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1140041120354027653;'/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/stateBased14973430415557331622.hoa' '--buchi-type=spotba'
LTSmin run took 370 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-004A-LTLFireability-13 finished in 54148 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((p1||X(F(p2))))&&p0)))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 127 cols
[2025-06-06 09:26:36] [INFO ] Computed 45 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:26:36] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 09:26:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:26:36] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-06 09:26:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/234 variables, 127/299 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:26:38] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:26:38] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:26:38] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:26:39] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/234 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:26:41] [INFO ] Deduced a trap along path composed of 9 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:26:41] [INFO ] Deduced a trap along path composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/234 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 305 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6682 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/234 variables, 127/303 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 106/409 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 411 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9352 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 16042ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 16044ms
Finished structural reductions in LTL mode , in 1 iterations and 16208 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-14 finished in 16368 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(((p1||F(p2))&&p0))))'
Support contains 7 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 105
Applied a total of 4 rules in 8 ms. Remains 125 /127 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 125 cols
[2025-06-06 09:26:53] [INFO ] Computed 45 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:26:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 09:26:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:26:53] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:26:53] [INFO ] Redundant transitions in 0 ms returned []
Running 104 sub problems to find dead transitions.
[2025-06-06 09:26: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/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 105/230 variables, 125/295 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:26:55] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/230 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 296 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4632 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 105/230 variables, 125/296 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 104/400 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:27:04] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 401 constraints, problems are : Problem set: 0 solved, 104 unsolved in 19910 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24551ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 24551ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/127 places, 105/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24733 ms. Remains : 125/127 places, 105/107 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-15
Stuttering criterion allowed to conclude after 4691 steps with 38 reset in 13 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-15 finished in 24840 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(((G(F(!p0))||(F(!p0)&&F(!p1))) U X(!p2))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-004A-LTLFireability-05
Stuttering acceptance computed with spot in 281 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 127/127 places, 107/107 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 126 transition count 106
Applied a total of 2 rules in 5 ms. Remains 126 /127 variables (removed 1) and now considering 106/107 (removed 1) transitions.
// Phase 1: matrix 106 rows 126 cols
[2025-06-06 09:27:18] [INFO ] Computed 45 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:27:18] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 09:27:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:27:18] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-06-06 09:27:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 297 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3410 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 105/402 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:27:23] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:27:23] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 404 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13386 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16805ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 16805ms
Starting structural reductions in LI_LTL mode, iteration 1 : 126/127 places, 106/107 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 16971 ms. Remains : 126/127 places, 106/107 transitions.
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-05
Product exploration explored 100000 steps with 34375 reset in 160 ms.
Product exploration explored 100000 steps with 34454 reset in 176 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 151 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 16414 steps (53 resets) in 115 ms. (141 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 14 factoid took 368 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 260 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 106/106 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2025-06-06 09:27:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:27:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-06 09:27:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:27:37] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-06-06 09:27:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 297 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3423 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 105/402 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:27:42] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:27:42] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 404 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13243 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16681ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 16681ms
Finished structural reductions in LTL mode , in 1 iterations and 16873 ms. Remains : 126/126 places, 106/106 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 152 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 9970 steps (32 resets) in 56 ms. (174 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 14 factoid took 350 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 294 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 270 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Product exploration explored 100000 steps with 34432 reset in 155 ms.
Product exploration explored 100000 steps with 34474 reset in 171 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 304 ms :[p2, p2, (AND p1 p2 p0), (AND p0 p2), (AND p1 p0), (AND p1 p0), p0]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 106/106 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:27:56] [INFO ] Redundant transitions in 0 ms returned []
Running 105 sub problems to find dead transitions.
[2025-06-06 09:27:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 297 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3479 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 105/402 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:28:01] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:28:01] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 404 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13485 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16976ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 16977ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16989 ms. Remains : 126/126 places, 106/106 transitions.
Built C files in :
/tmp/ltsmin6607070650698011954
[2025-06-06 09:28:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6607070650698011954
Running compilation step : cd /tmp/ltsmin6607070650698011954;'/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 190 ms.
Running link step : cd /tmp/ltsmin6607070650698011954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6607070650698011954;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16243711781623865948.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 106/106 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2025-06-06 09:28:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:28:28] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-06 09:28:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:28:28] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-06-06 09:28: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/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 297 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3398 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 105/402 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:28:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:28:33] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 404 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13097 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16511ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 16511ms
Finished structural reductions in LTL mode , in 1 iterations and 16702 ms. Remains : 126/126 places, 106/106 transitions.
Built C files in :
/tmp/ltsmin3830202648965465008
[2025-06-06 09:28:45] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3830202648965465008
Running compilation step : cd /tmp/ltsmin3830202648965465008;'/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 199 ms.
Running link step : cd /tmp/ltsmin3830202648965465008;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3830202648965465008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16439073973241811123.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 09:29:00] [INFO ] Flatten gal took : 14 ms
[2025-06-06 09:29:00] [INFO ] Flatten gal took : 7 ms
[2025-06-06 09:29:00] [INFO ] Time to serialize gal into /tmp/LTL14232417711805940237.gal : 1 ms
[2025-06-06 09:29:00] [INFO ] Time to serialize properties into /tmp/LTL16876141843121216711.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14232417711805940237.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13611929558611315834.hoa' '-atoms' '/tmp/LTL16876141843121216711.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16876141843121216711.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13611929558611315834.hoa
Detected timeout of ITS tools.
[2025-06-06 09:29:15] [INFO ] Flatten gal took : 9 ms
[2025-06-06 09:29:15] [INFO ] Flatten gal took : 6 ms
[2025-06-06 09:29:15] [INFO ] Time to serialize gal into /tmp/LTL9668052484629102074.gal : 1 ms
[2025-06-06 09:29:15] [INFO ] Time to serialize properties into /tmp/LTL13534525591125850452.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9668052484629102074.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13534525591125850452.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((G(F(!("((p101==1)&&(p121==1))"))))||((F(!("((p101==1)&&(p121==1))")))&&(F(!("((p109==1)&&(p126==1))")))))U(X(!("(((p101==1)&&(p...193
Formula 0 simplified : F((FG"((p101==1)&&(p121==1))" & (G"((p101==1)&&(p121==1))" | G"((p109==1)&&(p126==1))")) R X"(((p101==1)&&(p121==1))&&((p79==1)&&(p8...164
Detected timeout of ITS tools.
[2025-06-06 09:29:30] [INFO ] Flatten gal took : 8 ms
[2025-06-06 09:29:30] [INFO ] Applying decomposition
[2025-06-06 09:29:30] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1204838087916094631.txt' '-o' '/tmp/graph1204838087916094631.bin' '-w' '/tmp/graph1204838087916094631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1204838087916094631.bin' '-l' '-1' '-v' '-w' '/tmp/graph1204838087916094631.weights' '-q' '0' '-e' '0.001'
[2025-06-06 09:29:30] [INFO ] Decomposing Gal with order
[2025-06-06 09:29:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 09:29:30] [INFO ] Removed a total of 24 redundant transitions.
[2025-06-06 09:29:30] [INFO ] Flatten gal took : 10 ms
[2025-06-06 09:29:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 4 ms.
[2025-06-06 09:29:30] [INFO ] Time to serialize gal into /tmp/LTL9984166145984577041.gal : 2 ms
[2025-06-06 09:29:30] [INFO ] Time to serialize properties into /tmp/LTL4321234521067829404.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9984166145984577041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4321234521067829404.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(((G(F(!("((i10.i0.u36.p101==1)&&(i10.i0.u43.p121==1))"))))||((F(!("((i10.i0.u36.p101==1)&&(i10.i0.u43.p121==1))")))&&(F(!("((i10....298
Formula 0 simplified : F((FG"((i10.i0.u36.p101==1)&&(i10.i0.u43.p121==1))" & (G"((i10.i0.u36.p101==1)&&(i10.i0.u43.p121==1))" | G"((i10.i1.u39.p109==1)&&(i...269
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-004A-LTLFireability-05 finished in 147617 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((G(F((!p1 U (p2||G(!p1)))))||(F((!p1 U (p2||G(!p1))))&&X(!p3)))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-004A-LTLFireability-08
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (AND (NOT p2) p1 p3)]
Support contains 9 out of 127 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 127/127 places, 107/107 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 126 transition count 106
Applied a total of 2 rules in 7 ms. Remains 126 /127 variables (removed 1) and now considering 106/107 (removed 1) transitions.
// Phase 1: matrix 106 rows 126 cols
[2025-06-06 09:29:45] [INFO ] Computed 45 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:29:45] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 09:29:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:29:46] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-06-06 09:29:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:29:47] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/232 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 298 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3781 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/232 variables, 126/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 105/403 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 403 constraints, problems are : Problem set: 0 solved, 105 unsolved in 10193 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13992ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 13992ms
Starting structural reductions in LI_LTL mode, iteration 1 : 126/127 places, 106/107 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14165 ms. Remains : 126/127 places, 106/107 transitions.
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-08
Product exploration explored 100000 steps with 8104 reset in 165 ms.
Product exploration explored 100000 steps with 8016 reset in 185 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 p0) p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 70 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 69 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1) (NOT p3)), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 09:30:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:30:00] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2025-06-06 09:30:01] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2025-06-06 09:30:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:30:01] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-06 09:30:01] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-06-06 09:30:01] [INFO ] Computed and/alt/rep : 105/293/105 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-06 09:30:01] [INFO ] Added : 86 causal constraints over 18 iterations in 579 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 126 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 106/106 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2025-06-06 09:30:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:30:01] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-06 09:30:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:30:02] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-06-06 09:30:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:30:03] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/232 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 298 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3807 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/232 variables, 126/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 105/403 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 403 constraints, problems are : Problem set: 0 solved, 105 unsolved in 10314 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14129ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 14130ms
Finished structural reductions in LTL mode , in 1 iterations and 14302 ms. Remains : 126/126 places, 106/106 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 52 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 09:30:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:30:16] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2025-06-06 09:30:16] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-06-06 09:30:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 09:30:17] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-06 09:30:17] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-06 09:30:17] [INFO ] Computed and/alt/rep : 105/293/105 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-06 09:30:17] [INFO ] Added : 86 causal constraints over 18 iterations in 595 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4565 reset in 178 ms.
Product exploration explored 100000 steps with 4586 reset in 178 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 09:30:18] [INFO ] Redundant transitions in 0 ms returned []
Running 105 sub problems to find dead transitions.
[2025-06-06 09:30:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:30:19] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/232 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 298 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3801 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/232 variables, 126/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 105/403 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 403 constraints, problems are : Problem set: 0 solved, 105 unsolved in 10319 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14130ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 14131ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14143 ms. Remains : 126/126 places, 106/106 transitions.
Built C files in :
/tmp/ltsmin11436089301933110829
[2025-06-06 09:30:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11436089301933110829
Running compilation step : cd /tmp/ltsmin11436089301933110829;'/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 199 ms.
Running link step : cd /tmp/ltsmin11436089301933110829;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11436089301933110829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4553768956049156036.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 106/106 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2025-06-06 09:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:30:47] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-06 09:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 09:30:47] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-06-06 09:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/297 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 09:30:49] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/232 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 298 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3751 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/232 variables, 126/298 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 105/403 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 403 constraints, problems are : Problem set: 0 solved, 105 unsolved in 10111 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13869ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 13869ms
Finished structural reductions in LTL mode , in 1 iterations and 14053 ms. Remains : 126/126 places, 106/106 transitions.
Built C files in :
/tmp/ltsmin7517854019953946655
[2025-06-06 09:31:01] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7517854019953946655
Running compilation step : cd /tmp/ltsmin7517854019953946655;'/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 203 ms.
Running link step : cd /tmp/ltsmin7517854019953946655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7517854019953946655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8148061596917354897.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 09:31:16] [INFO ] Flatten gal took : 9 ms
[2025-06-06 09:31:16] [INFO ] Flatten gal took : 5 ms
[2025-06-06 09:31:16] [INFO ] Time to serialize gal into /tmp/LTL12804022205266928561.gal : 1 ms
[2025-06-06 09:31:16] [INFO ] Time to serialize properties into /tmp/LTL15062081352880154435.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12804022205266928561.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3303879279214291091.hoa' '-atoms' '/tmp/LTL15062081352880154435.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15062081352880154435.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3303879279214291091.hoa
Detected timeout of ITS tools.
[2025-06-06 09:31:31] [INFO ] Flatten gal took : 5 ms
[2025-06-06 09:31:31] [INFO ] Flatten gal took : 4 ms
[2025-06-06 09:31:31] [INFO ] Time to serialize gal into /tmp/LTL3509710894205807553.gal : 1 ms
[2025-06-06 09:31:31] [INFO ] Time to serialize properties into /tmp/LTL331148240659766283.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3509710894205807553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL331148240659766283.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X((F("((p99==1)&&(p116==1))"))&&(F((G(F((!("((p7==1)&&(p9==1))"))U(("((!((p37==1)&&(p54==1)))&&(!((p7==1)&&(p9==1))))")||(G(!("((p7...354
Formula 0 simplified : X(G!"((p99==1)&&(p116==1))" | G(FG("((p7==1)&&(p9==1))" M !"((!((p37==1)&&(p54==1)))&&(!((p7==1)&&(p9==1))))") & (X!"(((p37==0)||(p5...268
Detected timeout of ITS tools.
[2025-06-06 09:31:46] [INFO ] Flatten gal took : 8 ms
[2025-06-06 09:31:46] [INFO ] Applying decomposition
[2025-06-06 09:31:46] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2509381487365686967.txt' '-o' '/tmp/graph2509381487365686967.bin' '-w' '/tmp/graph2509381487365686967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2509381487365686967.bin' '-l' '-1' '-v' '-w' '/tmp/graph2509381487365686967.weights' '-q' '0' '-e' '0.001'
[2025-06-06 09:31:46] [INFO ] Decomposing Gal with order
[2025-06-06 09:31:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 09:31:47] [INFO ] Removed a total of 24 redundant transitions.
[2025-06-06 09:31:47] [INFO ] Flatten gal took : 8 ms
[2025-06-06 09:31:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 1 ms.
[2025-06-06 09:31:47] [INFO ] Time to serialize gal into /tmp/LTL6202986644909273345.gal : 1 ms
[2025-06-06 09:31:47] [INFO ] Time to serialize properties into /tmp/LTL14782626693360589515.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6202986644909273345.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14782626693360589515.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F("((i10.u35.p99==1)&&(i10.u41.p116==1))"))&&(F((G(F((!("((i1.u2.p7==1)&&(i0.u3.p9==1))"))U(("((!((i4.u13.p37==1)&&(i4.u19.p54==...501
Formula 0 simplified : X(G!"((i10.u35.p99==1)&&(i10.u41.p116==1))" | G(FG("((i1.u2.p7==1)&&(i0.u3.p9==1))" M !"((!((i4.u13.p37==1)&&(i4.u19.p54==1)))&&(!((...391
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-004A-LTLFireability-08 finished in 136491 ms.
[2025-06-06 09:32:02] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6671668580421093558
[2025-06-06 09:32:02] [INFO ] Computing symmetric may disable matrix : 107 transitions.
[2025-06-06 09:32:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:32:02] [INFO ] Computing symmetric may enable matrix : 107 transitions.
[2025-06-06 09:32:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:32:02] [INFO ] Applying decomposition
[2025-06-06 09:32:02] [INFO ] Computing Do-Not-Accords matrix : 107 transitions.
[2025-06-06 09:32:02] [INFO ] Flatten gal took : 4 ms
[2025-06-06 09:32:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 09:32:02] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6671668580421093558
Running compilation step : cd /tmp/ltsmin6671668580421093558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1646663945511301944.txt' '-o' '/tmp/graph1646663945511301944.bin' '-w' '/tmp/graph1646663945511301944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1646663945511301944.bin' '-l' '-1' '-v' '-w' '/tmp/graph1646663945511301944.weights' '-q' '0' '-e' '0.001'
[2025-06-06 09:32:02] [INFO ] Decomposing Gal with order
[2025-06-06 09:32:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 09:32:02] [INFO ] Removed a total of 24 redundant transitions.
[2025-06-06 09:32:02] [INFO ] Flatten gal took : 7 ms
[2025-06-06 09:32:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2025-06-06 09:32:02] [INFO ] Time to serialize gal into /tmp/LTLFireability4677829784260555612.gal : 1 ms
[2025-06-06 09:32:02] [INFO ] Time to serialize properties into /tmp/LTLFireability3735272571551078625.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4677829784260555612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3735272571551078625.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(((G(F(!("((i11.u36.p101==1)&&(i11.u43.p121==1))"))))||((F(!("((i11.u36.p101==1)&&(i11.u43.p121==1))")))&&(F(!("((i10.i0.u39.p109=...280
Formula 0 simplified : F((FG"((i11.u36.p101==1)&&(i11.u43.p121==1))" & (G"((i11.u36.p101==1)&&(i11.u43.p121==1))" | G"((i10.i0.u39.p109==1)&&(i10.i0.u44.p1...251
Compilation finished in 242 ms.
Running link step : cd /tmp/ltsmin6671668580421093558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6671668580421093558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&<>(!(LTLAPp1==true)))) U X(!(LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t9, t10, t11, t18, t19, t20, t27, t28, t29, i0.t97, i0.t96, i0.u8.t3, i0.u8.t4, i...758
Computing Next relation with stutter on 366786 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: LTL layer: formula: []((([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&<>(!(LTLAPp1==true)))) U X(!(LTLAPp2==true))))
pins2lts-mc-linux64( 3/ 8), 0.003: "[]((([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&<>(!(LTLAPp1==true)))) U X(!(LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.075: DFS-FIFO for weak LTL, using special progress label 115
pins2lts-mc-linux64( 0/ 8), 0.075: There are 116 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.075: State length is 128, there are 121 groups
pins2lts-mc-linux64( 0/ 8), 0.075: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.075: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.075: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.075: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.084: ~2 levels ~960 states ~2024 transitions
pins2lts-mc-linux64( 1/ 8), 0.098: ~2 levels ~1920 states ~4528 transitions
pins2lts-mc-linux64( 1/ 8), 0.116: ~2 levels ~3840 states ~10016 transitions
pins2lts-mc-linux64( 1/ 8), 0.155: ~2 levels ~7680 states ~22376 transitions
pins2lts-mc-linux64( 1/ 8), 0.229: ~2 levels ~15360 states ~52816 transitions
pins2lts-mc-linux64( 1/ 8), 0.410: ~2 levels ~30720 states ~111184 transitions
pins2lts-mc-linux64( 7/ 8), 0.752: ~2 levels ~61440 states ~258464 transitions
pins2lts-mc-linux64( 7/ 8), 1.215: ~2 levels ~122880 states ~511032 transitions
pins2lts-mc-linux64( 0/ 8), 1.936: ~2 levels ~245760 states ~1076072 transitions
pins2lts-mc-linux64( 2/ 8), 3.000: ~2 levels ~491520 states ~2341896 transitions
pins2lts-mc-linux64( 6/ 8), 4.452: ~208 levels ~983040 states ~3792152 transitions
pins2lts-mc-linux64( 6/ 8), 6.892: ~208 levels ~1966080 states ~7667096 transitions
pins2lts-mc-linux64( 7/ 8), 11.767: ~167 levels ~3932160 states ~16201416 transitions
pins2lts-mc-linux64( 7/ 8), 22.507: ~167 levels ~7864320 states ~33471080 transitions
pins2lts-mc-linux64( 7/ 8), 44.492: ~167 levels ~15728640 states ~68593304 transitions
pins2lts-mc-linux64( 6/ 8), 88.665: ~214 levels ~31457280 states ~137917848 transitions
pins2lts-mc-linux64( 6/ 8), 181.268: ~214 levels ~62914560 states ~284766984 transitions
pins2lts-mc-linux64( 1/ 8), 213.489: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 213.592:
pins2lts-mc-linux64( 0/ 8), 213.592: mean standard work distribution: 1.9% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 213.593:
pins2lts-mc-linux64( 0/ 8), 213.593: Explored 67830085 states 315573613 transitions, fanout: 4.652
pins2lts-mc-linux64( 0/ 8), 213.593: Total exploration time 213.510 sec (213.410 sec minimum, 213.446 sec on average)
pins2lts-mc-linux64( 0/ 8), 213.593: States per second: 317690, Transitions per second: 1478027
pins2lts-mc-linux64( 0/ 8), 213.593:
pins2lts-mc-linux64( 0/ 8), 213.593: Progress states detected: 67369322
pins2lts-mc-linux64( 0/ 8), 213.593: Redundant explorations: -49.4625
pins2lts-mc-linux64( 0/ 8), 213.593:
pins2lts-mc-linux64( 0/ 8), 213.593: Queue width: 8B, total height: 67001271, memory: 511.18MB
pins2lts-mc-linux64( 0/ 8), 213.593: Tree memory: 1079.0MB, 8.4 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 213.593: Tree fill ratio (roots/leafs): 99.0%/21.0%
pins2lts-mc-linux64( 0/ 8), 213.593: Stored 108 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 213.593: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 213.593: Est. total memory use: 1590.2MB (~1535.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6671668580421093558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&<>(!(LTLAPp1==true)))) U X(!(LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6671668580421093558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&<>(!(LTLAPp1==true)))) U X(!(LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-06 09:57:27] [INFO ] Applying decomposition
[2025-06-06 09:57:27] [INFO ] Flatten gal took : 4 ms
[2025-06-06 09:57:27] [INFO ] Decomposing Gal with order
[2025-06-06 09:57:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 09:57:27] [INFO ] Removed a total of 36 redundant transitions.
[2025-06-06 09:57:27] [INFO ] Flatten gal took : 8 ms
[2025-06-06 09:57:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2025-06-06 09:57:27] [INFO ] Time to serialize gal into /tmp/LTLFireability14340592099379735835.gal : 2 ms
[2025-06-06 09:57:27] [INFO ] Time to serialize properties into /tmp/LTLFireability1792923994884345792.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14340592099379735835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1792923994884345792.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(((G(F(!("((i26.u47.p101==1)&&(u56.p121==1))"))))||((F(!("((i26.u47.p101==1)&&(u56.p121==1))")))&&(F(!("((i28.u52.p109==1)&&(u57.p...257
Formula 0 simplified : F((FG"((i26.u47.p101==1)&&(u56.p121==1))" & (G"((i26.u47.p101==1)&&(u56.p121==1))" | G"((i28.u52.p109==1)&&(u57.p126==1))")) R X"(((...228
Reverse transition relation is NOT exact ! Due to transitions t47, t49, t53, t54, t58, t60, t63, t65, t66, t67, t75, t76, t77, t79, t83, t84, t88, t89, t94...602
Computing Next relation with stutter on 366786 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
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="ShieldPPPs-PT-004A"
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 ShieldPPPs-PT-004A, 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-174894533100652"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-004A.tgz
mv ShieldPPPs-PT-004A 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 ;