About the Execution of ITS-Tools for TCPcondis-PT-25
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 52280.00 | 0.00 | 0.00 | TFFFFFFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915589400211.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 TCPcondis-PT-25, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915589400211
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rwxr-xr-x 1 mcc users 24K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-00
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-01
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-02
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-03
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-04
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-05
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-06
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-07
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-08
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-09
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-10
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-11
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-12
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-13
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-14
FORMULA_NAME TCPcondis-PT-25-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749194007326
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-25
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 07:13:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 07:13:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 07:13:28] [WARNING] Skipping unknown tool specific annotation: Tina
[2025-06-06 07:13:28] [WARNING] Unknown XML tag in source file: size
[2025-06-06 07:13:28] [WARNING] Unknown XML tag in source file: color
[2025-06-06 07:13:28] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2025-06-06 07:13:28] [INFO ] Transformed 30 places.
[2025-06-06 07:13:28] [INFO ] Transformed 32 transitions.
[2025-06-06 07:13:28] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Support contains 27 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 07:13:29] [INFO ] Computed 9 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:29] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-06 07:13:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:29] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:13:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1314ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1324ms
Finished structural reductions in LTL mode , in 1 iterations and 1644 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 27 out of 30 places after structural reductions.
[2025-06-06 07:13:30] [INFO ] Flatten gal took : 18 ms
[2025-06-06 07:13:30] [INFO ] Flatten gal took : 6 ms
[2025-06-06 07:13:30] [INFO ] Input system was already deterministic with 32 transitions.
RANDOM walk for 35359 steps (7 resets) in 261 ms. (134 steps per ms) remains 0/35 properties
FORMULA TCPcondis-PT-25-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||(!p0&&X(X(p1))))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 07:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:31] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-06 07:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:31] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1123ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1123ms
Finished structural reductions in LTL mode , in 1 iterations and 1227 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 418 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-00
Product exploration explored 100000 steps with 16666 reset in 213 ms.
Product exploration explored 100000 steps with 16666 reset in 162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 2267 steps (0 resets) in 10 ms. (206 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 07:13:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:34] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 07:13:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:34] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:13: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/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1013ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1014ms
Finished structural reductions in LTL mode , in 1 iterations and 1099 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1148 steps (0 resets) in 6 ms. (164 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 16666 reset in 107 ms.
Product exploration explored 100000 steps with 16666 reset in 189 ms.
Applying partial POR strategy [true, false, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 30 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 30 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 5 rules in 20 ms. Remains 30 /30 variables (removed 0) and now considering 31/32 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:13:37] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
// Phase 1: matrix 31 rows 30 cols
[2025-06-06 07:13:37] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
At refinement iteration 5 (OVERLAPS) 31/61 variables, 30/39 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/39 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/39 constraints. Problems are: Problem set: 4 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 39 constraints, problems are : Problem set: 4 solved, 25 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 25 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 3/29 variables, 3/7 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 31/61 variables, 30/39 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 25/64 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/64 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/64 constraints. Problems are: Problem set: 4 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 64 constraints, problems are : Problem set: 4 solved, 25 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 25/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 858ms problems are : Problem set: 4 solved, 25 unsolved
Search for dead transitions found 4 dead transitions in 859ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 27/32 transitions.
Graph (complete) has 68 edges and 30 vertex of which 27 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 27 /30 variables (removed 3) and now considering 27/27 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/30 places, 27/32 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 890 ms. Remains : 27/30 places, 27/32 transitions.
Built C files in :
/tmp/ltsmin5086647926595827751
[2025-06-06 07:13:38] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5086647926595827751
Running compilation step : cd /tmp/ltsmin5086647926595827751;'/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 255 ms.
Running link step : cd /tmp/ltsmin5086647926595827751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5086647926595827751;'/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/stateBased13897588965926749094.hoa' '--buchi-type=spotba'
LTSmin run took 144 ms.
FORMULA TCPcondis-PT-25-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-25-LTLCardinality-00 finished in 7675 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((F((p0&&F(!p0)))&&X(X(X(X(p1))))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 07:13:39] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:39] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 07:13:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:39] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:13:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 916ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 916ms
Finished structural reductions in LTL mode , in 1 iterations and 1002 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 763 ms :[true, true, true, (NOT p1), p0, (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-01
Product exploration explored 100000 steps with 5754 reset in 162 ms.
Product exploration explored 100000 steps with 5576 reset in 173 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 216 ms. Reduced automaton from 20 states, 37 edges and 2 AP (stutter sensitive) to 20 states, 37 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 736 ms :[true, true, true, (NOT p1), p0, (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 4875 steps (0 resets) in 8 ms. (541 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 296 ms. Reduced automaton from 20 states, 37 edges and 2 AP (stutter sensitive) to 20 states, 37 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 725 ms :[true, true, true, (NOT p1), p0, (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 763 ms :[true, true, true, (NOT p1), p0, (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1))]
[2025-06-06 07:13:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG true
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), true]
Knowledge based reduction with 1 factoid took 323 ms. Reduced automaton from 20 states, 37 edges and 2 AP (stutter sensitive) to 20 states, 37 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 732 ms :[true, true, true, (NOT p1), p0, (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1))]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 07:13:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 07:13:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:45] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:13:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 931ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 931ms
Finished structural reductions in LTL mode , in 1 iterations and 1011 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 244 ms. Reduced automaton from 20 states, 37 edges and 2 AP (stutter sensitive) to 20 states, 37 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 826 ms :[true, true, true, (NOT p1), p0, (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 1668 steps (0 resets) in 6 ms. (238 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 305 ms. Reduced automaton from 20 states, 37 edges and 2 AP (stutter sensitive) to 20 states, 37 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 893 ms :[true, true, true, (NOT p1), p0, (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 800 ms :[true, true, true, (NOT p1), p0, (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1))]
[2025-06-06 07:13:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG true
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), true]
Knowledge based reduction with 1 factoid took 362 ms. Reduced automaton from 20 states, 37 edges and 2 AP (stutter sensitive) to 20 states, 37 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 760 ms :[true, true, true, (NOT p1), p0, (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 750 ms :[true, true, true, (NOT p1), p0, (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 5509 reset in 153 ms.
Stack based approach found an accepted trace after 46709 steps with 2707 reset with depth 22 and stack size 22 in 73 ms.
FORMULA TCPcondis-PT-25-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLCardinality-01 finished in 12269 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)&&F(p1)&&X((X(p2)||G(p3)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 07:13:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 07:13:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:51] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:13:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 935ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 935ms
Finished structural reductions in LTL mode , in 1 iterations and 1017 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p3) (NOT p2)), true, (NOT p3)]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-25-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLCardinality-02 finished in 1316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((G((p0 U p1))||F(p2)) U (p3 U G(p0))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 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 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
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 12 place count 25 transition count 25
Applied a total of 12 rules in 16 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2025-06-06 07:13:52] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:52] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-06 07:13:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:52] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:13:52] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-06 07:13:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 537ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 538ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 617 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 194 ms :[p0, p0, p0, (AND p0 p2), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-03
Product exploration explored 100000 steps with 489 reset in 296 ms.
Product exploration explored 100000 steps with 551 reset in 345 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p3))), (X (NOT p3)), (X (NOT (OR p0 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 252 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter insensitive) to 6 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[p0, p0, p0, (AND p0 p2), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 28684 steps (6 resets) in 53 ms. (531 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p3))), (X (NOT p3)), (X (NOT (OR p0 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F p3), (F (NOT (OR p2 (NOT p3)))), (F (NOT (AND (OR p2 (NOT p0)) (OR p2 (NOT p1))))), (F p0), (F p1)]
Knowledge based reduction with 17 factoid took 637 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter insensitive) to 6 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[p0, p0, p0, (AND p0 p2), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 236 ms :[p0, p0, p0, (AND p0 p2), (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2025-06-06 07:13:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 07:13:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:55] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:13:55] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-06 07:13:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 506ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 507ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 585 ms. Remains : 25/25 places, 25/25 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p3))), (X (NOT p3)), (X (NOT (OR p0 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 325 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter insensitive) to 6 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 278 ms :[p0, p0, p0, (AND p0 p2), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 38744 steps (8 resets) in 70 ms. (545 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p3))), (X (NOT p3)), (X (NOT (OR p0 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F p3), (F (NOT (OR p2 (NOT p3)))), (F (NOT (AND (OR p2 (NOT p0)) (OR p2 (NOT p1))))), (F p0), (F p1)]
Knowledge based reduction with 17 factoid took 631 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter insensitive) to 6 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 288 ms :[p0, p0, p0, (AND p0 p2), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 267 ms :[p0, p0, p0, (AND p0 p2), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 283 ms :[p0, p0, p0, (AND p0 p2), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 529 reset in 205 ms.
Product exploration explored 100000 steps with 576 reset in 214 ms.
Built C files in :
/tmp/ltsmin2140874001135920015
[2025-06-06 07:13:59] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2025-06-06 07:13:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 07:13:59] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2025-06-06 07:13:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 07:13:59] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2025-06-06 07:13:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 07:13:59] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2140874001135920015
Running compilation step : cd /tmp/ltsmin2140874001135920015;'/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 101 ms.
Running link step : cd /tmp/ltsmin2140874001135920015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2140874001135920015;'/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/stateBased8198246799533508138.hoa' '--buchi-type=spotba'
LTSmin run took 314 ms.
FORMULA TCPcondis-PT-25-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-25-LTLCardinality-03 finished in 6718 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 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
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 14 place count 24 transition count 24
Applied a total of 14 rules in 6 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2025-06-06 07:13:59] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:59] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-06 07:13:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:13:59] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:13:59] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2025-06-06 07:13: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/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 33 constraints, problems are : Problem set: 0 solved, 22 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 55 constraints, problems are : Problem set: 0 solved, 22 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 478ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 479ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 565 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 204 ms.
Stack based approach found an accepted trace after 39521 steps with 0 reset with depth 39522 and stack size 16030 in 121 ms.
FORMULA TCPcondis-PT-25-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLCardinality-04 finished in 943 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 U (G(p0)||(p0&&G(p1)))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 07:14:00] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:00] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 07:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:00] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 946ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 947ms
Finished structural reductions in LTL mode , in 1 iterations and 1016 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 256 ms.
Product exploration explored 100000 steps with 0 reset in 301 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 294 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), false]
RANDOM walk for 35765 steps (7 resets) in 52 ms. (674 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 462 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter insensitive) to 4 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), false]
[2025-06-06 07:14:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 07:14:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 07:14:03] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 8 factoid took 546 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-25-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-25-LTLCardinality-05 finished in 3619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 07:14:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 07:14:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:04] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:14:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 493 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 916ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 916ms
Finished structural reductions in LTL mode , in 1 iterations and 984 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-25-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLCardinality-06 finished in 1135 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 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 26 transition count 25
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 12 place count 25 transition count 25
Applied a total of 12 rules in 9 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2025-06-06 07:14:05] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-06 07:14:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:05] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:14:05] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-06 07:14:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 624ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 624ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 714 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-07
Product exploration explored 100000 steps with 382 reset in 241 ms.
Product exploration explored 100000 steps with 557 reset in 263 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 211 steps (0 resets) in 5 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2025-06-06 07:14:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 07:14:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-06 07:14:07] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-06 07:14:07] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-06 07:14:07] [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 07:14:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-06 07:14:07] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 2 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 223 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-25-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-25-LTLCardinality-07 finished in 2273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
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 14 place count 24 transition count 24
Applied a total of 14 rules in 9 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2025-06-06 07:14:07] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:07] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-06 07:14:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:07] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:14:07] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2025-06-06 07:14:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 33 constraints, problems are : Problem set: 0 solved, 22 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 55 constraints, problems are : Problem set: 0 solved, 22 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 543ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 543ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 624 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-08
Product exploration explored 100000 steps with 131 reset in 200 ms.
Stack based approach found an accepted trace after 27313 steps with 210 reset with depth 837 and stack size 837 in 52 ms.
FORMULA TCPcondis-PT-25-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLCardinality-08 finished in 1012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||G(p1)) U p2)&&X(F((!p3 U (p4||G(!p3)))))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 07:14:08] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:08] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-06 07:14:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:08] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:14:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 918ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 918ms
Finished structural reductions in LTL mode , in 1 iterations and 993 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (AND p3 (NOT p4))), true, (NOT p1), (NOT p2), (AND (NOT p4) p3)]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 418 steps with 7 reset in 3 ms.
FORMULA TCPcondis-PT-25-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLCardinality-09 finished in 1229 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((F(G(p2))&&p1))||p0)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 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 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
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 12 place count 25 transition count 25
Applied a total of 12 rules in 5 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2025-06-06 07:14:09] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:09] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 07:14:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:09] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:14:09] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-06 07:14: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/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 526ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 527ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 612 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-10
Product exploration explored 100000 steps with 16564 reset in 110 ms.
Stack based approach found an accepted trace after 83827 steps with 13794 reset with depth 17 and stack size 17 in 110 ms.
FORMULA TCPcondis-PT-25-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLCardinality-10 finished in 937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0) U p1))&&F((X(p2)&&p2))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 07:14:10] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:10] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-06 07:14:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:10] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:14:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 902ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 902ms
Finished structural reductions in LTL mode , in 1 iterations and 974 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-11
Product exploration explored 100000 steps with 2340 reset in 271 ms.
Product exploration explored 100000 steps with 2353 reset in 207 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), (X (X (NOT p1))), (X (X p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 553 steps (0 resets) in 4 ms. (110 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), (X (X (NOT p1))), (X (X p2))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
[2025-06-06 07:14:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), (X (X (NOT p1))), (X (X p2))]
False Knowledge obtained : [(F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-25-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-25-LTLCardinality-11 finished in 2288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(X(F(p1))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 07:14:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:12] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-06 07:14:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:13] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:14:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 955ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 955ms
Finished structural reductions in LTL mode , in 1 iterations and 1029 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 2 ms.
FORMULA TCPcondis-PT-25-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLCardinality-12 finished in 1259 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)) U G(p1)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 25 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 25 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 place count 25 transition count 25
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 13 place count 24 transition count 25
Applied a total of 13 rules in 9 ms. Remains 24 /30 variables (removed 6) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 24 cols
[2025-06-06 07:14:14] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:14] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 07:14:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:14] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:14:14] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2025-06-06 07:14:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 25/49 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/49 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 33 constraints, problems are : Problem set: 0 solved, 22 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 25/49 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/49 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 55 constraints, problems are : Problem set: 0 solved, 22 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 810ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 810ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 894 ms. Remains : 24/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-13
Product exploration explored 100000 steps with 523 reset in 210 ms.
Product exploration explored 100000 steps with 555 reset in 201 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 2996 steps (0 resets) in 7 ms. (374 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p0)]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 25/25 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2025-06-06 07:14:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:16] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-06 07:14:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:16] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:14:16] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2025-06-06 07:14: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/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 25/49 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/49 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 33 constraints, problems are : Problem set: 0 solved, 22 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 25/49 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/49 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 55 constraints, problems are : Problem set: 0 solved, 22 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 607ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 688 ms. Remains : 24/24 places, 25/25 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 1795 steps (0 resets) in 6 ms. (256 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 521 reset in 190 ms.
Product exploration explored 100000 steps with 546 reset in 200 ms.
Built C files in :
/tmp/ltsmin18393261899863064047
[2025-06-06 07:14:18] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2025-06-06 07:14:18] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 07:14:18] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2025-06-06 07:14:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 07:14:18] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2025-06-06 07:14:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 07:14:18] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18393261899863064047
Running compilation step : cd /tmp/ltsmin18393261899863064047;'/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 102 ms.
Running link step : cd /tmp/ltsmin18393261899863064047;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18393261899863064047;'/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/stateBased17478016102769228189.hoa' '--buchi-type=spotba'
LTSmin run took 243 ms.
FORMULA TCPcondis-PT-25-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-25-LTLCardinality-13 finished in 4247 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)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 07:14:18] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:18] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-06 07:14:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:14: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/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 924ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 924ms
Finished structural reductions in LTL mode , in 1 iterations and 998 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-25-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLCardinality-15 finished in 1105 ms.
All properties solved by simple procedures.
Total runtime 50819 ms.
BK_STOP 1749194059606
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="TCPcondis-PT-25"
export BK_EXAMINATION="LTLCardinality"
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 TCPcondis-PT-25, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r240-tall-174915589400211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-25.tgz
mv TCPcondis-PT-25 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;