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.r210-smll-177969942000235.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 PhilosophersDyn-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-177969942000235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 11K Mar 5 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 5 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 5 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K Mar 5 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K Mar 16 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 16 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 16 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 16 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 5 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 5 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Mar 5 13:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Mar 5 13:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 16 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 16 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 87K 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 PhilosophersDyn-PT-03-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779976796067

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-28 13:59:58] [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-28 13:59:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 13:59:58] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2026-05-28 13:59:58] [INFO ] Transformed 30 places.
[2026-05-28 13:59:58] [INFO ] Transformed 84 transitions.
[2026-05-28 13:59:58] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 352 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 15 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Running 78 sub problems to find dead transitions.
[2026-05-28 13:59:59] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16077466735971296038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-847650889522441980.kers'
[2026-05-28 13:59:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16077466735971296038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-847650889522441980.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 57 rows 30 cols 264 entries
Finished phase 1 with 15 SingleSign rule and 4 generalized
[2026-05-28 13:59:59] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-847650889522441980.kers
Total runtime 2 ms.
[2026-05-28 13:59:59] [INFO ] State equation strengthened by 36 read => feed constraints.
Problem TDEAD0 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 8/8 constraints. Problems are: Problem set: 12 solved, 66 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD75 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 3/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 57/87 variables, 30/41 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 36/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/78 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/78 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/78 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 78 constraints, problems are : Problem set: 30 solved, 48 unsolved in 3279 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 8/8 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 3/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 57/87 variables, 30/42 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 36/78 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 48/126 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 1/127 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/127 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/87 variables, 0/127 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 127 constraints, problems are : Problem set: 30 solved, 48 unsolved in 3709 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 48/78 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7333ms problems are : Problem set: 30 solved, 48 unsolved
Search for dead transitions found 30 dead transitions in 7363ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4719939625694188762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2748151904289173211.kers'
[2026-05-28 14:00:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4719939625694188762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2748151904289173211.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 51 rows 30 cols 243 entries
Finished phase 1 with 12 SingleSign rule and 7 generalized
[2026-05-28 14:00:06] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2748151904289173211.kers
Total runtime 0 ms.
[2026-05-28 14:00:06] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-28 14:00:06] [INFO ] Invariant cache hit.
[2026-05-28 14:00:06] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:00:06] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7653 ms. Remains : 30/30 places, 51/81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2026-05-28 14:00:06] [INFO ] Invariant cache hit.
[2026-05-28 14:00:06] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 74 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2642 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 48/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/81 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 123 constraints, problems are : Problem set: 0 solved, 48 unsolved in 5204 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7911ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 7913ms
[2026-05-28 14:00:14] [INFO ] Invariant cache hit.
[2026-05-28 14:00:14] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-28 14:00:14] [INFO ] Invariant cache hit.
[2026-05-28 14:00:14] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:00:14] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 8007 ms. Remains : 30/30 places, 51/51 transitions.
Support contains 30 out of 30 places after structural reductions.
[2026-05-28 14:00:15] [INFO ] Flatten gal took : 36 ms
[2026-05-28 14:00:15] [INFO ] Flatten gal took : 18 ms
[2026-05-28 14:00:15] [INFO ] Input system was already deterministic with 51 transitions.
RANDOM walk for 40000 steps (5690 resets) in 1597 ms. (25 steps per ms) remains 5/29 properties
BEST_FIRST walk for 40003 steps (1389 resets) in 412 ms. (96 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1201 resets) in 386 ms. (103 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1226 resets) in 326 ms. (122 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1306 resets) in 317 ms. (125 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1223 resets) in 414 ms. (96 steps per ms) remains 5/5 properties
[2026-05-28 14:00:16] [INFO ] Invariant cache hit.
[2026-05-28 14:00:16] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 2/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/24 variables, 6/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/25 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/29 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 51/80 variables, 29/40 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 30/70 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/81 variables, 1/71 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/81 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/81 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 71 constraints, problems are : Problem set: 1 solved, 4 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/24 variables, 6/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/25 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/29 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 51/80 variables, 29/40 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 30/70 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/81 variables, 1/71 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/81 variables, 4/75 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/81 variables, 2/77 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/81 variables, 1/78 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/81 variables, 0/78 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/81 variables, 0/78 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 78 constraints, problems are : Problem set: 3 solved, 2 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 713ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 116 ms.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 49
Applied a total of 4 rules in 25 ms. Remains 28 /30 variables (removed 2) and now considering 49/51 (removed 2) transitions.
Running 46 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-10742470855064906750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13091391052827404859.kers'
[2026-05-28 14:00:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10742470855064906750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13091391052827404859.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 49 rows 28 cols 233 entries
Finished phase 1 with 10 SingleSign rule and 7 generalized
[2026-05-28 14:00:17] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13091391052827404859.kers
Total runtime 1 ms.
[2026-05-28 14:00:17] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 49/77 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 30/69 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/77 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 70 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2245 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 28/28 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 49/77 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 46/116 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/77 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 118 constraints, problems are : Problem set: 0 solved, 46 unsolved in 4077 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 28/28 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6358ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 6359ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6385 ms. Remains : 28/30 places, 49/51 transitions.
RANDOM walk for 40000 steps (5763 resets) in 258 ms. (154 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1710 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1234 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
Probably explored full state space saw : 228 states, properties seen :0
Probabilistic random walk after 759 steps, saw 228 distinct states, run finished after 29 ms. (steps per millisecond=26 ) properties seen :0
Explored full state space saw : 228 states, properties seen :0
Exhaustive walk after 759 steps, saw 228 distinct states, run finished after 13 ms. (steps per millisecond=58 ) properties seen :0
FORMULA PhilosophersDyn-PT-03-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PhilosophersDyn-PT-03-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 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-4100405374567222839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4435225162824443379.kers'
[2026-05-28 14:00:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4100405374567222839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4435225162824443379.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 51 rows 30 cols 243 entries
Finished phase 1 with 12 SingleSign rule and 7 generalized
[2026-05-28 14:00:24] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4435225162824443379.kers
Total runtime 1 ms.
[2026-05-28 14:00:24] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 74 constraints, problems are : Problem set: 0 solved, 48 unsolved in 3272 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 48/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/81 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 123 constraints, problems are : Problem set: 0 solved, 48 unsolved in 5123 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8440ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 8441ms
[2026-05-28 14:00:32] [INFO ] Invariant cache hit.
[2026-05-28 14:00:32] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-28 14:00:32] [INFO ] Invariant cache hit.
[2026-05-28 14:00:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:00:33] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2026-05-28 14:00:33] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8640 ms. Remains : 30/30 places, 51/51 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 243 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-00
Stuttering criterion allowed to conclude after 17 steps with 2 reset in 2 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-00 finished in 9012 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||X(X(p1))))||((p0||X(X(p1)))&&X(F(p2))))))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Skipped dead transition search.
[2026-05-28 14:00:33] [INFO ] Invariant cache hit.
[2026-05-28 14:00:33] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-28 14:00:33] [INFO ] Invariant cache hit.
[2026-05-28 14:00:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:00:33] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 30/30 places, 51/51 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||X(X(p1))))||(X(F(p2))&&(p0||X(X(p1)))))))'
Stuttering acceptance computed with spot in 456 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-01
Product exploration explored 100000 steps with 37578 reset in 838 ms.
Product exploration explored 100000 steps with 37384 reset in 385 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 6 factoid took 158 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (5710 resets) in 185 ms. (215 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (1585 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
[2026-05-28 14:00:35] [INFO ] Invariant cache hit.
[2026-05-28 14:00:35] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/18 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 18/81 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/9 constraints, State Equation: 0/30 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 14 ms. Proved property starting from automaton with 5 states, 6 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 368 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-01 finished in 2258 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||X(!p0))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Skipped dead transition search.
[2026-05-28 14:00:35] [INFO ] Invariant cache hit.
[2026-05-28 14:00:35] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-28 14:00:35] [INFO ] Invariant cache hit.
[2026-05-28 14:00:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:00:35] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2026-05-28 14:00:35] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 30/30 places, 51/51 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||X(!p0))))'
Stuttering acceptance computed with spot in 112 ms :[true, false, p0]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-02 finished in 308 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||G(p1))))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Skipped dead transition search.
[2026-05-28 14:00:35] [INFO ] Invariant cache hit.
[2026-05-28 14:00:35] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-28 14:00:35] [INFO ] Invariant cache hit.
[2026-05-28 14:00:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:00:36] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 251 ms. Remains : 30/30 places, 51/51 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||G(p1))))))'
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-03
Stuttering criterion allowed to conclude after 29 steps with 5 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-03 finished in 444 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(F((p0 U (G(p0)||(p0&&(G(p1)||(p1&&G(F(p2))))))))) U p3)))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Skipped dead transition search.
[2026-05-28 14:00:36] [INFO ] Invariant cache hit.
[2026-05-28 14:00:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-28 14:00:36] [INFO ] Invariant cache hit.
[2026-05-28 14:00:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:00:36] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 30/30 places, 51/51 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(F((p0 U (G(p0)||(p0&&(G(p1)||(p1&&G(F(p2))))))))) U p3)))'
Stuttering acceptance computed with spot in 476 ms :[(NOT p3), (NOT p3), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-04
Stuttering criterion allowed to conclude after 66 steps with 10 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-04 finished in 769 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(X(p0))&&p0))||X((X(p1) U !p0))))'
Support contains 12 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Skipped dead transition search.
[2026-05-28 14:00:37] [INFO ] Invariant cache hit.
[2026-05-28 14:00:37] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-28 14:00:37] [INFO ] Invariant cache hit.
[2026-05-28 14:00:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:00:37] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 30/30 places, 51/51 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(X(p0))&&p0))||X((X(p1) U !p0))))'
Stuttering acceptance computed with spot in 320 ms :[true, p0, (OR (NOT p1) p0), false, false, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 326 ms.
Product exploration explored 100000 steps with 50000 reset in 326 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 10 ms. Proved property starting from automaton with 7 states, 12 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 13 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-07 finished in 1233 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((p0 U p1)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Skipped dead transition search.
[2026-05-28 14:00:38] [INFO ] Invariant cache hit.
[2026-05-28 14:00:38] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-28 14:00:38] [INFO ] Invariant cache hit.
[2026-05-28 14:00:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:00:38] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 30/30 places, 51/51 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((p0 U p1)))'
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 39 steps with 12 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-08 finished in 272 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 U X((p1 U p2))))))'
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Skipped dead transition search.
[2026-05-28 14:00:38] [INFO ] Invariant cache hit.
[2026-05-28 14:00:38] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-28 14:00:38] [INFO ] Invariant cache hit.
[2026-05-28 14:00:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:00:38] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 30/30 places, 51/51 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 U X((p1 U p2))))))'
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-10
Stuttering criterion allowed to conclude after 87 steps with 28 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-10 finished in 326 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((p0||G(p1))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Skipped dead transition search.
[2026-05-28 14:00:38] [INFO ] Invariant cache hit.
[2026-05-28 14:00:38] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-28 14:00:38] [INFO ] Invariant cache hit.
[2026-05-28 14:00:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 14:00:39] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 30/30 places, 51/51 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((p0||G(p1))))'
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 297 ms.
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 15 ms. Proved property starting from automaton with 4 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 18 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-13 finished in 1075 ms.
All properties solved by simple procedures.
Total runtime 41481 ms.

BK_STOP 1779976840051

--------------------
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="PhilosophersDyn-PT-03"
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 PhilosophersDyn-PT-03, 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 r210-smll-177969942000235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 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 ;