About the Execution of ITS-Tools for CopsAndRobbers-PT-HRL020X006
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 2340852.00 | 0.00 | 0.00 | FTTFFFFTTFFFFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339500220.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-HRL020X006, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339500220
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 9.5K Jun 6 08:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 6 08:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 6 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 6 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Jun 6 11:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 11:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 11:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 11:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 17K Jun 6 09:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Jun 6 09:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 08:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 6 08:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 11:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:51 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 195K 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-HRL020X006-LTLFireability-00
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-01
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-02
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-03
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-04
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-05
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-06
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-07
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-08
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-09
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-10
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-11
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-12
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-13
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-14
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749342617840
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-HRL020X006
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-08 00:30:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 00:30:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 00:30:19] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2025-06-08 00:30:19] [INFO ] Transformed 110 places.
[2025-06-08 00:30:19] [INFO ] Transformed 224 transitions.
[2025-06-08 00:30:19] [INFO ] Parsed PT model containing 110 places and 224 transitions and 1149 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 224/224 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 90 transition count 224
Applied a total of 20 rules in 30 ms. Remains 90 /110 variables (removed 20) and now considering 224/224 (removed 0) transitions.
Running 184 sub problems to find dead transitions.
// Phase 1: matrix 224 rows 90 cols
[2025-06-08 00:30:19] [INFO ] Computed 23 invariants in 12 ms
[2025-06-08 00:30:19] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 224/314 variables, 90/113 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 60/173 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/173 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/173 constraints. Problems are: Problem set: 40 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 173 constraints, problems are : Problem set: 40 solved, 144 unsolved in 13994 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 144 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 224/314 variables, 90/113 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 60/173 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 144/317 constraints. Problems are: Problem set: 40 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/314 variables, and 317 constraints, problems are : Problem set: 40 solved, 144 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 144/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34248ms problems are : Problem set: 40 solved, 144 unsolved
Search for dead transitions found 40 dead transitions in 34263ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 40 transitions.
// Phase 1: matrix 184 rows 90 cols
[2025-06-08 00:30:53] [INFO ] Computed 23 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:30:53] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-08 00:30:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:30:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:30:53] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/110 places, 184/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34580 ms. Remains : 90/110 places, 184/224 transitions.
Support contains 43 out of 90 places after structural reductions.
[2025-06-08 00:30:54] [INFO ] Flatten gal took : 32 ms
[2025-06-08 00:30:54] [INFO ] Flatten gal took : 14 ms
[2025-06-08 00:30:54] [INFO ] Input system was already deterministic with 184 transitions.
RANDOM walk for 40010 steps (58 resets) in 1099 ms. (36 steps per ms) remains 7/33 properties
BEST_FIRST walk for 40003 steps (66 resets) in 204 ms. (195 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (102 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (82 resets) in 139 ms. (285 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (76 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (93 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (75 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
[2025-06-08 00:30:54] [INFO ] Invariant cache hit.
[2025-06-08 00:30:54] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Real declared 41/274 variables, and 11 constraints, problems are : Problem set: 6 solved, 0 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 11/22 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/90 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 41 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 184/184 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 90 transition count 183
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 88 transition count 182
Applied a total of 4 rules in 21 ms. Remains 88 /90 variables (removed 2) and now considering 182/184 (removed 2) transitions.
Running 142 sub problems to find dead transitions.
// Phase 1: matrix 182 rows 88 cols
[2025-06-08 00:30:55] [INFO ] Computed 23 invariants in 2 ms
[2025-06-08 00:30:55] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:31:00] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:31:08] [INFO ] Deduced a trap along path composed of 5 places in 41 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/270 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/270 variables, and 153 constraints, problems are : Problem set: 0 solved, 142 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 182/270 variables, 88/112 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 142/294 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 40105ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 40106ms
[2025-06-08 00:31:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:31:35] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-08 00:31:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:31:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:31:36] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 00:31:36] [INFO ] Redundant transitions in 11 ms returned []
Running 142 sub problems to find dead transitions.
[2025-06-08 00:31:36] [INFO ] Invariant cache hit.
[2025-06-08 00:31:36] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:31:41] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:31:49] [INFO ] Deduced a trap along path composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/270 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:31:56] [INFO ] Deduced a trap along path composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/270 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:32:03] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/270 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/270 variables, and 155 constraints, problems are : Problem set: 0 solved, 142 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 182/270 variables, 88/113 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 142/295 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 60084ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/90 places, 182/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100892 ms. Remains : 88/90 places, 182/184 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLFireability-02
Product exploration explored 100000 steps with 33465 reset in 311 ms.
Product exploration explored 100000 steps with 33577 reset in 248 ms.
Computed a total of 4 stabilizing places and 41 stable transitions
Computed a total of 4 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 11 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 194 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2025-06-08 00:32:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-08 00:32:37] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2025-06-08 00:32:37] [INFO ] [Real]Absence check using 22 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-08 00:32:37] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-06-08 00:32:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:32:37] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2025-06-08 00:32:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-08 00:32:37] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2025-06-08 00:32:37] [INFO ] [Nat]Absence check using 22 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-08 00:32:37] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-08 00:32:37] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2025-06-08 00:32:37] [INFO ] Computed and/alt/rep : 60/260/60 causal constraints (skipped 82 transitions) in 12 ms.
[2025-06-08 00:32:37] [INFO ] Added : 0 causal constraints over 0 iterations in 60 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 182/182 transitions.
Applied a total of 0 rules in 12 ms. Remains 88 /88 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Running 142 sub problems to find dead transitions.
[2025-06-08 00:32:37] [INFO ] Invariant cache hit.
[2025-06-08 00:32:37] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:32:42] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:32:50] [INFO ] Deduced a trap along path composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/270 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:32:57] [INFO ] Deduced a trap along path composed of 5 places in 38 ms of which 1 ms to minimize.
SMT process timed out in 20072ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 20073ms
[2025-06-08 00:32:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:32:57] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-08 00:32:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:32:57] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:32:58] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 00:32:58] [INFO ] Redundant transitions in 9 ms returned []
Running 142 sub problems to find dead transitions.
[2025-06-08 00:32:58] [INFO ] Invariant cache hit.
[2025-06-08 00:32:58] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:33:03] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:33:11] [INFO ] Deduced a trap along path composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/270 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:33:18] [INFO ] Deduced a trap along path composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/270 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:33:25] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/270 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/270 variables, and 155 constraints, problems are : Problem set: 0 solved, 142 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 182/270 variables, 88/113 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 142/295 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 60082ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80825 ms. Remains : 88/88 places, 182/182 transitions.
Computed a total of 4 stabilizing places and 41 stable transitions
Computed a total of 4 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 18 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 196 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2025-06-08 00:33:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-08 00:33:59] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2025-06-08 00:33:59] [INFO ] [Real]Absence check using 22 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-08 00:33:59] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-06-08 00:33:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:33:59] [INFO ] [Real]Added 40 Read/Feed constraints in 9 ms returned sat
[2025-06-08 00:33:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-08 00:33:59] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2025-06-08 00:33:59] [INFO ] [Nat]Absence check using 22 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-08 00:33:59] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-08 00:33:59] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2025-06-08 00:33:59] [INFO ] Computed and/alt/rep : 60/260/60 causal constraints (skipped 82 transitions) in 14 ms.
[2025-06-08 00:33:59] [INFO ] Added : 0 causal constraints over 0 iterations in 59 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33518 reset in 204 ms.
Product exploration explored 100000 steps with 33529 reset in 211 ms.
Built C files in :
/tmp/ltsmin4728997179410766014
[2025-06-08 00:33:59] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2025-06-08 00:33:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:33:59] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2025-06-08 00:33:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:33:59] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2025-06-08 00:33:59] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:33:59] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4728997179410766014
Running compilation step : cd /tmp/ltsmin4728997179410766014;'/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 451 ms.
Running link step : cd /tmp/ltsmin4728997179410766014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin4728997179410766014;'/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/stateBased2874346405149670851.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 182/182 transitions.
Applied a total of 0 rules in 8 ms. Remains 88 /88 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Running 142 sub problems to find dead transitions.
[2025-06-08 00:34:14] [INFO ] Invariant cache hit.
[2025-06-08 00:34:14] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:34:20] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:34:27] [INFO ] Deduced a trap along path composed of 5 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/270 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:34:34] [INFO ] Deduced a trap along path composed of 5 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/270 variables, and 154 constraints, problems are : Problem set: 0 solved, 142 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 182/270 variables, 88/112 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 142/294 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 40070ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 40070ms
[2025-06-08 00:34:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:34:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-08 00:34:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:34:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:34:55] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 00:34:55] [INFO ] Redundant transitions in 5 ms returned []
Running 142 sub problems to find dead transitions.
[2025-06-08 00:34:55] [INFO ] Invariant cache hit.
[2025-06-08 00:34:55] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:35:00] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:35:08] [INFO ] Deduced a trap along path composed of 5 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/270 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:35:15] [INFO ] Deduced a trap along path composed of 5 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/270 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:35:22] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 4 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/270 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/270 variables, and 155 constraints, problems are : Problem set: 0 solved, 142 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 182/270 variables, 88/113 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 142/295 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 60085ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 100802 ms. Remains : 88/88 places, 182/182 transitions.
Built C files in :
/tmp/ltsmin6603442359691971447
[2025-06-08 00:35:55] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2025-06-08 00:35:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:35:55] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2025-06-08 00:35:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:35:55] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2025-06-08 00:35:55] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:35:55] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6603442359691971447
Running compilation step : cd /tmp/ltsmin6603442359691971447;'/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 368 ms.
Running link step : cd /tmp/ltsmin6603442359691971447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6603442359691971447;'/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/stateBased2394127972486695620.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 00:36:10] [INFO ] Flatten gal took : 10 ms
[2025-06-08 00:36:10] [INFO ] Flatten gal took : 10 ms
[2025-06-08 00:36:10] [INFO ] Time to serialize gal into /tmp/LTL9383287301575789348.gal : 4 ms
[2025-06-08 00:36:10] [INFO ] Time to serialize properties into /tmp/LTL12770067457898184346.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9383287301575789348.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8652534076775664630.hoa' '-atoms' '/tmp/LTL12770067457898184346.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12770067457898184346.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8652534076775664630.hoa
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, t29, t30, t32, t34, t3...940
Computing Next relation with stutter on 1.91268e+06 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1234 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.3752,212444,1,0,391,988601,387,129,5007,869225,441
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLFireability-02 finished in 328930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p1)&&p0))))'
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 184/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Running 144 sub problems to find dead transitions.
// Phase 1: matrix 184 rows 90 cols
[2025-06-08 00:36:24] [INFO ] Computed 23 invariants in 6 ms
[2025-06-08 00:36:24] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 153 constraints, problems are : Problem set: 0 solved, 144 unsolved in 13323 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:36:52] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 298 constraints, problems are : Problem set: 0 solved, 144 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33379ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 33379ms
[2025-06-08 00:36:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:36:57] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-08 00:36:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:36:57] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:36:57] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-08 00:36:57] [INFO ] Invariant cache hit.
[2025-06-08 00:36:57] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:37:07] [INFO ] Deduced a trap along path composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 154 constraints, problems are : Problem set: 0 solved, 144 unsolved in 18028 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
SMT process timed out in 48076ms, After SMT, problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 48077ms
Finished structural reductions in LTL mode , in 1 iterations and 81879 ms. Remains : 90/90 places, 184/184 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLFireability-03 finished in 82107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(p1))))))'
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 184/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Running 144 sub problems to find dead transitions.
[2025-06-08 00:37:46] [INFO ] Invariant cache hit.
[2025-06-08 00:37:46] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:37:55] [INFO ] Deduced a trap along path composed of 6 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 154 constraints, problems are : Problem set: 0 solved, 144 unsolved in 18287 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
SMT process timed out in 38333ms, After SMT, problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 38335ms
[2025-06-08 00:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:38:24] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-08 00:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:38:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:38:25] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-08 00:38:25] [INFO ] Invariant cache hit.
[2025-06-08 00:38:25] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:38:34] [INFO ] Deduced a trap along path composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 154 constraints, problems are : Problem set: 0 solved, 144 unsolved in 17864 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
SMT process timed out in 47912ms, After SMT, problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 47913ms
Finished structural reductions in LTL mode , in 1 iterations and 86745 ms. Remains : 90/90 places, 184/184 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLFireability-07
Product exploration explored 100000 steps with 1657 reset in 268 ms.
Product exploration explored 100000 steps with 1655 reset in 308 ms.
Computed a total of 4 stabilizing places and 41 stable transitions
Computed a total of 4 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
RANDOM walk for 35241 steps (78 resets) in 113 ms. (309 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 69 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 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p1)]
Support contains 2 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 184/184 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 90 transition count 183
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 183
Applied a total of 2 rules in 15 ms. Remains 89 /90 variables (removed 1) and now considering 183/184 (removed 1) transitions.
Running 143 sub problems to find dead transitions.
// Phase 1: matrix 183 rows 89 cols
[2025-06-08 00:39:14] [INFO ] Computed 23 invariants in 1 ms
[2025-06-08 00:39:14] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 2/89 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 183/272 variables, 89/112 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:39:17] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 153 constraints, problems are : Problem set: 0 solved, 143 unsolved in 14414 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 2/89 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 183/272 variables, 89/113 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 143/296 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:39:47] [INFO ] Deduced a trap along path composed of 5 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 272/272 variables, and 297 constraints, problems are : Problem set: 0 solved, 143 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34468ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 34468ms
[2025-06-08 00:39:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:39:48] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-08 00:39:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:39:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:39:48] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 00:39:48] [INFO ] Redundant transitions in 4 ms returned []
Running 143 sub problems to find dead transitions.
[2025-06-08 00:39:48] [INFO ] Invariant cache hit.
[2025-06-08 00:39:48] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 2/89 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 183/272 variables, 89/112 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:39:52] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 153 constraints, problems are : Problem set: 0 solved, 143 unsolved in 14778 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 2/89 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 183/272 variables, 89/113 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 143/296 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 272/272 variables, and 296 constraints, problems are : Problem set: 0 solved, 143 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44835ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 44836ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/90 places, 183/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79787 ms. Remains : 89/90 places, 183/184 transitions.
Computed a total of 4 stabilizing places and 41 stable transitions
Computed a total of 4 stabilizing places and 41 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 34 ms :[(NOT p1)]
RANDOM walk for 24665 steps (70 resets) in 40 ms. (601 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 93 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 p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1712 reset in 211 ms.
Product exploration explored 100000 steps with 1629 reset in 235 ms.
Built C files in :
/tmp/ltsmin9842332455117585890
[2025-06-08 00:40:34] [INFO ] Computing symmetric may disable matrix : 183 transitions.
[2025-06-08 00:40:34] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:40:34] [INFO ] Computing symmetric may enable matrix : 183 transitions.
[2025-06-08 00:40:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:40:34] [INFO ] Computing Do-Not-Accords matrix : 183 transitions.
[2025-06-08 00:40:34] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:40:34] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9842332455117585890
Running compilation step : cd /tmp/ltsmin9842332455117585890;'/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 358 ms.
Running link step : cd /tmp/ltsmin9842332455117585890;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9842332455117585890;'/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/stateBased16372398872200565491.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 183/183 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 88 transition count 182
Applied a total of 2 rules in 20 ms. Remains 88 /89 variables (removed 1) and now considering 182/183 (removed 1) transitions.
Running 142 sub problems to find dead transitions.
// Phase 1: matrix 182 rows 88 cols
[2025-06-08 00:40:49] [INFO ] Computed 23 invariants in 4 ms
[2025-06-08 00:40:49] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:40:54] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:41:02] [INFO ] Deduced a trap along path composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/270 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/270 variables, and 153 constraints, problems are : Problem set: 0 solved, 142 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 182/270 variables, 88/112 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 142/294 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 40077ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 40077ms
[2025-06-08 00:41:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:41:29] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-08 00:41:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:41:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:41:30] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 00:41:30] [INFO ] Redundant transitions in 2 ms returned []
Running 142 sub problems to find dead transitions.
[2025-06-08 00:41:30] [INFO ] Invariant cache hit.
[2025-06-08 00:41:30] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:41:35] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:41:43] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/270 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:41:50] [INFO ] Deduced a trap along path composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/270 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:41:57] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 4 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/270 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/270 variables, and 155 constraints, problems are : Problem set: 0 solved, 142 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 182/270 variables, 88/113 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 142/295 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 60075ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/89 places, 182/183 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100620 ms. Remains : 88/89 places, 182/183 transitions.
Built C files in :
/tmp/ltsmin1817620691593056283
[2025-06-08 00:42:30] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2025-06-08 00:42:30] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:42:30] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2025-06-08 00:42:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:42:30] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2025-06-08 00:42:30] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:42:30] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1817620691593056283
Running compilation step : cd /tmp/ltsmin1817620691593056283;'/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 359 ms.
Running link step : cd /tmp/ltsmin1817620691593056283;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1817620691593056283;'/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/stateBased7918114809233104406.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 00:42:45] [INFO ] Flatten gal took : 9 ms
[2025-06-08 00:42:45] [INFO ] Flatten gal took : 10 ms
[2025-06-08 00:42:45] [INFO ] Time to serialize gal into /tmp/LTL3740279499444621567.gal : 2 ms
[2025-06-08 00:42:45] [INFO ] Time to serialize properties into /tmp/LTL12477448270252466187.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3740279499444621567.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17293165806459829840.hoa' '-atoms' '/tmp/LTL12477448270252466187.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12477448270252466187.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17293165806459829840.hoa
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, t29, t30, t32, t34, t3...940
Computing Next relation with stutter on 1.91268e+06 deadlock states
Detected timeout of ITS tools.
[2025-06-08 00:43:00] [INFO ] Flatten gal took : 9 ms
[2025-06-08 00:43:00] [INFO ] Flatten gal took : 9 ms
[2025-06-08 00:43:00] [INFO ] Time to serialize gal into /tmp/LTL3707880580719772447.gal : 2 ms
[2025-06-08 00:43:00] [INFO ] Time to serialize properties into /tmp/LTL18395379319928964607.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3707880580719772447.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18395379319928964607.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((pl_robber_here_n17<1)||(pl_incoming_cops_n17<1))")))||("(((pl_start_cops>=1)&&(pl_cops_n7>=1))&&(pl_robber_absent_n7>=1...163
Formula 0 simplified : XX(!"(((pl_start_cops>=1)&&(pl_cops_n7>=1))&&(pl_robber_absent_n7>=1))" & GF!"((pl_robber_here_n17<1)||(pl_incoming_cops_n17<1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, t29, t30, t32, t34...824
Detected timeout of ITS tools.
[2025-06-08 00:43:15] [INFO ] Flatten gal took : 15 ms
[2025-06-08 00:43:15] [INFO ] Applying decomposition
[2025-06-08 00:43:15] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13463478983529615020.txt' '-o' '/tmp/graph13463478983529615020.bin' '-w' '/tmp/graph13463478983529615020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13463478983529615020.bin' '-l' '-1' '-v' '-w' '/tmp/graph13463478983529615020.weights' '-q' '0' '-e' '0.001'
[2025-06-08 00:43:15] [INFO ] Decomposing Gal with order
[2025-06-08 00:43:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 00:43:15] [INFO ] Removed a total of 239 redundant transitions.
[2025-06-08 00:43:15] [INFO ] Flatten gal took : 50 ms
[2025-06-08 00:43:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 11 ms.
[2025-06-08 00:43:15] [INFO ] Time to serialize gal into /tmp/LTL5380524456787679510.gal : 4 ms
[2025-06-08 00:43:15] [INFO ] Time to serialize properties into /tmp/LTL5393626556564728824.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5380524456787679510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5393626556564728824.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((i6.u21.pl_robber_here_n17<1)||(i6.u22.pl_incoming_cops_n17<1))")))||("(((u3.pl_start_cops>=1)&&(u3.pl_cops_n7>=1))&&(i3...193
Formula 0 simplified : XX(!"(((u3.pl_start_cops>=1)&&(u3.pl_cops_n7>=1))&&(i3.i0.u11.pl_robber_absent_n7>=1))" & GF!"((i6.u21.pl_robber_here_n17<1)||(i6.u2...183
Detected timeout of ITS tools.
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLFireability-07 finished in 344646 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 X(!p1)))'
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 184/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Running 144 sub problems to find dead transitions.
// Phase 1: matrix 184 rows 90 cols
[2025-06-08 00:43:30] [INFO ] Computed 23 invariants in 2 ms
[2025-06-08 00:43:30] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 153 constraints, problems are : Problem set: 0 solved, 144 unsolved in 13392 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:44:00] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 298 constraints, problems are : Problem set: 0 solved, 144 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33448ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 33449ms
[2025-06-08 00:44:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:44:04] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-08 00:44:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:44:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:44:04] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-08 00:44:04] [INFO ] Invariant cache hit.
[2025-06-08 00:44:04] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:44:14] [INFO ] Deduced a trap along path composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 154 constraints, problems are : Problem set: 0 solved, 144 unsolved in 18177 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
SMT process timed out in 48228ms, After SMT, problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 48229ms
Finished structural reductions in LTL mode , in 1 iterations and 82167 ms. Remains : 90/90 places, 184/184 transitions.
Stuttering acceptance computed with spot in 177 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Computed a total of 4 stabilizing places and 41 stable transitions
Computed a total of 4 stabilizing places and 41 stable transitions
Detected a total of 4/90 stabilizing places and 41/184 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLFireability-08 finished in 82746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)&&F(p2)&&p0))))'
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 184/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Running 144 sub problems to find dead transitions.
[2025-06-08 00:44:53] [INFO ] Invariant cache hit.
[2025-06-08 00:44:53] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:45:03] [INFO ] Deduced a trap along path composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 154 constraints, problems are : Problem set: 0 solved, 144 unsolved in 18206 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
SMT process timed out in 38256ms, After SMT, problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 38256ms
[2025-06-08 00:45:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:45:31] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-08 00:45:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:45:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:45:32] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-08 00:45:32] [INFO ] Invariant cache hit.
[2025-06-08 00:45:32] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:45:42] [INFO ] Deduced a trap along path composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 154 constraints, problems are : Problem set: 0 solved, 144 unsolved in 18066 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
SMT process timed out in 48117ms, After SMT, problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 48118ms
Finished structural reductions in LTL mode , in 1 iterations and 86958 ms. Remains : 90/90 places, 184/184 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (AND p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLFireability-09 finished in 87171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (F(!p1)||X(X(X(!p2)))))))'
Support contains 7 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 184/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Running 144 sub problems to find dead transitions.
[2025-06-08 00:46:20] [INFO ] Invariant cache hit.
[2025-06-08 00:46:20] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:46:30] [INFO ] Deduced a trap along path composed of 6 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 154 constraints, problems are : Problem set: 0 solved, 144 unsolved in 18262 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
SMT process timed out in 38306ms, After SMT, problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 38307ms
[2025-06-08 00:46:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:46:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-08 00:46:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:46:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:46:59] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-08 00:46:59] [INFO ] Invariant cache hit.
[2025-06-08 00:46:59] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:47:09] [INFO ] Deduced a trap along path composed of 6 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 154 constraints, problems are : Problem set: 0 solved, 144 unsolved in 18116 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
SMT process timed out in 48171ms, After SMT, problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 48172ms
Finished structural reductions in LTL mode , in 1 iterations and 87040 ms. Remains : 90/90 places, 184/184 transitions.
Stuttering acceptance computed with spot in 474 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLFireability-10
Product exploration explored 100000 steps with 20041 reset in 259 ms.
Stuttering criterion allowed to conclude after 16395 steps with 3294 reset in 32 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLFireability-10 finished in 87826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X((X(!p1) U (X(G(!p1))||(!p2&&X(!p1)))))))))'
Support contains 8 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 184/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Running 144 sub problems to find dead transitions.
[2025-06-08 00:47:48] [INFO ] Invariant cache hit.
[2025-06-08 00:47:48] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:47:58] [INFO ] Deduced a trap along path composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 154 constraints, problems are : Problem set: 0 solved, 144 unsolved in 17979 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
SMT process timed out in 38023ms, After SMT, problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 38023ms
[2025-06-08 00:48:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:48:26] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-08 00:48:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:48:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:48:26] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-08 00:48:26] [INFO ] Invariant cache hit.
[2025-06-08 00:48:26] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:48:36] [INFO ] Deduced a trap along path composed of 6 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 154 constraints, problems are : Problem set: 0 solved, 144 unsolved in 18193 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
SMT process timed out in 48230ms, After SMT, problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 48231ms
Finished structural reductions in LTL mode , in 1 iterations and 86541 ms. Remains : 90/90 places, 184/184 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), p1, p1]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLFireability-11
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLFireability-11 finished in 86854 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||G(!p1)))))'
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 184/184 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 90 transition count 183
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 88 transition count 182
Applied a total of 4 rules in 16 ms. Remains 88 /90 variables (removed 2) and now considering 182/184 (removed 2) transitions.
Running 142 sub problems to find dead transitions.
// Phase 1: matrix 182 rows 88 cols
[2025-06-08 00:49:15] [INFO ] Computed 23 invariants in 2 ms
[2025-06-08 00:49:15] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:49:20] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:49:28] [INFO ] Deduced a trap along path composed of 5 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/270 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/270 variables, and 153 constraints, problems are : Problem set: 0 solved, 142 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 182/270 variables, 88/112 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 142/294 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 40069ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 40069ms
[2025-06-08 00:49:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:49:55] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-08 00:49:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:49:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:49:56] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 00:49:56] [INFO ] Redundant transitions in 2 ms returned []
Running 142 sub problems to find dead transitions.
[2025-06-08 00:49:56] [INFO ] Invariant cache hit.
[2025-06-08 00:49:56] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:50:01] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:50:09] [INFO ] Deduced a trap along path composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/270 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:50:16] [INFO ] Deduced a trap along path composed of 5 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/270 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:50:23] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/270 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/270 variables, and 155 constraints, problems are : Problem set: 0 solved, 142 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 182/270 variables, 88/113 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 142/295 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 60082ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/90 places, 182/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100652 ms. Remains : 88/90 places, 182/184 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLFireability-14
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLFireability-14 finished in 100740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((((F(!p1)&&(!p2||F(G(!p3)))) U (G((F(!p1)&&(!p2||F(G(!p3)))))||(!p2&&F(!p1))))||p0))))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 184/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Running 144 sub problems to find dead transitions.
// Phase 1: matrix 184 rows 90 cols
[2025-06-08 00:50:56] [INFO ] Computed 23 invariants in 3 ms
[2025-06-08 00:50:56] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 153 constraints, problems are : Problem set: 0 solved, 144 unsolved in 13576 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 297 constraints, problems are : Problem set: 0 solved, 144 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33630ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 33631ms
[2025-06-08 00:51:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:51:29] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-08 00:51:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:51:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 00:51:30] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-08 00:51:30] [INFO ] Invariant cache hit.
[2025-06-08 00:51:30] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:51:39] [INFO ] Deduced a trap along path composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 154 constraints, problems are : Problem set: 0 solved, 144 unsolved in 18393 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
SMT process timed out in 48441ms, After SMT, problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 48442ms
Finished structural reductions in LTL mode , in 1 iterations and 82505 ms. Remains : 90/90 places, 184/184 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) p2 p3) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2 p3) (AND (NOT p0) p1)), p1, p3, (AND p0 p1)]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLFireability-15
Product exploration explored 100000 steps with 1673 reset in 199 ms.
Product exploration explored 100000 steps with 1697 reset in 223 ms.
Computed a total of 4 stabilizing places and 41 stable transitions
Computed a total of 4 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p3)))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 225 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) p2 p3) (AND (NOT p0) p1)), p1, p3, (AND p0 p1)]
RANDOM walk for 40006 steps (94 resets) in 78 ms. (506 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (176 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (48 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
[2025-06-08 00:52:19] [INFO ] Invariant cache hit.
[2025-06-08 00:52:19] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/35 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 16/51 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 146/198 variables, 52/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 2/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 76/274 variables, 38/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 38/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/274 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 153 constraints, problems are : Problem set: 1 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/33 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/51 variables, 18/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 146/198 variables, 52/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 2/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 76/274 variables, 38/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 38/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 274/274 variables, and 154 constraints, problems are : Problem set: 2 solved, 0 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 470ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p3))), (G (OR p0 (NOT p2))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p3), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 12 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLFireability-15 finished in 84204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(p1))))))'
[2025-06-08 00:52:20] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9060380545392012157
[2025-06-08 00:52:20] [INFO ] Computing symmetric may disable matrix : 184 transitions.
[2025-06-08 00:52:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:52:20] [INFO ] Applying decomposition
[2025-06-08 00:52:20] [INFO ] Computing symmetric may enable matrix : 184 transitions.
[2025-06-08 00:52:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:52:20] [INFO ] Flatten gal took : 9 ms
[2025-06-08 00:52:20] [INFO ] Computing Do-Not-Accords matrix : 184 transitions.
[2025-06-08 00:52:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:52:20] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9060380545392012157
Running compilation step : cd /tmp/ltsmin9060380545392012157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14971463791302004837.txt' '-o' '/tmp/graph14971463791302004837.bin' '-w' '/tmp/graph14971463791302004837.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14971463791302004837.bin' '-l' '-1' '-v' '-w' '/tmp/graph14971463791302004837.weights' '-q' '0' '-e' '0.001'
[2025-06-08 00:52:20] [INFO ] Decomposing Gal with order
[2025-06-08 00:52:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 00:52:20] [INFO ] Removed a total of 237 redundant transitions.
[2025-06-08 00:52:20] [INFO ] Flatten gal took : 20 ms
[2025-06-08 00:52:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 7 ms.
[2025-06-08 00:52:20] [INFO ] Time to serialize gal into /tmp/LTLFireability14323353752456626790.gal : 3 ms
[2025-06-08 00:52:20] [INFO ] Time to serialize properties into /tmp/LTLFireability15638624000053037273.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14323353752456626790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15638624000053037273.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X(("(((i1.u3.pl_start_cops>=1)&&(i1.u0.pl_cops_n7>=1))&&(i2.i0.u12.pl_robber_absent_n7>=1))")||(F(G("((i3.i1.u22.pl_robber_here_n...201
Formula 0 simplified : XX(!"(((i1.u3.pl_start_cops>=1)&&(i1.u0.pl_cops_n7>=1))&&(i2.i0.u12.pl_robber_absent_n7>=1))" & GF!"((i3.i1.u22.pl_robber_here_n17<1...191
Compilation finished in 385 ms.
Running link step : cd /tmp/ltsmin9060380545392012157;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9060380545392012157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((LTLAPp0==true)||<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: LTL layer: formula: X(X(((LTLAPp0==true)||<>([]((LTLAPp1==true))))))
pins2lts-mc-linux64( 5/ 8), 0.003: "X(X(((LTLAPp0==true)||<>([]((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: There are 187 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.029: State length is 91, there are 192 groups
pins2lts-mc-linux64( 0/ 8), 0.029: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.029: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.029: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.029: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.052: [Blue] ~15 levels ~960 states ~3640 transitions
pins2lts-mc-linux64( 7/ 8), 0.061: [Blue] ~15 levels ~1920 states ~6784 transitions
pins2lts-mc-linux64( 7/ 8), 0.078: [Blue] ~15 levels ~3840 states ~12480 transitions
pins2lts-mc-linux64( 7/ 8), 0.116: [Blue] ~16 levels ~7680 states ~23792 transitions
pins2lts-mc-linux64( 7/ 8), 0.189: [Blue] ~16 levels ~15360 states ~50192 transitions
pins2lts-mc-linux64( 7/ 8), 0.379: [Blue] ~810 levels ~30720 states ~96736 transitions
pins2lts-mc-linux64( 5/ 8), 0.704: [Blue] ~2944 levels ~61440 states ~157816 transitions
pins2lts-mc-linux64( 5/ 8), 1.205: [Blue] ~5572 levels ~122880 states ~347152 transitions
pins2lts-mc-linux64( 5/ 8), 1.937: [Blue] ~9935 levels ~245760 states ~752416 transitions
pins2lts-mc-linux64( 1/ 8), 2.958: [Blue] ~29719 levels ~491520 states ~1359560 transitions
pins2lts-mc-linux64( 2/ 8), 4.551: [Blue] ~31062 levels ~983040 states ~2760384 transitions
pins2lts-mc-linux64( 1/ 8), 7.447: [Blue] ~90614 levels ~1966080 states ~5911760 transitions
pins2lts-mc-linux64( 1/ 8), 13.240: [Blue] ~155078 levels ~3932160 states ~12131096 transitions
pins2lts-mc-linux64( 1/ 8), 25.237: [Blue] ~266710 levels ~7864320 states ~25433672 transitions
pins2lts-mc-linux64( 0/ 8), 49.177: [Blue] ~519414 levels ~15728640 states ~52009368 transitions
pins2lts-mc-linux64( 0/ 8), 97.416: [Blue] ~894494 levels ~31457280 states ~107618632 transitions
pins2lts-mc-linux64( 0/ 8), 194.686: [Blue] ~1547887 levels ~62914560 states ~224794936 transitions
pins2lts-mc-linux64( 3/ 8), 395.258: [Blue] ~2772742 levels ~125829120 states ~454580000 transitions
pins2lts-mc-linux64( 3/ 8), 438.948: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 438.982:
pins2lts-mc-linux64( 0/ 8), 438.982: Explored 133568276 states 503279422 transitions, fanout: 3.768
pins2lts-mc-linux64( 0/ 8), 438.982: Total exploration time 438.950 sec (438.920 sec minimum, 438.934 sec on average)
pins2lts-mc-linux64( 0/ 8), 438.982: States per second: 304290, Transitions per second: 1146553
pins2lts-mc-linux64( 0/ 8), 438.982:
pins2lts-mc-linux64( 0/ 8), 438.982: State space has 134217397 states, 647481 are accepting
pins2lts-mc-linux64( 0/ 8), 438.982: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 438.983: blue states: 133568276 (99.52%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 438.983: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 438.983: all-red states: 671231 (0.50%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 438.983:
pins2lts-mc-linux64( 0/ 8), 438.983: Total memory used for local state coloring: 334.0MB
pins2lts-mc-linux64( 0/ 8), 438.983:
pins2lts-mc-linux64( 0/ 8), 438.983: Queue width: 8B, total height: 21887989, memory: 166.99MB
pins2lts-mc-linux64( 0/ 8), 438.983: Tree memory: 1116.2MB, 8.7 B/state, compr.: 2.4%
pins2lts-mc-linux64( 0/ 8), 438.983: Tree fill ratio (roots/leafs): 99.0%/36.0%
pins2lts-mc-linux64( 0/ 8), 438.983: Stored 184 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 438.983: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 438.983: Est. total memory use: 1283.2MB (~1191.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9060380545392012157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((LTLAPp0==true)||<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9060380545392012157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((LTLAPp0==true)||<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t10, t14, t15, t19, t24, t25, t27, t29, t35, t39, t44, t45, t50, t55, t60, t6...744
Computing Next relation with stutter on 1.91268e+06 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
72935 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,729.371,7006416,1,0,2.69833e+06,7.84949e+06,1581,2.32149e+07,509,8.35159e+07,532482
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 2339694 ms.
BK_STOP 1749344958692
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CopsAndRobbers-PT-HRL020X006"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CopsAndRobbers-PT-HRL020X006, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339500220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-HRL020X006.tgz
mv CopsAndRobbers-PT-HRL020X006 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;