About the Execution of ITS-Tools for CopsAndRobbers-PT-KFL084N009K003X002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14268.119 | 2344399.00 | 3649905.00 | 75054.00 | FFTTFFFFFFTFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967800540.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is CopsAndRobbers-PT-KFL084N009K003X002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967800540
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 7.7K Mar 6 13:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 6 13:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 6 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 6 13:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Mar 6 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 6 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 6 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 08:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 19 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 3 18:30 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-KFL084N009K003X002-LTLFireability-00
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-01
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-02
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-03
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-04
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-05
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-06
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-07
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-08
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-09
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-10
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-11
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-12
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-13
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-14
FORMULA_NAME CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779539040026
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-KFL084N009K003X002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 12:24:01] [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]
[2026-05-23 12:24:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 12:24:01] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2026-05-23 12:24:01] [INFO ] Transformed 426 places.
[2026-05-23 12:24:01] [INFO ] Transformed 3615 transitions.
[2026-05-23 12:24:01] [INFO ] Parsed PT model containing 426 places and 3615 transitions and 21342 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 3615/3615 transitions.
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 342 transition count 3615
Applied a total of 84 rules in 68 ms. Remains 342 /426 variables (removed 84) and now considering 3615/3615 (removed 0) transitions.
Running 3575 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12271231715990508560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13544011779690609644.kers'
[2026-05-23 12:24:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12271231715990508560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13544011779690609644.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 2 ms.
// Phase 1: matrix 3615 rows 258 cols 13950 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-23 12:24:01] [INFO ] Computed 86 invariants in 15 ms
Computed 86 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-13544011779690609644.kers
Total runtime 18 ms.
[2026-05-23 12:24:02] [INFO ] State equation strengthened by 187 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/3957 variables, and 86 constraints, problems are : Problem set: 0 solved, 3575 unsolved in 22230 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/342 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3575/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/3957 variables, and 86 constraints, problems are : Problem set: 0 solved, 3575 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/342 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3322/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47601ms problems are : Problem set: 0 solved, 3575 unsolved
Search for dead transitions found 0 dead transitions in 47648ms
[2026-05-23 12:24:49] [INFO ] Invariant cache hit.
[2026-05-23 12:24:51] [INFO ] Implicit Places using invariants in 2163 ms returned []
[2026-05-23 12:24:51] [INFO ] Invariant cache hit.
[2026-05-23 12:24:52] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:25:11] [INFO ] Implicit Places using invariants and state equation in 20236 ms returned []
Implicit Place search using SMT with State Equation took 22419 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 342/426 places, 3615/3615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70219 ms. Remains : 342/426 places, 3615/3615 transitions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 3615/3615 transitions.
Applied a total of 0 rules in 21 ms. Remains 342 /342 variables (removed 0) and now considering 3615/3615 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 12:25:12] [INFO ] Invariant cache hit.
[2026-05-23 12:25:13] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2026-05-23 12:25:13] [INFO ] Invariant cache hit.
[2026-05-23 12:25:13] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:25:33] [INFO ] Implicit Places using invariants and state equation in 20212 ms returned []
Implicit Place search using SMT with State Equation took 21307 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 21330 ms. Remains : 342/342 places, 3615/3615 transitions.
Support contains 61 out of 342 places after structural reductions.
[2026-05-23 12:25:35] [INFO ] Flatten gal took : 255 ms
[2026-05-23 12:25:35] [INFO ] Flatten gal took : 140 ms
[2026-05-23 12:25:35] [INFO ] Input system was already deterministic with 3615 transitions.
Support contains 59 out of 342 places (down from 61) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 29
RANDOM walk for 40000 steps (192 resets) in 3660 ms. (10 steps per ms) remains 2/29 properties
BEST_FIRST walk for 40004 steps (339 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (13 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
[2026-05-23 12:25:36] [INFO ] Invariant cache hit.
[2026-05-23 12:25:37] [INFO ] State equation strengthened by 187 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 88/98 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 79/177 variables, 79/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3450/3627 variables, 177/263 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3627 variables, 24/287 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3627 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 330/3957 variables, 165/452 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3957 variables, 163/615 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3957 variables, 0/615 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/3957 variables, 0/615 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3957/3957 variables, and 615 constraints, problems are : Problem set: 1 solved, 1 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 342/342 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
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) 89/94 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/176 variables, 82/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3449/3625 variables, 176/262 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3625 variables, 23/285 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3625 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 332/3957 variables, 166/451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3957/3957 variables, and 615 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 342/342 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2611ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 3615/3615 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 342 transition count 3614
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 341 transition count 3614
Applied a total of 2 rules in 235 ms. Remains 341 /342 variables (removed 1) and now considering 3614/3615 (removed 1) transitions.
Running 3574 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17796377653112904740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8117313099950292103.kers'
[2026-05-23 12:25:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17796377653112904740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8117313099950292103.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 1 ms.
// Phase 1: matrix 3614 rows 257 cols 13948 entries
Finished phase 1 with 255 SingleSign rule and 0 generalized
[2026-05-23 12:25:39] [INFO ] Computed 86 invariants in 13 ms
Computed 86 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-8117313099950292103.kers
Total runtime 17 ms.
[2026-05-23 12:25:39] [INFO ] State equation strengthened by 187 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/3955 variables, and 86 constraints, problems are : Problem set: 0 solved, 3574 unsolved in 20073 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/341 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3574/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3574 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/3955 variables, and 86 constraints, problems are : Problem set: 0 solved, 3574 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/341 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3322/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45363ms problems are : Problem set: 0 solved, 3574 unsolved
Search for dead transitions found 0 dead transitions in 45372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45619 ms. Remains : 341/342 places, 3614/3615 transitions.
RANDOM walk for 40000 steps (213 resets) in 1746 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (341 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 287586 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 287586 steps, saw 126854 distinct states, run finished after 3004 ms. (steps per millisecond=95 ) properties seen :0
[2026-05-23 12:26:28] [INFO ] Invariant cache hit.
[2026-05-23 12:26:28] [INFO ] State equation strengthened by 187 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 88/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/175 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3448/3623 variables, 175/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3623 variables, 23/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3623 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 332/3955 variables, 166/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3955 variables, 164/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3955 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/3955 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3955/3955 variables, and 614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 341/341 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 88/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/175 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3448/3623 variables, 175/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3623 variables, 23/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3623 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 332/3955 variables, 166/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3955 variables, 164/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3955 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/3955 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3955/3955 variables, and 614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 341/341 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2190ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 5 out of 341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 3614/3614 transitions.
Applied a total of 0 rules in 77 ms. Remains 341 /341 variables (removed 0) and now considering 3614/3614 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 341/341 places, 3614/3614 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 3614/3614 transitions.
Applied a total of 0 rules in 91 ms. Remains 341 /341 variables (removed 0) and now considering 3614/3614 (removed 0) transitions.
[2026-05-23 12:26:31] [INFO ] Invariant cache hit.
[2026-05-23 12:26:32] [INFO ] Implicit Places using invariants in 1453 ms returned []
[2026-05-23 12:26:32] [INFO ] Invariant cache hit.
[2026-05-23 12:26:33] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:26:55] [INFO ] Implicit Places using invariants and state equation in 22991 ms returned []
Implicit Place search using SMT with State Equation took 24447 ms to find 0 implicit places.
[2026-05-23 12:26:55] [INFO ] Redundant transitions in 265 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24810 ms. Remains : 341/341 places, 3614/3614 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 166 transitions
Reduce isomorphic transitions removed 166 transitions.
Iterating post reduction 0 with 166 rules applied. Total rules applied 166 place count 341 transition count 3448
Applied a total of 166 rules in 188 ms. Remains 341 /341 variables (removed 0) and now considering 3448/3614 (removed 166) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-341385398844343205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10317410408481819844.kers'
[2026-05-23 12:26:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-341385398844343205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10317410408481819844.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 3 ms.
// Phase 1: matrix 3448 rows 257 cols 13782 entries
Finished phase 1 with 255 SingleSign rule and 0 generalized
[2026-05-23 12:26:56] [INFO ] Computed 86 invariants in 12 ms
Computed 86 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-10317410408481819844.kers
Total runtime 15 ms.
[2026-05-23 12:26:56] [INFO ] [Real]Absence check using 86 positive place invariants in 16 ms returned sat
[2026-05-23 12:26:56] [INFO ] After 863ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 12:26:57] [INFO ] [Nat]Absence check using 86 positive place invariants in 12 ms returned sat
[2026-05-23 12:26:57] [INFO ] After 657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 12:26:57] [INFO ] After 770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 12:26:57] [INFO ] After 899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1993 ms.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((F(p1)||(X(X(F(p2)))&&(p0 U p3)))))))'
Support contains 9 out of 342 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 3615/3615 transitions.
Applied a total of 0 rules in 9 ms. Remains 342 /342 variables (removed 0) and now considering 3615/3615 (removed 0) transitions.
Running 3575 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1348331549136188093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10853139342232861450.kers'
[2026-05-23 12:26:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1348331549136188093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10853139342232861450.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 1 ms.
// Phase 1: matrix 3615 rows 258 cols 13950 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-23 12:26:58] [INFO ] Computed 86 invariants in 11 ms
Computed 86 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-10853139342232861450.kers
Total runtime 13 ms.
[2026-05-23 12:26:58] [INFO ] State equation strengthened by 187 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/3957 variables, and 86 constraints, problems are : Problem set: 0 solved, 3575 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/342 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3575/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/3957 variables, and 86 constraints, problems are : Problem set: 0 solved, 3575 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/342 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3322/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45512ms problems are : Problem set: 0 solved, 3575 unsolved
Search for dead transitions found 0 dead transitions in 45521ms
[2026-05-23 12:27:43] [INFO ] Invariant cache hit.
[2026-05-23 12:27:45] [INFO ] Implicit Places using invariants in 1264 ms returned []
[2026-05-23 12:27:45] [INFO ] Invariant cache hit.
[2026-05-23 12:27:45] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:28:07] [INFO ] Implicit Places using invariants and state equation in 22325 ms returned []
Implicit Place search using SMT with State Equation took 23591 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 69134 ms. Remains : 342/342 places, 3615/3615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((F(p1)||(X(X(F(p2)))&&(p0 U p3)))))))'
Stuttering acceptance computed with spot in 484 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2) p3) (AND p0 (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-00
Stuttering criterion allowed to conclude after 84 steps with 1 reset in 12 ms.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-00 finished in 69772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X((F((G(p2)&&X(p3)))&&p1)))))))'
Support contains 8 out of 342 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 3615/3615 transitions.
Applied a total of 0 rules in 17 ms. Remains 342 /342 variables (removed 0) and now considering 3615/3615 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 12:28:08] [INFO ] Invariant cache hit.
[2026-05-23 12:28:08] [INFO ] Implicit Places using invariants in 769 ms returned []
[2026-05-23 12:28:08] [INFO ] Invariant cache hit.
[2026-05-23 12:28:09] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:28:29] [INFO ] Implicit Places using invariants and state equation in 20927 ms returned []
Implicit Place search using SMT with State Equation took 21698 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 21716 ms. Remains : 342/342 places, 3615/3615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X((F((G(p1)&&X(p2)))&&p0)))||p3))))'
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-01
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-01 finished in 22104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 7 out of 342 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 3615/3615 transitions.
Applied a total of 0 rules in 16 ms. Remains 342 /342 variables (removed 0) and now considering 3615/3615 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 12:28:30] [INFO ] Invariant cache hit.
[2026-05-23 12:28:31] [INFO ] Implicit Places using invariants in 1334 ms returned []
[2026-05-23 12:28:31] [INFO ] Invariant cache hit.
[2026-05-23 12:28:32] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:28:54] [INFO ] Implicit Places using invariants and state equation in 23019 ms returned []
Implicit Place search using SMT with State Equation took 24357 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 24373 ms. Remains : 342/342 places, 3615/3615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-04
Stuttering criterion allowed to conclude after 202 steps with 0 reset in 18 ms.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-04 finished in 24538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 342 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 342/342 places, 3615/3615 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 341 transition count 3614
Applied a total of 2 rules in 418 ms. Remains 341 /342 variables (removed 1) and now considering 3614/3615 (removed 1) transitions.
Running 3574 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12839672864786051746.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7611134477992669921.kers'
[2026-05-23 12:28:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12839672864786051746.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7611134477992669921.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 2 ms.
// Phase 1: matrix 3614 rows 257 cols 13948 entries
Finished phase 1 with 255 SingleSign rule and 0 generalized
[2026-05-23 12:28:55] [INFO ] Computed 86 invariants in 11 ms
Computed 86 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-7611134477992669921.kers
Total runtime 15 ms.
[2026-05-23 12:28:55] [INFO ] State equation strengthened by 187 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/3955 variables, and 86 constraints, problems are : Problem set: 0 solved, 3574 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/341 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3574/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/3955 variables, and 86 constraints, problems are : Problem set: 0 solved, 3574 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/341 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3321/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45401ms problems are : Problem set: 0 solved, 3574 unsolved
Search for dead transitions found 0 dead transitions in 45409ms
[2026-05-23 12:29:40] [INFO ] Invariant cache hit.
[2026-05-23 12:29:41] [INFO ] Implicit Places using invariants in 757 ms returned []
[2026-05-23 12:29:41] [INFO ] Invariant cache hit.
[2026-05-23 12:29:41] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:30:03] [INFO ] Implicit Places using invariants and state equation in 22197 ms returned []
Implicit Place search using SMT with State Equation took 22958 ms to find 0 implicit places.
[2026-05-23 12:30:03] [INFO ] Redundant transitions in 241 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 341/342 places, 3614/3615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69041 ms. Remains : 341/342 places, 3614/3615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-05
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-05 finished in 69113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 342 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 3615/3615 transitions.
Applied a total of 0 rules in 10 ms. Remains 342 /342 variables (removed 0) and now considering 3615/3615 (removed 0) transitions.
Running 3575 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10695156675893491991.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17418654733683872585.kers'
[2026-05-23 12:30:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10695156675893491991.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17418654733683872585.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 5 ms.
// Phase 1: matrix 3615 rows 258 cols 13950 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-23 12:30:03] [INFO ] Computed 86 invariants in 19 ms
Computed 86 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-17418654733683872585.kers
Total runtime 22 ms.
[2026-05-23 12:30:03] [INFO ] State equation strengthened by 187 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/3957 variables, and 86 constraints, problems are : Problem set: 0 solved, 3575 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/342 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3575/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3575 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/3957 variables, and 86 constraints, problems are : Problem set: 0 solved, 3575 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/342 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3322/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45349ms problems are : Problem set: 0 solved, 3575 unsolved
Search for dead transitions found 0 dead transitions in 45356ms
[2026-05-23 12:30:49] [INFO ] Invariant cache hit.
[2026-05-23 12:30:49] [INFO ] Implicit Places using invariants in 672 ms returned []
[2026-05-23 12:30:49] [INFO ] Invariant cache hit.
[2026-05-23 12:30:50] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:31:11] [INFO ] Implicit Places using invariants and state equation in 21815 ms returned []
Implicit Place search using SMT with State Equation took 22491 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 67866 ms. Remains : 342/342 places, 3615/3615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-08
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 2 ms.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-08 finished in 68034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 342 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 342/342 places, 3615/3615 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 341 transition count 3614
Applied a total of 2 rules in 350 ms. Remains 341 /342 variables (removed 1) and now considering 3614/3615 (removed 1) transitions.
Running 3574 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3068228240133297633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4806215571405090050.kers'
[2026-05-23 12:31:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3068228240133297633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4806215571405090050.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 2 ms.
// Phase 1: matrix 3614 rows 257 cols 13948 entries
Finished phase 1 with 255 SingleSign rule and 0 generalized
[2026-05-23 12:31:12] [INFO ] Computed 86 invariants in 12 ms
Computed 86 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-4806215571405090050.kers
Total runtime 18 ms.
[2026-05-23 12:31:12] [INFO ] State equation strengthened by 187 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/3955 variables, and 86 constraints, problems are : Problem set: 0 solved, 3574 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/341 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3574/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/3955 variables, and 86 constraints, problems are : Problem set: 0 solved, 3574 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/341 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3321/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45202ms problems are : Problem set: 0 solved, 3574 unsolved
Search for dead transitions found 0 dead transitions in 45209ms
[2026-05-23 12:31:57] [INFO ] Invariant cache hit.
[2026-05-23 12:31:58] [INFO ] Implicit Places using invariants in 837 ms returned []
[2026-05-23 12:31:58] [INFO ] Invariant cache hit.
[2026-05-23 12:31:58] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:32:21] [INFO ] Implicit Places using invariants and state equation in 22861 ms returned []
Implicit Place search using SMT with State Equation took 23703 ms to find 0 implicit places.
[2026-05-23 12:32:21] [INFO ] Redundant transitions in 139 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 341/342 places, 3614/3615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69415 ms. Remains : 341/342 places, 3614/3615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-09
Product exploration explored 100000 steps with 688 reset in 3080 ms.
Product exploration explored 100000 steps with 687 reset in 3099 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 5 factoid took 44 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 1735 steps (7 resets) in 90 ms. (19 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 62 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 299 ms.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 3614/3614 transitions.
Applied a total of 0 rules in 307 ms. Remains 341 /341 variables (removed 0) and now considering 3614/3614 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 12:32:28] [INFO ] Invariant cache hit.
[2026-05-23 12:32:29] [INFO ] Implicit Places using invariants in 843 ms returned []
[2026-05-23 12:32:29] [INFO ] Invariant cache hit.
[2026-05-23 12:32:29] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:32:51] [INFO ] Implicit Places using invariants and state equation in 22767 ms returned []
Implicit Place search using SMT with State Equation took 23616 ms to find 0 implicit places.
[2026-05-23 12:32:52] [INFO ] Redundant transitions in 146 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24079 ms. Remains : 341/341 places, 3614/3614 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 5 factoid took 53 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 5443 steps (35 resets) in 275 ms. (19 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 64 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 351 ms.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 667 reset in 3017 ms.
Product exploration explored 100000 steps with 699 reset in 3073 ms.
Built C files in :
/tmp/ltsmin12303192393028182799
[2026-05-23 12:32:58] [INFO ] Too many transitions (3614) to apply POR reductions. Disabling POR matrices.
[2026-05-23 12:32:58] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12303192393028182799
Running compilation step : cd /tmp/ltsmin12303192393028182799;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12303192393028182799;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12303192393028182799;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 3614/3614 transitions.
Applied a total of 0 rules in 307 ms. Remains 341 /341 variables (removed 0) and now considering 3614/3614 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 12:33:02] [INFO ] Invariant cache hit.
[2026-05-23 12:33:03] [INFO ] Implicit Places using invariants in 845 ms returned []
[2026-05-23 12:33:03] [INFO ] Invariant cache hit.
[2026-05-23 12:33:03] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:33:25] [INFO ] Implicit Places using invariants and state equation in 22820 ms returned []
Implicit Place search using SMT with State Equation took 23668 ms to find 0 implicit places.
[2026-05-23 12:33:26] [INFO ] Redundant transitions in 143 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24127 ms. Remains : 341/341 places, 3614/3614 transitions.
Built C files in :
/tmp/ltsmin12758312674836388354
[2026-05-23 12:33:26] [INFO ] Too many transitions (3614) to apply POR reductions. Disabling POR matrices.
[2026-05-23 12:33:26] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12758312674836388354
Running compilation step : cd /tmp/ltsmin12758312674836388354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12758312674836388354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12758312674836388354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 12:33:29] [INFO ] Flatten gal took : 108 ms
[2026-05-23 12:33:29] [INFO ] Flatten gal took : 119 ms
[2026-05-23 12:33:29] [INFO ] Time to serialize gal into /tmp/LTL12662555459397689569.gal : 47 ms
[2026-05-23 12:33:29] [INFO ] Time to serialize properties into /tmp/LTL4845801813081069526.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12662555459397689569.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15775832005012126873.hoa' '-atoms' '/tmp/LTL4845801813081069526.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4845801813081069526.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15775832005012126873.hoa
Detected timeout of ITS tools.
[2026-05-23 12:33:44] [INFO ] Flatten gal took : 78 ms
[2026-05-23 12:33:45] [INFO ] Flatten gal took : 81 ms
[2026-05-23 12:33:45] [INFO ] Time to serialize gal into /tmp/LTL4945962529576131489.gal : 22 ms
[2026-05-23 12:33:45] [INFO ] Time to serialize properties into /tmp/LTL13364292024409123565.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4945962529576131489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13364292024409123565.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(((pl_start_robber<1)||(pl_robber_absent_n29<1))||(pl_robber_here_n61<1))"))&&(F(G("(((pl_start_robber<1)||(pl_robber_here_n1...194
Formula 0 simplified : F(G!"(((pl_start_robber<1)||(pl_robber_absent_n29<1))||(pl_robber_here_n61<1))" | GF!"(((pl_start_robber<1)||(pl_robber_here_n16<1))...184
Detected timeout of ITS tools.
[2026-05-23 12:34:00] [INFO ] Flatten gal took : 70 ms
[2026-05-23 12:34:00] [INFO ] Applying decomposition
[2026-05-23 12:34:00] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6609200063432660804.txt' '-o' '/tmp/graph6609200063432660804.bin' '-w' '/tmp/graph6609200063432660804.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6609200063432660804.bin' '-l' '-1' '-v' '-w' '/tmp/graph6609200063432660804.weights' '-q' '0' '-e' '0.001'
[2026-05-23 12:34:00] [INFO ] Decomposing Gal with order
[2026-05-23 12:34:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 12:34:04] [INFO ] Removed a total of 8357 redundant transitions.
[2026-05-23 12:34:04] [INFO ] Flatten gal took : 3564 ms
[2026-05-23 12:34:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 1848 labels/synchronizations in 275 ms.
[2026-05-23 12:34:04] [INFO ] Time to serialize gal into /tmp/LTL5234600852097066962.gal : 26 ms
[2026-05-23 12:34:04] [INFO ] Time to serialize properties into /tmp/LTL1744835385087720437.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5234600852097066962.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1744835385087720437.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("(((i8.i0.u2.pl_start_robber<1)||(i6.i1.u30.pl_robber_absent_n29<1))||(i8.i0.u62.pl_robber_here_n61<1))"))&&(F(G("(((i8.i0.u2....252
Formula 0 simplified : F(G!"(((i8.i0.u2.pl_start_robber<1)||(i6.i1.u30.pl_robber_absent_n29<1))||(i8.i0.u62.pl_robber_here_n61<1))" | GF!"(((i8.i0.u2.pl_st...242
Detected timeout of ITS tools.
Treatment of property CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-09 finished in 188084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p1 U (p2||G(!p1)))||p0))))'
Support contains 5 out of 342 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 342/342 places, 3615/3615 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 342 transition count 3614
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 341 transition count 3614
Applied a total of 2 rules in 89 ms. Remains 341 /342 variables (removed 1) and now considering 3614/3615 (removed 1) transitions.
Skipped dead transition search.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8045169644508007050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15647401875275167258.kers'
[2026-05-23 12:34:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8045169644508007050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15647401875275167258.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 2 ms.
// Phase 1: matrix 3614 rows 257 cols 13948 entries
Finished phase 1 with 255 SingleSign rule and 0 generalized
[2026-05-23 12:34:20] [INFO ] Computed 86 invariants in 12 ms
Computed 86 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-15647401875275167258.kers
Total runtime 17 ms.
[2026-05-23 12:34:21] [INFO ] Implicit Places using invariants in 1595 ms returned []
[2026-05-23 12:34:21] [INFO ] Invariant cache hit.
[2026-05-23 12:34:22] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:34:44] [INFO ] Implicit Places using invariants and state equation in 22468 ms returned []
Implicit Place search using SMT with State Equation took 24066 ms to find 0 implicit places.
[2026-05-23 12:34:44] [INFO ] Redundant transitions in 148 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 341/342 places, 3614/3615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24316 ms. Remains : 341/342 places, 3614/3615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p1 U (p2||G(!p1)))||p0))))'
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-10
Product exploration explored 100000 steps with 815 reset in 3641 ms.
Product exploration explored 100000 steps with 819 reset in 3726 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 11 factoid took 44 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (261 resets) in 1876 ms. (21 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (22 resets) in 368 ms. (108 steps per ms) remains 1/1 properties
[2026-05-23 12:34:52] [INFO ] Invariant cache hit.
[2026-05-23 12:34:52] [INFO ] State equation strengthened by 187 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 5/3955 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Positive P Invariants (semi-flows): 0/86 constraints, State Equation: 0/341 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 12 factoid took 81 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 902 ms.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 3614/3614 transitions.
Applied a total of 0 rules in 56 ms. Remains 341 /341 variables (removed 0) and now considering 3614/3614 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 12:34:52] [INFO ] Invariant cache hit.
[2026-05-23 12:34:54] [INFO ] Implicit Places using invariants in 1494 ms returned []
[2026-05-23 12:34:54] [INFO ] Invariant cache hit.
[2026-05-23 12:34:54] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:35:16] [INFO ] Implicit Places using invariants and state equation in 22424 ms returned []
Implicit Place search using SMT with State Equation took 23923 ms to find 0 implicit places.
[2026-05-23 12:35:16] [INFO ] Redundant transitions in 142 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24131 ms. Remains : 341/341 places, 3614/3614 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 7 factoid took 46 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 690 steps (6 resets) in 46 ms. (14 steps per ms) remains 0/3 properties
Knowledge based reduction with 7 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 215 ms.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 782 reset in 3610 ms.
Product exploration explored 100000 steps with 792 reset in 3631 ms.
Built C files in :
/tmp/ltsmin13340881238078822382
[2026-05-23 12:35:24] [INFO ] Too many transitions (3614) to apply POR reductions. Disabling POR matrices.
[2026-05-23 12:35:24] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13340881238078822382
Running compilation step : cd /tmp/ltsmin13340881238078822382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13340881238078822382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13340881238078822382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 3614/3614 transitions.
Applied a total of 0 rules in 66 ms. Remains 341 /341 variables (removed 0) and now considering 3614/3614 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 12:35:27] [INFO ] Invariant cache hit.
[2026-05-23 12:35:29] [INFO ] Implicit Places using invariants in 1482 ms returned []
[2026-05-23 12:35:29] [INFO ] Invariant cache hit.
[2026-05-23 12:35:29] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:35:50] [INFO ] Implicit Places using invariants and state equation in 21830 ms returned []
Implicit Place search using SMT with State Equation took 23318 ms to find 0 implicit places.
[2026-05-23 12:35:51] [INFO ] Redundant transitions in 140 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23530 ms. Remains : 341/341 places, 3614/3614 transitions.
Built C files in :
/tmp/ltsmin13969825323049401630
[2026-05-23 12:35:51] [INFO ] Too many transitions (3614) to apply POR reductions. Disabling POR matrices.
[2026-05-23 12:35:51] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13969825323049401630
Running compilation step : cd /tmp/ltsmin13969825323049401630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13969825323049401630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13969825323049401630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 12:35:54] [INFO ] Flatten gal took : 74 ms
[2026-05-23 12:35:54] [INFO ] Flatten gal took : 76 ms
[2026-05-23 12:35:54] [INFO ] Time to serialize gal into /tmp/LTL5263018480760216141.gal : 18 ms
[2026-05-23 12:35:54] [INFO ] Time to serialize properties into /tmp/LTL3685904330615583019.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5263018480760216141.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10717325072577748671.hoa' '-atoms' '/tmp/LTL3685904330615583019.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3685904330615583019.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10717325072577748671.hoa
Detected timeout of ITS tools.
[2026-05-23 12:36:09] [INFO ] Flatten gal took : 72 ms
[2026-05-23 12:36:09] [INFO ] Flatten gal took : 75 ms
[2026-05-23 12:36:09] [INFO ] Time to serialize gal into /tmp/LTL3595675219244156121.gal : 25 ms
[2026-05-23 12:36:09] [INFO ] Time to serialize properties into /tmp/LTL7845642369767632209.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3595675219244156121.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7845642369767632209.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((pl_start_cops<1)||(pl_cops_n1<1))")||(("(pl_robber_absent_n1<1)")||((!("(((pl_start_cops>=1)&&(pl_cops_n1>=1))&&(pl_robber_...404
Formula 0 simplified : FG(!"((pl_start_cops<1)||(pl_cops_n1<1))" & !"(pl_robber_absent_n1<1)" & ("(((pl_start_cops>=1)&&(pl_cops_n1>=1))&&(pl_robber_absent...314
Detected timeout of ITS tools.
[2026-05-23 12:36:24] [INFO ] Flatten gal took : 69 ms
[2026-05-23 12:36:24] [INFO ] Applying decomposition
[2026-05-23 12:36:24] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8308685655714426091.txt' '-o' '/tmp/graph8308685655714426091.bin' '-w' '/tmp/graph8308685655714426091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8308685655714426091.bin' '-l' '-1' '-v' '-w' '/tmp/graph8308685655714426091.weights' '-q' '0' '-e' '0.001'
[2026-05-23 12:36:25] [INFO ] Decomposing Gal with order
[2026-05-23 12:36:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 12:36:27] [INFO ] Removed a total of 6718 redundant transitions.
[2026-05-23 12:36:28] [INFO ] Flatten gal took : 2815 ms
[2026-05-23 12:36:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1848 labels/synchronizations in 142 ms.
[2026-05-23 12:36:28] [INFO ] Time to serialize gal into /tmp/LTL3321958142587726842.gal : 18 ms
[2026-05-23 12:36:28] [INFO ] Time to serialize properties into /tmp/LTL12368482378819603483.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3321958142587726842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12368482378819603483.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u0.pl_start_cops<1)||(u0.pl_cops_n1<1))")||(("(i8.i0.u2.pl_robber_absent_n1<1)")||((!("(((u0.pl_start_cops>=1)&&(u0.pl_cops...477
Formula 0 simplified : FG(!"((u0.pl_start_cops<1)||(u0.pl_cops_n1<1))" & !"(i8.i0.u2.pl_robber_absent_n1<1)" & ("(((u0.pl_start_cops>=1)&&(u0.pl_cops_n1>=1...372
Detected timeout of ITS tools.
Treatment of property CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-10 finished in 143294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(!p0)) U G(p1)) U X(X(p2))))'
Support contains 8 out of 342 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 3615/3615 transitions.
Applied a total of 0 rules in 8 ms. Remains 342 /342 variables (removed 0) and now considering 3615/3615 (removed 0) transitions.
Running 3575 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18393017435209799548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14329852409087628572.kers'
[2026-05-23 12:36:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18393017435209799548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14329852409087628572.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 2 ms.
// Phase 1: matrix 3615 rows 258 cols 13950 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-23 12:36:43] [INFO ] Computed 86 invariants in 14 ms
Computed 86 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-14329852409087628572.kers
Total runtime 17 ms.
[2026-05-23 12:36:43] [INFO ] State equation strengthened by 187 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/3957 variables, and 86 constraints, problems are : Problem set: 0 solved, 3575 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/342 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3575/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/3957 variables, and 86 constraints, problems are : Problem set: 0 solved, 3575 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/342 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3322/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45271ms problems are : Problem set: 0 solved, 3575 unsolved
Search for dead transitions found 0 dead transitions in 45280ms
[2026-05-23 12:37:28] [INFO ] Invariant cache hit.
[2026-05-23 12:37:29] [INFO ] Implicit Places using invariants in 1091 ms returned []
[2026-05-23 12:37:29] [INFO ] Invariant cache hit.
[2026-05-23 12:37:30] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:37:51] [INFO ] Implicit Places using invariants and state equation in 21549 ms returned []
Implicit Place search using SMT with State Equation took 22642 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 67940 ms. Remains : 342/342 places, 3615/3615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(!p0)) U G(p1)) U X(X(p2))))'
Stuttering acceptance computed with spot in 504 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (NOT p2), (AND p0 (NOT p2)), true, (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), p0, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2655 steps with 850 reset in 21 ms.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-11 finished in 68519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (p1||G(!p0))) U (!p2&&F(G(!p3)))))'
Support contains 10 out of 342 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 342/342 places, 3615/3615 transitions.
Applied a total of 0 rules in 62 ms. Remains 342 /342 variables (removed 0) and now considering 3615/3615 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 12:37:51] [INFO ] Invariant cache hit.
[2026-05-23 12:37:52] [INFO ] Implicit Places using invariants in 712 ms returned []
[2026-05-23 12:37:52] [INFO ] Invariant cache hit.
[2026-05-23 12:37:53] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:38:21] [INFO ] Implicit Places using invariants and state equation in 28430 ms returned []
Implicit Place search using SMT with State Equation took 29145 ms to find 0 implicit places.
[2026-05-23 12:38:21] [INFO ] Redundant transitions in 138 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29356 ms. Remains : 342/342 places, 3615/3615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (!p2&&F(G(!p3)))))'
Stuttering acceptance computed with spot in 132 ms :[(OR p2 p3), true, p3, (AND (NOT p1) p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-13
Product exploration explored 100000 steps with 518 reset in 2676 ms.
Product exploration explored 100000 steps with 562 reset in 2714 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 19 factoid took 56 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 1756 steps (15 resets) in 57 ms. (30 steps per ms) remains 0/1 properties
Knowledge based reduction with 19 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p3]
Knowledge-based reduction took 218 ms.
Stuttering acceptance computed with spot in 31 ms :[p3]
Support contains 3 out of 342 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 : 342/342 places, 3615/3615 transitions.
Applied a total of 0 rules in 47 ms. Remains 342 /342 variables (removed 0) and now considering 3615/3615 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 12:38:27] [INFO ] Invariant cache hit.
[2026-05-23 12:38:27] [INFO ] Implicit Places using invariants in 669 ms returned []
[2026-05-23 12:38:27] [INFO ] Invariant cache hit.
[2026-05-23 12:38:28] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:38:55] [INFO ] Implicit Places using invariants and state equation in 28069 ms returned []
Implicit Place search using SMT with State Equation took 28740 ms to find 0 implicit places.
[2026-05-23 12:38:55] [INFO ] Redundant transitions in 141 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28938 ms. Remains : 342/342 places, 3615/3615 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 40 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 3476 steps (18 resets) in 110 ms. (31 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 51 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 35 ms :[p3]
Knowledge-based reduction took 221 ms.
Stuttering acceptance computed with spot in 34 ms :[p3]
Stuttering acceptance computed with spot in 44 ms :[p3]
Product exploration explored 100000 steps with 583 reset in 2640 ms.
Product exploration explored 100000 steps with 594 reset in 2655 ms.
Built C files in :
/tmp/ltsmin2669052345305206984
[2026-05-23 12:39:01] [INFO ] Too many transitions (3615) to apply POR reductions. Disabling POR matrices.
[2026-05-23 12:39:01] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2669052345305206984
Running compilation step : cd /tmp/ltsmin2669052345305206984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2669052345305206984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2669052345305206984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 342 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 342/342 places, 3615/3615 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 341 transition count 3614
Applied a total of 2 rules in 329 ms. Remains 341 /342 variables (removed 1) and now considering 3614/3615 (removed 1) transitions.
Running 3574 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1486019750977752553.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1454625141162393734.kers'
[2026-05-23 12:39:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1486019750977752553.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1454625141162393734.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 1 ms.
// Phase 1: matrix 3614 rows 257 cols 13948 entries
Finished phase 1 with 255 SingleSign rule and 0 generalized
[2026-05-23 12:39:04] [INFO ] Computed 86 invariants in 16 ms
Computed 86 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-1454625141162393734.kers
Total runtime 19 ms.
[2026-05-23 12:39:04] [INFO ] State equation strengthened by 187 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/3955 variables, and 86 constraints, problems are : Problem set: 0 solved, 3574 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/341 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3574/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/3955 variables, and 86 constraints, problems are : Problem set: 0 solved, 3574 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/341 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3321/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45114ms problems are : Problem set: 0 solved, 3574 unsolved
Search for dead transitions found 0 dead transitions in 45120ms
[2026-05-23 12:39:50] [INFO ] Invariant cache hit.
[2026-05-23 12:39:50] [INFO ] Implicit Places using invariants in 660 ms returned []
[2026-05-23 12:39:50] [INFO ] Invariant cache hit.
[2026-05-23 12:39:51] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:40:12] [INFO ] Implicit Places using invariants and state equation in 21923 ms returned []
Implicit Place search using SMT with State Equation took 22587 ms to find 0 implicit places.
[2026-05-23 12:40:12] [INFO ] Redundant transitions in 146 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 341/342 places, 3614/3615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68200 ms. Remains : 341/342 places, 3614/3615 transitions.
Built C files in :
/tmp/ltsmin16584899206024269085
[2026-05-23 12:40:12] [INFO ] Too many transitions (3614) to apply POR reductions. Disabling POR matrices.
[2026-05-23 12:40:12] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16584899206024269085
Running compilation step : cd /tmp/ltsmin16584899206024269085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16584899206024269085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16584899206024269085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 12:40:15] [INFO ] Flatten gal took : 79 ms
[2026-05-23 12:40:16] [INFO ] Flatten gal took : 78 ms
[2026-05-23 12:40:16] [INFO ] Time to serialize gal into /tmp/LTL11795417359641120972.gal : 20 ms
[2026-05-23 12:40:16] [INFO ] Time to serialize properties into /tmp/LTL1445999926703709237.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11795417359641120972.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14397714964559303027.hoa' '-atoms' '/tmp/LTL1445999926703709237.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1445999926703709237.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14397714964559303027.hoa
Detected timeout of ITS tools.
[2026-05-23 12:40:31] [INFO ] Flatten gal took : 58 ms
[2026-05-23 12:40:31] [INFO ] Flatten gal took : 60 ms
[2026-05-23 12:40:31] [INFO ] Time to serialize gal into /tmp/LTL1888624779609323297.gal : 17 ms
[2026-05-23 12:40:31] [INFO ] Time to serialize properties into /tmp/LTL8364390442883089940.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1888624779609323297.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8364390442883089940.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((!("(((pl_start_cops>=1)&&(pl_cops_n21>=1))&&(pl_robber_absent_n21>=1))"))U((G(!("(((pl_start_cops>=1)&&(pl_cops_n21>=1))&&(pl_rob...509
Formula 0 simplified : ("(((pl_start_cops>=1)&&(pl_cops_n21>=1))&&(pl_robber_absent_n21>=1))" M !"((!(((pl_start_cops>=1)&&(pl_cops_n13>=1))&&(pl_robber_ab...410
Detected timeout of ITS tools.
[2026-05-23 12:40:46] [INFO ] Flatten gal took : 57 ms
[2026-05-23 12:40:46] [INFO ] Applying decomposition
[2026-05-23 12:40:46] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7876759985085681127.txt' '-o' '/tmp/graph7876759985085681127.bin' '-w' '/tmp/graph7876759985085681127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7876759985085681127.bin' '-l' '-1' '-v' '-w' '/tmp/graph7876759985085681127.weights' '-q' '0' '-e' '0.001'
[2026-05-23 12:40:46] [INFO ] Decomposing Gal with order
[2026-05-23 12:40:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 12:40:49] [INFO ] Removed a total of 6718 redundant transitions.
[2026-05-23 12:40:49] [INFO ] Flatten gal took : 2989 ms
[2026-05-23 12:40:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 1848 labels/synchronizations in 133 ms.
[2026-05-23 12:40:49] [INFO ] Time to serialize gal into /tmp/LTL3775882123343292257.gal : 14 ms
[2026-05-23 12:40:49] [INFO ] Time to serialize properties into /tmp/LTL9743468614742027383.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3775882123343292257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9743468614742027383.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((!("(((u0.pl_start_cops>=1)&&(u0.pl_cops_n21>=1))&&(i2.u23.pl_robber_absent_n21>=1))"))U((G(!("(((u0.pl_start_cops>=1)&&(u0.pl_cop...601
Formula 0 simplified : ("(((u0.pl_start_cops>=1)&&(u0.pl_cops_n21>=1))&&(i2.u23.pl_robber_absent_n21>=1))" M !"((!(((u0.pl_start_cops>=1)&&(u0.pl_cops_n13>...489
Detected timeout of ITS tools.
Treatment of property CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-13 finished in 193212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 342 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 342/342 places, 3615/3615 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 342 transition count 3614
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 341 transition count 3614
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 340 transition count 3613
Applied a total of 4 rules in 262 ms. Remains 340 /342 variables (removed 2) and now considering 3613/3615 (removed 2) transitions.
Running 3573 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12802968835804644578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7533059986897563437.kers'
[2026-05-23 12:41:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12802968835804644578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7533059986897563437.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 2 ms.
// Phase 1: matrix 3613 rows 256 cols 13946 entries
Finished phase 1 with 254 SingleSign rule and 0 generalized
[2026-05-23 12:41:05] [INFO ] Computed 86 invariants in 17 ms
Computed 86 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-7533059986897563437.kers
Total runtime 20 ms.
[2026-05-23 12:41:05] [INFO ] State equation strengthened by 187 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/3953 variables, and 86 constraints, problems are : Problem set: 0 solved, 3573 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/340 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3573/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/3953 variables, and 86 constraints, problems are : Problem set: 0 solved, 3573 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/340 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3321/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45133ms problems are : Problem set: 0 solved, 3573 unsolved
Search for dead transitions found 0 dead transitions in 45140ms
[2026-05-23 12:41:50] [INFO ] Invariant cache hit.
[2026-05-23 12:41:51] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2026-05-23 12:41:51] [INFO ] Invariant cache hit.
[2026-05-23 12:41:52] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:42:17] [INFO ] Implicit Places using invariants and state equation in 25574 ms returned []
Implicit Place search using SMT with State Equation took 26732 ms to find 0 implicit places.
[2026-05-23 12:42:17] [INFO ] Redundant transitions in 145 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 340/342 places, 3613/3615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72298 ms. Remains : 340/342 places, 3613/3615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-14
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-14 finished in 72378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F((!p0||G(F(!p0)))))||(!p0&&X(X(F((!p0||G(F(!p0))))))))) U (!p1&&X(p2))))'
Support contains 8 out of 342 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 3615/3615 transitions.
Applied a total of 0 rules in 12 ms. Remains 342 /342 variables (removed 0) and now considering 3615/3615 (removed 0) transitions.
Running 3575 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3241063404026471185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1871000884862335216.kers'
[2026-05-23 12:42:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3241063404026471185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1871000884862335216.kers]
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 4 ms.
// Phase 1: matrix 3615 rows 258 cols 13950 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-23 12:42:17] [INFO ] Computed 86 invariants in 19 ms
Computed 86 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-1871000884862335216.kers
Total runtime 25 ms.
[2026-05-23 12:42:17] [INFO ] State equation strengthened by 187 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/3957 variables, and 86 constraints, problems are : Problem set: 0 solved, 3575 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/342 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3575/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 3575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/3957 variables, and 86 constraints, problems are : Problem set: 0 solved, 3575 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/342 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3322/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45149ms problems are : Problem set: 0 solved, 3575 unsolved
Search for dead transitions found 0 dead transitions in 45155ms
[2026-05-23 12:43:02] [INFO ] Invariant cache hit.
[2026-05-23 12:43:03] [INFO ] Implicit Places using invariants in 896 ms returned []
[2026-05-23 12:43:03] [INFO ] Invariant cache hit.
[2026-05-23 12:43:04] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-23 12:43:24] [INFO ] Implicit Places using invariants and state equation in 21044 ms returned []
Implicit Place search using SMT with State Equation took 21944 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 67121 ms. Remains : 342/342 places, 3615/3615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F((!p0||G(F(!p0)))))||(!p0&&X(X(F((!p0||G(F(!p0))))))))) U (!p1&&X(p2))))'
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p2) p1), false, (AND (NOT p1) (NOT p2) p0), (NOT p2), (AND (NOT p1) p0 (NOT p2)), p0, p0]
Running random walk in product with property : CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-15
Stuttering criterion allowed to conclude after 92754 steps with 23261 reset in 660 ms.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-15 finished in 68091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Spot run failed in 77 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p1 U (p2||G(!p1)))||p0))))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (p1||G(!p0))) U (!p2&&F(G(!p3)))))'
Spot run failed in 37 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-23 12:43:25] [INFO ] Flatten gal took : 60 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8100954725406757381
[2026-05-23 12:43:25] [INFO ] Too many transitions (3615) to apply POR reductions. Disabling POR matrices.
[2026-05-23 12:43:25] [INFO ] Applying decomposition
[2026-05-23 12:43:25] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8100954725406757381
Running compilation step : cd /tmp/ltsmin8100954725406757381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-23 12:43:25] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3472500343880989956.txt' '-o' '/tmp/graph3472500343880989956.bin' '-w' '/tmp/graph3472500343880989956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3472500343880989956.bin' '-l' '-1' '-v' '-w' '/tmp/graph3472500343880989956.weights' '-q' '0' '-e' '0.001'
[2026-05-23 12:43:26] [INFO ] Decomposing Gal with order
[2026-05-23 12:43:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 12:43:28] [INFO ] Removed a total of 6718 redundant transitions.
[2026-05-23 12:43:28] [INFO ] Flatten gal took : 2051 ms
[2026-05-23 12:43:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1848 labels/synchronizations in 148 ms.
[2026-05-23 12:43:28] [INFO ] Time to serialize gal into /tmp/LTLFireability12660726628409420808.gal : 18 ms
[2026-05-23 12:43:28] [INFO ] Time to serialize properties into /tmp/LTLFireability16693469219987456056.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12660726628409420808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16693469219987456056.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((G((F("(((i12.i0.u2.pl_start_robber<1)||(i12.i0.u31.pl_robber_absent_n29<1))||(i12.i0.u63.pl_robber_here_n61<1))"))&&(F(G("(((i12.i0...255
Formula 0 simplified : F(G!"(((i12.i0.u2.pl_start_robber<1)||(i12.i0.u31.pl_robber_absent_n29<1))||(i12.i0.u63.pl_robber_here_n61<1))" | GF!"(((i12.i0.u2.p...245
Compilation finished in 9732 ms.
Running link step : cd /tmp/ltsmin8100954725406757381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 931 ms.
Running LTSmin : cd /tmp/ltsmin8100954725406757381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t10, t12, t16, t18, t21, t24, t27, t30, t34, t36, t39, t43, t45, t49, t52, t54, t57, ...16840
Computing Next relation with stutter on 14196 deadlock states
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin8100954725406757381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8100954725406757381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((!(LTLAPp3==true) U ((LTLAPp4==true)||[](!(LTLAPp3==true))))||(LTLAPp2==true))))' '--buchi-type=spotba'
4 unique states visited
3 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
77338 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,773.774,8303712,1,0,1.82589e+06,2.01294e+07,10895,7.44112e+06,7636,9.74636e+07,2711968
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(("((u0.pl_start_cops<1)||(u0.pl_cops_n1<1))")||(("(i8.u3.pl_robber_absent_n1<1)")||((!("(((u0.pl_start_cops>=1)&&(u0.pl_cops_n1...469
Formula 1 simplified : FG(!"((u0.pl_start_cops<1)||(u0.pl_cops_n1<1))" & !"(i8.u3.pl_robber_absent_n1<1)" & ("(((u0.pl_start_cops>=1)&&(u0.pl_cops_n1>=1))&...367
Computing Next relation with stutter on 14196 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2246 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,796.238,8303944,1,0,1.82589e+06,2.01294e+07,14316,7.44112e+06,9696,9.74636e+07,3204663
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((!("(((u0.pl_start_cops>=1)&&(u0.pl_cops_n21>=1))&&(i11.u23.pl_robber_absent_n21>=1))"))U(("((!(((u0.pl_start_cops>=1)&&(u0.pl_cop...624
Formula 2 simplified : ("(((u0.pl_start_cops>=1)&&(u0.pl_cops_n21>=1))&&(i11.u23.pl_robber_absent_n21>=1))" M !"((!(((u0.pl_start_cops>=1)&&(u0.pl_cops_n13...511
Computing Next relation with stutter on 14196 deadlock states
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin8100954725406757381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((!(LTLAPp3==true) U ((LTLAPp4==true)||[](!(LTLAPp3==true))))||(LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8100954725406757381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '((!(LTLAPp5==true) U ((LTLAPp6==true)||[](!(LTLAPp5==true)))) U (!(LTLAPp7==true)&&<>([](!(LTLAPp8==true)))))' '--buchi-type=spotba'
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
34451 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,1140.76,9771452,1,0,1.82589e+06,2.95227e+07,9925,7.44112e+06,7636,1.27457e+08,1079045
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CopsAndRobbers-PT-KFL084N009K003X002-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2343174 ms.
BK_STOP 1779541384425
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-KFL084N009K003X002"
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-5973"
echo " Executing tool itstools"
echo " Input is CopsAndRobbers-PT-KFL084N009K003X002, 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 r066-tall-177946967800540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-KFL084N009K003X002.tgz
mv CopsAndRobbers-PT-KFL084N009K003X002 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 ;