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.r194-tall-177969913900075.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 Murphy-PT-D2N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969913900075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.4K Mar 8 14:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 8 14:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 8 14:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 8 14:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 16 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 16 08:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 16 08:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Mar 8 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 8 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 8 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Mar 8 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 12K 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 Murphy-PT-D2N100-LTLCardinality-00
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-01
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-02
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-03
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-04
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-05
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-06
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-07
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-08
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-09
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-10
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-11
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-12
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-13
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-14
FORMULA_NAME Murphy-PT-D2N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779710532272

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 12:02:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 12:02:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 12:02:13] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2026-05-25 12:02:13] [INFO ] Transformed 18 places.
[2026-05-25 12:02:13] [INFO ] Transformed 21 transitions.
[2026-05-25 12:02:13] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Murphy-PT-D2N100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N100-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N100-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N100-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 8 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 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-10132350629096716448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6803487482234589931.kers'
[2026-05-25 12:02:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10132350629096716448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6803487482234589931.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 21 rows 15 cols 51 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 12:02:13] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6803487482234589931.kers
Total runtime 1 ms.
[2026-05-25 12:02:13] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 699ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 719ms
[2026-05-25 12:02:14] [INFO ] Invariant cache hit.
[2026-05-25 12:02:14] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 12:02:14] [INFO ] Invariant cache hit.
[2026-05-25 12:02:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 12:02:14] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 840 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 12:02:14] [INFO ] Invariant cache hit.
[2026-05-25 12:02:14] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-25 12:02:14] [INFO ] Invariant cache hit.
[2026-05-25 12:02:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 12:02:14] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 17 out of 18 places after structural reductions.
[2026-05-25 12:02:14] [INFO ] Flatten gal took : 15 ms
[2026-05-25 12:02:14] [INFO ] Flatten gal took : 4 ms
[2026-05-25 12:02:14] [INFO ] Input system was already deterministic with 21 transitions.
RANDOM walk for 40048 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
[2026-05-25 12:02:14] [INFO ] Invariant cache hit.
[2026-05-25 12:02:14] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/20 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/22 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/23 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/25 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/29 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/29 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/29 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 10/39 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/10 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/20 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/20 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/22 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/23 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/23 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/25 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/25 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/29 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/29 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/29 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 10/39 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 29 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Graph (complete) has 69 edges and 18 vertex of which 3 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 12 ms. Remains 3 /18 variables (removed 15) and now considering 4/21 (removed 17) transitions.
Running 3 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-12124640347681943501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-132933913902634449.kers'
[2026-05-25 12:02:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12124640347681943501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-132933913902634449.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 3 cols 9 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-25 12:02:15] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-132933913902634449.kers
Total runtime 0 ms.
[2026-05-25 12:02:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 3/18 places, 4/21 transitions.
RANDOM walk for 40001 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 19 ms. (steps per millisecond=0 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=7 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
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' '!((X(X(p0)) U (X(X(G(p0)))||(p1&&X(X(p0))&&(G(!p2)||(!p2&&F(p3)))))))'
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 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-2114677515178472509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12660531041046720676.kers'
[2026-05-25 12:02:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2114677515178472509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12660531041046720676.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 21 rows 15 cols 51 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 12:02:15] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12660531041046720676.kers
Total runtime 1 ms.
[2026-05-25 12:02:15] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 377ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 377ms
[2026-05-25 12:02:15] [INFO ] Invariant cache hit.
[2026-05-25 12:02:15] [INFO ] Implicit Places using invariants in 31 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 411 ms. Remains : 16/18 places, 21/21 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(p0)) U (X(X(G(p0)))||(p1&&X(X(p0))&&(G(!p2)||(!p2&&F(p3)))))))'
Stuttering acceptance computed with spot in 598 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p3) (NOT p0) p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (AND (NOT p3) (NOT p0) p2), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) p0 p2)]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-01 finished in 1118 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(p0)))'
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 12:02:16] [INFO ] Invariant cache hit.
[2026-05-25 12:02:16] [INFO ] Implicit Places using invariants in 23 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 15/18 places, 21/21 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(p0)))'
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-02 finished in 166 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&&(p2 U p3)))))))'
Support contains 7 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 12:02:16] [INFO ] Invariant cache hit.
[2026-05-25 12:02:16] [INFO ] Implicit Places using invariants in 23 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31 ms. Remains : 16/18 places, 21/21 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&&(p2 U p3)))))))'
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (OR (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 298 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-03 finished in 551 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&&X(X((F(p0)||X(F(!p1))))))||G((F(p0)||X(F(!p1)))))))'
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 12:02:17] [INFO ] Invariant cache hit.
[2026-05-25 12:02:17] [INFO ] Implicit Places using invariants in 25 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 16/18 places, 21/21 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)||X(F(p1))))||(p0&&X(X((F(p0)||X(F(p1)))))))))'
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-04
Product exploration explored 100000 steps with 26975 reset in 143 ms.
Stack based approach found an accepted trace after 766 steps with 209 reset with depth 11 and stack size 11 in 11 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-04 finished in 388 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(p0) U X(G(p1))))'
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 12:02:17] [INFO ] Invariant cache hit.
[2026-05-25 12:02:17] [INFO ] Implicit Places using invariants in 26 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 15/18 places, 21/21 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(G(p1))))'
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-05 finished in 212 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(p0) U p1)&&F((p2&&X(F(p1))))))'
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 12:02:17] [INFO ] Invariant cache hit.
[2026-05-25 12:02:17] [INFO ] Implicit Places using invariants in 23 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25 ms. Remains : 17/18 places, 21/21 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 p1)&&F((p2&&X(F(p1))))))'
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-06
Product exploration explored 100000 steps with 31 reset in 169 ms.
Stack based approach found an accepted trace after 105 steps with 0 reset with depth 106 and stack size 106 in 0 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-06 finished in 476 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)))'
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 12:02:18] [INFO ] Invariant cache hit.
[2026-05-25 12:02:18] [INFO ] Implicit Places using invariants in 27 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32 ms. Remains : 15/18 places, 21/21 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)))'
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-07
Product exploration explored 100000 steps with 7496 reset in 117 ms.
Stack based approach found an accepted trace after 257 steps with 20 reset with depth 11 and stack size 11 in 1 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-07 finished in 246 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((F(p0)&&F((X(X(p1))||G(p2)))))))'
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 12:02:18] [INFO ] Invariant cache hit.
[2026-05-25 12:02:18] [INFO ] Implicit Places using invariants in 29 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32 ms. Remains : 15/18 places, 21/21 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((F(p0)&&F((X(X(p1))||G(p2)))))))'
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-11
Product exploration explored 100000 steps with 20000 reset in 132 ms.
Product exploration explored 100000 steps with 20000 reset in 145 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 2 factoid took 65 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 3816 steps (0 resets) in 12 ms. (293 steps per ms) remains 0/4 properties
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 369 ms.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 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-6772024794474295158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7911114916258499541.kers'
[2026-05-25 12:02:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6772024794474295158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7911114916258499541.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 21 rows 15 cols 51 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 12:02:19] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7911114916258499541.kers
Total runtime 0 ms.
[2026-05-25 12:02:19] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 294ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 295ms
[2026-05-25 12:02:20] [INFO ] Invariant cache hit.
[2026-05-25 12:02:20] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 12:02:20] [INFO ] Invariant cache hit.
[2026-05-25 12:02:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 12:02:20] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 15/15 places, 21/21 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 1 factoid took 47 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 6704 steps (0 resets) in 15 ms. (419 steps per ms) remains 0/4 properties
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 356 ms.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 20000 reset in 105 ms.
Product exploration explored 100000 steps with 20000 reset in 109 ms.
Spot run failed in 72 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/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin11553700274651187297
[2026-05-25 12:02:21] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11553700274651187297
Running compilation step : cd /tmp/ltsmin11553700274651187297;'/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'
Compilation finished in 191 ms.
Running link step : cd /tmp/ltsmin11553700274651187297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11553700274651187297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased17564368467826797589.hoa' '--buchi-type=spotba'
LTSmin run took 42 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Murphy-PT-D2N100-LTLCardinality-11 finished in 2977 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 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 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-10229900556804872153.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5843616994208204948.kers'
[2026-05-25 12:02:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10229900556804872153.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5843616994208204948.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 21 rows 15 cols 51 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 12:02:21] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5843616994208204948.kers
Total runtime 0 ms.
[2026-05-25 12:02:21] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 330ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 330ms
[2026-05-25 12:02:21] [INFO ] Invariant cache hit.
[2026-05-25 12:02:21] [INFO ] Implicit Places using invariants in 28 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 365 ms. Remains : 16/18 places, 21/21 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 36 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 146 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 42 in 1 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-14 finished in 578 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((X((G(p0)||G(F(p1)))) U (X(p2) U ((p1&&X(p2))||X(G(p2)))))))'
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 12:02:22] [INFO ] Invariant cache hit.
[2026-05-25 12:02:22] [INFO ] Implicit Places using invariants in 23 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26 ms. Remains : 17/18 places, 21/21 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((X((G(p0)||G(F(p1)))) U (X(p2) U (X(G(p2))||(p1&&X(p2)))))))'
Stuttering acceptance computed with spot in 464 ms :[(NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : Murphy-PT-D2N100-LTLCardinality-15
Product exploration explored 100000 steps with 3 reset in 151 ms.
Stack based approach found an accepted trace after 83477 steps with 1 reset with depth 582 and stack size 561 in 145 ms.
FORMULA Murphy-PT-D2N100-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLCardinality-15 finished in 849 ms.
All properties solved by simple procedures.
Total runtime 9651 ms.

BK_STOP 1779710543081

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is Murphy-PT-D2N100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969913900075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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