About the Execution of ITS-Tools for CopsAndRobbers-PT-CRL005X001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 127873.00 | 0.00 | 0.00 | TTFFFFFFTTFFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339400171.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339400171
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-01
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-02
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-03
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-04
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-05
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-06
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-07
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-08
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-09
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-10
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-11
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-12
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-13
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-14
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749337633068
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202505121319
[2025-06-07 23:07:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 23:07:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 23:07:14] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2025-06-07 23:07:14] [INFO ] Transformed 35 places.
[2025-06-07 23:07:14] [INFO ] Transformed 39 transitions.
[2025-06-07 23:07:14] [INFO ] Parsed PT model containing 35 places and 39 transitions and 174 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Support contains 33 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 39/39 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 39
Applied a total of 1 rules in 22 ms. Remains 34 /35 variables (removed 1) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 34 cols
[2025-06-07 23:07:14] [INFO ] Computed 8 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:07:14] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-07 23:07:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:07:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:07:14] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:07:14] [INFO ] Invariant cache hit.
[2025-06-07 23:07:14] [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:07:15] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:07:15] [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:07: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:07:15] [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:07:15] [INFO ] Deduced a trap composed of 14 places in 35 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) 4/73 variables, 4/57 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:07:15] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/73 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 58 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1351 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 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: 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, 13/66 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:07:16] [INFO ] Deduced a trap along path composed of 6 places in 34 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 4/73 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/73 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/73 variables, 1/88 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:07:17] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/73 variables, 1/89 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:07:22] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 1/90 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:07:29] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/73 variables, 1/91 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:07:33] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:07:34] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/73 variables, 2/93 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:07:39] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 73/73 variables, and 94 constraints, problems are : Problem set: 0 solved, 29 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31413ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 31426ms
Starting structural reductions in LTL mode, iteration 1 : 34/35 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31708 ms. Remains : 34/35 places, 39/39 transitions.
Support contains 33 out of 34 places after structural reductions.
[2025-06-07 23:07:46] [INFO ] Flatten gal took : 21 ms
[2025-06-07 23:07:46] [INFO ] Flatten gal took : 9 ms
[2025-06-07 23:07:46] [INFO ] Input system was already deterministic with 39 transitions.
Support contains 31 out of 34 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 2106 ms. (18 steps per ms) remains 15/41 properties
BEST_FIRST walk for 4000 steps (13 resets) in 145 ms. (27 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (9 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (11 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (9 resets) in 78 ms. (50 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4000 steps (9 resets) in 114 ms. (34 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (13 resets) in 31 ms. (125 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (9 resets) in 26 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (12 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (14 resets) in 26 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (13 resets) in 32 ms. (121 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (12 resets) in 20 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (10 resets) in 21 ms. (181 steps per ms) remains 13/13 properties
[2025-06-07 23:07:47] [INFO ] Invariant cache hit.
[2025-06-07 23:07:47] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 2 (OVERLAPS) 10/25 variables, 5/6 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/7 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 37/64 variables, 27/35 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 8/43 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/43 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Real declared 73/73 variables, and 50 constraints, problems are : Problem set: 13 solved, 0 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 8/10 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 13 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 11 stable transitions
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1||X(p2)))))))'
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 39
Applied a total of 4 rules in 1 ms. Remains 30 /34 variables (removed 4) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 30 cols
[2025-06-07 23:07:48] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:07:48] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-07 23:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:07:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:07:48] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:07:48] [INFO ] Invariant cache hit.
[2025-06-07 23:07:48] [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:07:48] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:07:48] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:07:48] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:07:48] [INFO ] Deduced a trap composed of 15 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:07:48] [INFO ] Deduced a trap composed of 14 places in 31 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 943 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:07:50] [INFO ] Deduced a trap along path composed of 6 places in 30 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 15323 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 16290ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16290ms
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16400 ms. Remains : 30/34 places, 39/39 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Product exploration explored 100000 steps with 50000 reset in 138 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 p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 21 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLCardinality-00 finished in 17118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F(p1))||((p0 U p2)&&(p1||X(p1))))))'
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 39
Applied a total of 3 rules in 2 ms. Remains 31 /34 variables (removed 3) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 31 cols
[2025-06-07 23:08:05] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:08:05] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-07 23:08:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:08:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:08:05] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:08:05] [INFO ] Invariant cache hit.
[2025-06-07 23:08:05] [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:08:05] [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:08:05] [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:08:05] [INFO ] Deduced a trap composed of 14 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:08:05] [INFO ] Deduced a trap composed of 15 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:08:05] [INFO ] Deduced a trap composed of 14 places in 35 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) 1/70 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/70 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 54 constraints, problems are : Problem set: 0 solved, 29 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 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, 25/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 1/70 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 4/83 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:08:13] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 1/84 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:08:35] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 70/70 variables, and 85 constraints, problems are : Problem set: 0 solved, 29 unsolved in 30005 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30937ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 30938ms
Starting structural reductions in LTL mode, iteration 1 : 31/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31035 ms. Remains : 31/34 places, 39/39 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Computed a total of 4 stabilizing places and 11 stable transitions
Graph (complete) has 158 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 15 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLCardinality-08 finished in 31438 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 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 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 5 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 7 place count 27 transition count 36
Applied a total of 7 rules in 16 ms. Remains 27 /34 variables (removed 7) and now considering 36/39 (removed 3) transitions.
// Phase 1: matrix 36 rows 27 cols
[2025-06-07 23:08:36] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:08:36] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 23:08:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:08:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:08:36] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 100 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/34 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 118 ms. Remains : 26/34 places, 36/39 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 116 ms.
Product exploration explored 100000 steps with 0 reset in 113 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 : [p0, (X (X (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
RANDOM walk for 6 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 26 cols
[2025-06-07 23:08:37] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:08:37] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 23:08:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:08:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:08:37] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:08:37] [INFO ] Redundant transitions in 1 ms returned []
Running 26 sub problems to find dead transitions.
[2025-06-07 23:08:37] [INFO ] Invariant cache hit.
[2025-06-07 23:08:37] [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/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 36/62 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 43 constraints, problems are : Problem set: 0 solved, 26 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 36/62 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 26/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 69 constraints, problems are : Problem set: 0 solved, 26 unsolved in 10416 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10843ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 10845ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10960 ms. Remains : 26/26 places, 36/36 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 : [p0, (X (X (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 5 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 178 ms.
Built C files in :
/tmp/ltsmin622180333285840168
[2025-06-07 23:08:49] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2025-06-07 23:08:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 23:08:49] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2025-06-07 23:08:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 23:08:49] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2025-06-07 23:08:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 23:08:49] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin622180333285840168
Running compilation step : cd /tmp/ltsmin622180333285840168;'/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 252 ms.
Running link step : cd /tmp/ltsmin622180333285840168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin622180333285840168;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7322789110259680864.hoa' '--buchi-type=spotba'
LTSmin run took 78 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLCardinality-09 finished in 12781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X(p2)))'
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 39
Applied a total of 2 rules in 2 ms. Remains 32 /34 variables (removed 2) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 32 cols
[2025-06-07 23:08:49] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:08:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-07 23:08:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:08:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:08:49] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:08:49] [INFO ] Invariant cache hit.
[2025-06-07 23:08:49] [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:08:49] [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:08:49] [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:08:49] [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:08:50] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:08:50] [INFO ] Deduced a trap composed of 14 places in 38 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) 2/71 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/71 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 55 constraints, problems are : Problem set: 0 solved, 29 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 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, 21/74 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:08:52] [INFO ] Deduced a trap along path composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 2/71 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 8/85 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:06] [INFO ] Deduced a trap composed of 14 places in 46 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:06] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:09:06] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 3/88 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:10] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/71 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/71 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 71/71 variables, and 89 constraints, problems are : Problem set: 0 solved, 29 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30956ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 30956ms
Starting structural reductions in LTL mode, iteration 1 : 32/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31052 ms. Remains : 32/34 places, 39/39 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLCardinality-14 finished in 31214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 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 5 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 7 place count 27 transition count 36
Applied a total of 7 rules in 5 ms. Remains 27 /34 variables (removed 7) and now considering 36/39 (removed 3) transitions.
// Phase 1: matrix 36 rows 27 cols
[2025-06-07 23:09:20] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:09:20] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-07 23:09:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:09:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:09:20] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 100 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/34 places, 36/39 transitions.
Applied a total of 0 rules in 3 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 108 ms. Remains : 26/34 places, 36/39 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLCardinality-15
Stuttering criterion allowed to conclude after 16 steps with 1 reset in 0 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLCardinality-15 finished in 180 ms.
All properties solved by simple procedures.
Total runtime 126602 ms.
BK_STOP 1749337760941
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CopsAndRobbers-PT-CRL005X001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CopsAndRobbers-PT-CRL005X001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339400171"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;