Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339400172.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 CopsAndRobbers-PT-CRL005X001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339400172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.9K Jun 6 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Jun 6 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Jun 6 11:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 11:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 11:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Jun 6 11:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 17K Jun 6 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Jun 6 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Jun 6 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Jun 6 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 11:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 11 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 29K Jun 5 20:08 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 CopsAndRobbers-PT-CRL005X001-LTLFireability-00
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-01
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-02
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-03
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-04
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-05
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-06
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-07
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-08
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-09
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-10
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-11
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-12
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-13
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-14
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749337770751

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-CRL005X001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 23:09:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 23:09:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 23:09:32] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2025-06-07 23:09:32] [INFO ] Transformed 35 places.
[2025-06-07 23:09:32] [INFO ] Transformed 39 transitions.
[2025-06-07 23:09:32] [INFO ] Parsed PT model containing 35 places and 39 transitions and 174 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 39/39 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 30 transition count 39
Applied a total of 5 rules in 18 ms. Remains 30 /35 variables (removed 5) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 30 cols
[2025-06-07 23:09:32] [INFO ] Computed 8 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:09:32] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-07 23:09:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:09:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:09:32] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:09:32] [INFO ] Invariant cache hit.
[2025-06-07 23:09:32] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:33] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:33] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:33] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:33] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:33] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:35] [INFO ] Deduced a trap along path composed of 6 places in 42 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15552 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16608ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16617ms
Starting structural reductions in LTL mode, iteration 1 : 30/35 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16898 ms. Remains : 30/35 places, 39/39 transitions.
Support contains 24 out of 30 places after structural reductions.
[2025-06-07 23:09:49] [INFO ] Flatten gal took : 16 ms
[2025-06-07 23:09:49] [INFO ] Flatten gal took : 8 ms
[2025-06-07 23:09:49] [INFO ] Input system was already deterministic with 39 transitions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (10 resets) in 1153 ms. (34 steps per ms) remains 3/22 properties
BEST_FIRST walk for 40004 steps (1816 resets) in 165 ms. (240 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (14 resets) in 286 ms. (139 steps per ms) remains 1/2 properties
BEST_FIRST walk for 68 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 4 stabilizing places and 11 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(F((p0&&X(F((!p1 U (p2||G(!p1))))))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2025-06-07 23:09:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:09:50] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-07 23:09:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:09:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:09:50] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:09:50] [INFO ] Invariant cache hit.
[2025-06-07 23:09:50] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:50] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:50] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:50] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:50] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:50] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 817 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:52] [INFO ] Deduced a trap along path composed of 6 places in 31 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15410 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16242ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16242ms
Finished structural reductions in LTL mode , in 1 iterations and 16336 ms. Remains : 30/30 places, 39/39 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND (NOT p2) p1)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLFireability-00
Product exploration explored 100000 steps with 25000 reset in 300 ms.
Product exploration explored 100000 steps with 25000 reset in 152 ms.
Computed a total of 4 stabilizing places and 11 stable transitions
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 30004 steps (10 resets) in 55 ms. (535 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
[2025-06-07 23:10:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 23:10:08] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2025-06-07 23:10:08] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 23:10:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-07 23:10:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:10:08] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-07 23:10:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 23:10:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2025-06-07 23:10:08] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 23:10:08] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-07 23:10:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-07 23:10:08] [INFO ] Computed and/alt/rep : 28/95/28 causal constraints (skipped 1 transitions) in 3 ms.
[2025-06-07 23:10:08] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2025-06-07 23:10:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:10:08] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-07 23:10:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:10:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:10:08] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:10:08] [INFO ] Invariant cache hit.
[2025-06-07 23:10:08] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:08] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:08] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:08] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:08] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:09] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:10] [INFO ] Deduced a trap along path composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15392 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16209ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16209ms
Finished structural reductions in LTL mode , in 1 iterations and 16293 ms. Remains : 30/30 places, 39/39 transitions.
Computed a total of 4 stabilizing places and 11 stable transitions
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 20027 steps (7 resets) in 35 ms. (556 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p2))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
[2025-06-07 23:10:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 23:10:25] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2025-06-07 23:10:25] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-07 23:10:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-07 23:10:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:10:25] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-06-07 23:10:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 23:10:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2025-06-07 23:10:25] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 23:10:25] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-07 23:10:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-07 23:10:25] [INFO ] Computed and/alt/rep : 28/95/28 causal constraints (skipped 1 transitions) in 2 ms.
[2025-06-07 23:10:25] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 143 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 80 ms.
Product exploration explored 100000 steps with 25000 reset in 148 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 149 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 39
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:10:26] [INFO ] Redundant transitions in 1 ms returned []
Running 29 sub problems to find dead transitions.
// Phase 1: matrix 39 rows 30 cols
[2025-06-07 23:10:26] [INFO ] Computed 8 invariants in 1 ms
[2025-06-07 23:10:26] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:26] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/39 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/49 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:26] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 1/50 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:26] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/51 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:26] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:26] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:26] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:26] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 4/55 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/55 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/55 constraints. Problems are: Problem set: 3 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 55 constraints, problems are : Problem set: 3 solved, 26 unsolved in 1035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 5/30 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 3/14 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/44 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/54 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 26/80 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/81 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:29] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 1/82 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/69 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/69 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 82 constraints, problems are : Problem set: 3 solved, 26 unsolved in 12496 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 26/29 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 13551ms problems are : Problem set: 3 solved, 26 unsolved
Search for dead transitions found 3 dead transitions in 13551ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 36/39 transitions.
Graph (complete) has 152 edges and 30 vertex of which 27 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 27 /30 variables (removed 3) and now considering 36/36 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/30 places, 36/39 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13578 ms. Remains : 27/30 places, 36/39 transitions.
Built C files in :
/tmp/ltsmin9192574848930675874
[2025-06-07 23:10:39] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9192574848930675874
Running compilation step : cd /tmp/ltsmin9192574848930675874;'/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 215 ms.
Running link step : cd /tmp/ltsmin9192574848930675874;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin9192574848930675874;'/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/stateBased9261396116551844846.hoa' '--buchi-type=spotba'
LTSmin run took 122 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLFireability-00 finished in 49962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U ((G(p1) U p2) U X(p3)))&&F(p4)))'
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 30 cols
[2025-06-07 23:10:40] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:10:40] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-07 23:10:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:10:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:10:40] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:10:40] [INFO ] Invariant cache hit.
[2025-06-07 23:10:40] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:40] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 753 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:42] [INFO ] Deduced a trap along path composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15333 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16091ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16091ms
Finished structural reductions in LTL mode , in 1 iterations and 16164 ms. Remains : 30/30 places, 39/39 transitions.
Stuttering acceptance computed with spot in 561 ms :[(OR (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), true, (NOT p1), (NOT p2), (AND p0 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)) (AND p0 (NOT p3)))]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLFireability-02
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 0 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLFireability-02 finished in 16761 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(X(G(F(X((X(F(X(p0))) U X(p1))))))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 30 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 37
Applied a total of 4 rules in 14 ms. Remains 28 /30 variables (removed 2) and now considering 37/39 (removed 2) transitions.
// Phase 1: matrix 37 rows 28 cols
[2025-06-07 23:10:57] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:10:57] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 23:10:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:10:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:10:57] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 91 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/30 places, 37/39 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 27/30 places, 37/39 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 88 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 1 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLFireability-03 finished in 282 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(F(p0))&&(X(G(p1))||G(p2)))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 30 cols
[2025-06-07 23:10:57] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:10:57] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-07 23:10:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:10:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:10:57] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:10:57] [INFO ] Invariant cache hit.
[2025-06-07 23:10:57] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:57] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:57] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:57] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:57] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:10:59] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15359 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16127ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16127ms
Finished structural reductions in LTL mode , in 1 iterations and 16211 ms. Remains : 30/30 places, 39/39 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLFireability-04
Product exploration explored 100000 steps with 1 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 120 ms.
Computed a total of 4 stabilizing places and 11 stable transitions
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 88 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40000 steps (10 resets) in 96 ms. (412 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
[2025-06-07 23:11:14] [INFO ] Invariant cache hit.
[2025-06-07 23:11:14] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/21 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/22 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/53 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 69/69 variables, and 40 constraints, problems are : Problem set: 1 solved, 0 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 2/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT p1)), (F (NOT (AND p1 p2))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 274 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 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, 39/39 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2025-06-07 23:11:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:11:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-07 23:11:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:11:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:11:15] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:11:15] [INFO ] Invariant cache hit.
[2025-06-07 23:11:15] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:15] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:15] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:15] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:15] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:15] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:17] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15329 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16115ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16116ms
Finished structural reductions in LTL mode , in 1 iterations and 16187 ms. Remains : 30/30 places, 39/39 transitions.
Computed a total of 4 stabilizing places and 11 stable transitions
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p2), (X (X (AND p1 p2))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 30026 steps (10 resets) in 39 ms. (750 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p2), (X (X (AND p1 p2))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3 reset in 76 ms.
Product exploration explored 100000 steps with 0 reset in 77 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 39/39 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 39
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:11:32] [INFO ] Redundant transitions in 1 ms returned []
Running 29 sub problems to find dead transitions.
// Phase 1: matrix 39 rows 30 cols
[2025-06-07 23:11:32] [INFO ] Computed 8 invariants in 1 ms
[2025-06-07 23:11:32] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:32] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:32] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:33] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:33] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:33] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 3/13 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:33] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/54 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 0/69 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 54 constraints, problems are : Problem set: 2 solved, 27 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 5/10 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 4/30 variables, 2/12 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/44 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/54 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 27/81 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:35] [INFO ] Deduced a trap along path composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/82 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/82 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:42] [INFO ] Deduced a trap along path composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/69 variables, 1/83 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 2 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 2 solved, 27 unsolved in 23218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 27/29 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 24056ms problems are : Problem set: 2 solved, 27 unsolved
Search for dead transitions found 2 dead transitions in 24057ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 37/39 transitions.
Graph (complete) has 153 edges and 30 vertex of which 28 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 37/37 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/30 places, 37/39 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24069 ms. Remains : 28/30 places, 37/39 transitions.
Built C files in :
/tmp/ltsmin8958706958443787206
[2025-06-07 23:11:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8958706958443787206
Running compilation step : cd /tmp/ltsmin8958706958443787206;'/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 107 ms.
Running link step : cd /tmp/ltsmin8958706958443787206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8958706958443787206;'/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/stateBased1258807858384225145.hoa' '--buchi-type=spotba'
LTSmin run took 124 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLFireability-04 finished in 59839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(((p0 U p1)||X(X(p2))) U (X(p0)&&p3)))'
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 30 cols
[2025-06-07 23:11:57] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:11:57] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-07 23:11:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:11:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:11:57] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:11:57] [INFO ] Invariant cache hit.
[2025-06-07 23:11:57] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:57] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:57] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:57] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:57] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:57] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:11:59] [INFO ] Deduced a trap along path composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15282 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16070ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16071ms
Finished structural reductions in LTL mode , in 1 iterations and 16149 ms. Remains : 30/30 places, 39/39 transitions.
Stuttering acceptance computed with spot in 440 ms :[(AND p0 p3), p0, (AND p0 p2 p3), (AND p0 p1 p3), true, (AND p0 p2 p3), (AND p0 p2), (AND p0 p2 p3), (AND p1 p3 p0 p2), (AND p1 p0), p1]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLFireability-05
Product exploration explored 100000 steps with 22223 reset in 86 ms.
Product exploration explored 100000 steps with 22180 reset in 102 ms.
Computed a total of 4 stabilizing places and 11 stable transitions
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 (NOT p3) (NOT p0) (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p1 p3))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p1), (X (NOT p1))]
Knowledge based reduction with 21 factoid took 216 ms. Reduced automaton from 11 states, 31 edges and 4 AP (stutter sensitive) to 11 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 457 ms :[(AND p0 p3), p0, (AND p0 p2 p3), (AND p0 p1 p3), true, (AND p0 p2 p3), (AND p0 p2), (AND p0 p2 p3), (AND p1 p3 p0 p2), (AND p1 p0), p1]
RANDOM walk for 40000 steps (8 resets) in 158 ms. (251 steps per ms) remains 9/15 properties
BEST_FIRST walk for 40000 steps (11 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (11 resets) in 227 ms. (175 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (9 resets) in 171 ms. (232 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (9 resets) in 183 ms. (217 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 237 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1664 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (13 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (10 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (10 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
[2025-06-07 23:12:15] [INFO ] Invariant cache hit.
[2025-06-07 23:12:15] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
Problem apf10 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 2 (OVERLAPS) 9/19 variables, 4/6 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/7 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 21/69 variables, and 8 constraints, problems are : Problem set: 9 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/30 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 9 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p3) (NOT p0) (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p1 p3))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) p1 (NOT p3))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p1) (NOT p3))), (G (OR (NOT p0) p1 (NOT p3) (NOT p2))), (G (OR (NOT p0) (NOT p1))), (G (OR (NOT p0) p1 (NOT p2))), (G (OR (NOT p3) (NOT p2))), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p1) (NOT p3) (NOT p2)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F p2), (F p3), (F (NOT (OR p1 (NOT p2))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 30 factoid took 149 ms. Reduced automaton from 11 states, 31 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLFireability-05 finished in 18272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(X(p0)&&G(!p1)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2025-06-07 23:12:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:12:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-07 23:12:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:12:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:12:15] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:12:15] [INFO ] Invariant cache hit.
[2025-06-07 23:12:15] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:15] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:15] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:15] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:15] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:15] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:17] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15502 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16278ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16278ms
Finished structural reductions in LTL mode , in 1 iterations and 16362 ms. Remains : 30/30 places, 39/39 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (AND p1 (NOT p0)), p1, (NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 92 ms.
Product exploration explored 100000 steps with 1 reset in 99 ms.
Computed a total of 4 stabilizing places and 11 stable transitions
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 290 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (11 resets) in 91 ms. (434 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40000 steps (10 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
[2025-06-07 23:12:32] [INFO ] Invariant cache hit.
[2025-06-07 23:12:32] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 10/69 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 3/7 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/30 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 467 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p0), p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2025-06-07 23:12:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:12:33] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-07 23:12:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:12:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:12:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:12:33] [INFO ] Invariant cache hit.
[2025-06-07 23:12:33] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:34] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:34] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:34] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:34] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:34] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:35] [INFO ] Deduced a trap along path composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15525 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16300ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16300ms
Finished structural reductions in LTL mode , in 1 iterations and 16382 ms. Remains : 30/30 places, 39/39 transitions.
Computed a total of 4 stabilizing places and 11 stable transitions
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 275 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (10 resets) in 89 ms. (444 steps per ms) remains 1/4 properties
BEST_FIRST walk for 20058 steps (5 resets) in 16 ms. (1179 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 378 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 82 ms.
Product exploration explored 100000 steps with 3 reset in 83 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 39
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:12:52] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
// Phase 1: matrix 39 rows 30 cols
[2025-06-07 23:12:52] [INFO ] Computed 8 invariants in 2 ms
[2025-06-07 23:12:52] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:52] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/39 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/49 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:52] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 1/50 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:52] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/51 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:52] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:52] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:52] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:52] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 4/55 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/55 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/55 constraints. Problems are: Problem set: 3 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 55 constraints, problems are : Problem set: 3 solved, 26 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 5/30 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 3/14 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/44 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/54 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 26/80 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/81 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:12:55] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 1/82 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/69 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/69 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 82 constraints, problems are : Problem set: 3 solved, 26 unsolved in 12496 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 26/29 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 13539ms problems are : Problem set: 3 solved, 26 unsolved
Search for dead transitions found 3 dead transitions in 13540ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 36/39 transitions.
Graph (complete) has 152 edges and 30 vertex of which 27 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 27 /30 variables (removed 3) and now considering 36/36 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/30 places, 36/39 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13563 ms. Remains : 27/30 places, 36/39 transitions.
Built C files in :
/tmp/ltsmin14838658386483870107
[2025-06-07 23:13:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14838658386483870107
Running compilation step : cd /tmp/ltsmin14838658386483870107;'/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 116 ms.
Running link step : cd /tmp/ltsmin14838658386483870107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14838658386483870107;'/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/stateBased16414823386828871751.hoa' '--buchi-type=spotba'
LTSmin run took 122 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLFireability-06 finished in 50617 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(F((!p0||X(!p1)))) U ((F(!p2)&&X(F((!p0||X(!p1)))))||G(X(F((!p0||X(!p1)))))))&&(!p0 U (p3||G(!p0))))))'
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 30 cols
[2025-06-07 23:13:06] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:06] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-07 23:13:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:13:06] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:13:06] [INFO ] Invariant cache hit.
[2025-06-07 23:13:06] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:06] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:06] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:06] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:06] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:06] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:08] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15232 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16007ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16007ms
Finished structural reductions in LTL mode , in 1 iterations and 16083 ms. Remains : 30/30 places, 39/39 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (AND p0 (NOT p3)) (AND p0 p1)), (OR (AND p0 (NOT p3)) (AND p0 p1)), true, (AND p0 (NOT p3)), (AND p0 p1), (AND p2 p0 p1), (AND p0 p1), (AND p0 p2 p1)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 97 ms.
Product exploration explored 100000 steps with 33333 reset in 97 ms.
Computed a total of 4 stabilizing places and 11 stable transitions
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 (NOT p2) (NOT p1)), (X (NOT p2)), (X p3), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p3)))), (X (NOT (AND p0 p1 p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (OR (NOT p0) p3)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 22 ms. Reduced automaton from 8 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLFireability-09 finished in 16649 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 U X(p1))&&((p2 U G(p0))||X(p0))))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2025-06-07 23:13:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:22] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-07 23:13:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:13:22] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:13:22] [INFO ] Invariant cache hit.
[2025-06-07 23:13:22] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:23] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:23] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:23] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:23] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:23] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:24] [INFO ] Deduced a trap along path composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15384 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16142ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16142ms
Finished structural reductions in LTL mode , in 1 iterations and 16213 ms. Remains : 30/30 places, 39/39 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p1), true, (NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLFireability-10
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 0 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLFireability-10 finished in 16606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 30 transition count 37
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 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 27 transition count 36
Applied a total of 6 rules in 6 ms. Remains 27 /30 variables (removed 3) and now considering 36/39 (removed 3) transitions.
// Phase 1: matrix 36 rows 27 cols
[2025-06-07 23:13:39] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-07 23:13:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:13:39] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 36/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 26/30 places, 36/39 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 73 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLFireability-11 finished in 215 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 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 30 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 37
Applied a total of 4 rules in 3 ms. Remains 28 /30 variables (removed 2) and now considering 37/39 (removed 2) transitions.
// Phase 1: matrix 37 rows 28 cols
[2025-06-07 23:13:39] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:39] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 23:13:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:13:39] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:13:39] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2025-06-07 23:13:39] [INFO ] Invariant cache hit.
[2025-06-07 23:13:39] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 37/65 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:39] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:39] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:39] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:39] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:40] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:40] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 52 constraints, problems are : Problem set: 0 solved, 27 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 2/28 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 37/65 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 27/78 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 0/65 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 79 constraints, problems are : Problem set: 0 solved, 27 unsolved in 5484 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6268ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 6268ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 37/39 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6372 ms. Remains : 28/30 places, 37/39 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 67 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLFireability-14 finished in 6582 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) U (X(F(p1))&&(p2||G(p1))))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 30 cols
[2025-06-07 23:13:46] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:46] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-07 23:13:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:13:46] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:13:46] [INFO ] Invariant cache hit.
[2025-06-07 23:13:46] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:46] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:46] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:46] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:46] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 753 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:13:48] [INFO ] Deduced a trap along path composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15500 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16257ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16257ms
Finished structural reductions in LTL mode , in 1 iterations and 16344 ms. Remains : 30/30 places, 39/39 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (NOT p1), true, p0, (NOT p1), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND p0 (NOT p1))]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLFireability-15 finished in 16685 ms.
All properties solved by simple procedures.
Total runtime 270836 ms.

BK_STOP 1749338042810

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CopsAndRobbers-PT-CRL005X001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339400172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-CRL005X001.tgz
mv CopsAndRobbers-PT-CRL005X001 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;