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-177969942000124.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 Philosophers-PT-000020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-177969942000124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 28K Mar 5 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 187K Mar 5 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 5 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 5 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Mar 16 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 16 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 16 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 16 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Mar 5 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 261K Mar 5 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 46K Mar 5 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 340K Mar 5 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 16 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Mar 16 08:36 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 44K 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 Philosophers-PT-000020-LTLFireability-00
FORMULA_NAME Philosophers-PT-000020-LTLFireability-01
FORMULA_NAME Philosophers-PT-000020-LTLFireability-02
FORMULA_NAME Philosophers-PT-000020-LTLFireability-03
FORMULA_NAME Philosophers-PT-000020-LTLFireability-04
FORMULA_NAME Philosophers-PT-000020-LTLFireability-05
FORMULA_NAME Philosophers-PT-000020-LTLFireability-06
FORMULA_NAME Philosophers-PT-000020-LTLFireability-07
FORMULA_NAME Philosophers-PT-000020-LTLFireability-08
FORMULA_NAME Philosophers-PT-000020-LTLFireability-09
FORMULA_NAME Philosophers-PT-000020-LTLFireability-10
FORMULA_NAME Philosophers-PT-000020-LTLFireability-11
FORMULA_NAME Philosophers-PT-000020-LTLFireability-12
FORMULA_NAME Philosophers-PT-000020-LTLFireability-13
FORMULA_NAME Philosophers-PT-000020-LTLFireability-14
FORMULA_NAME Philosophers-PT-000020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779873714469

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 09:21:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 09:21:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 09:21:57] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2026-05-27 09:21:57] [INFO ] Transformed 100 places.
[2026-05-27 09:21:57] [INFO ] Transformed 100 transitions.
[2026-05-27 09:21:57] [INFO ] Found NUPN structural information;
[2026-05-27 09:21:57] [INFO ] Parsed PT model containing 100 places and 100 transitions and 320 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-PT-000020-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 20 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12906044340258637430.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8572645458938949536.kers'
[2026-05-27 09:21:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12906044340258637430.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8572645458938949536.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 100 cols 320 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-27 09:21:58] [INFO ] Computed 40 invariants in 1 ms
Computed 40 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8572645458938949536.kers
Total runtime 3 ms.
[2026-05-27 09:21:58] [INFO ] Implicit Places using invariants in 410 ms returned []
[2026-05-27 09:21:58] [INFO ] Invariant cache hit.
[2026-05-27 09:21:58] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2026-05-27 09:21:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 240 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4433 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 100/200 variables, 100/240 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 60/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 300 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4802 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9320ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 9344ms
Finished structural reductions in LTL mode , in 1 iterations and 10193 ms. Remains : 100/100 places, 100/100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-27 09:22:08] [INFO ] Invariant cache hit.
[2026-05-27 09:22:08] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-27 09:22:08] [INFO ] Invariant cache hit.
[2026-05-27 09:22:08] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 100/100 places, 100/100 transitions.
Support contains 100 out of 100 places after structural reductions.
[2026-05-27 09:22:08] [INFO ] Flatten gal took : 63 ms
[2026-05-27 09:22:08] [INFO ] Flatten gal took : 41 ms
[2026-05-27 09:22:08] [INFO ] Input system was already deterministic with 100 transitions.
Reduction of identical properties reduced properties to check from 29 to 22
RANDOM walk for 2282 steps (5 resets) in 271 ms. (8 steps per ms) remains 0/22 properties
FORMULA Philosophers-PT-000020-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(F(((G((G(p2)||p1))&&(F(p2)||p3))||p0)))))'
Support contains 80 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-27 09:22:09] [INFO ] Invariant cache hit.
[2026-05-27 09:22:10] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-27 09:22:10] [INFO ] Invariant cache hit.
[2026-05-27 09:22:10] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 100/100 places, 100/100 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(((G((G(p2)||p1))&&(F(p2)||p3))||p0)))))'
Stuttering acceptance computed with spot in 810 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 987 ms.
Product exploration explored 100000 steps with 33333 reset in 519 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 7 factoid took 125 ms. Proved property starting from automaton with 8 states, 22 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 144 ms.
FORMULA Philosophers-PT-000020-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000020-LTLFireability-00 finished in 3126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-27 09:22:12] [INFO ] Invariant cache hit.
[2026-05-27 09:22:12] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-27 09:22:12] [INFO ] Invariant cache hit.
[2026-05-27 09:22:13] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 100/100 places, 100/100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 515 ms.
Product exploration explored 100000 steps with 50000 reset in 480 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 12 ms. Proved property starting from automaton with 3 states, 3 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 17 ms.
FORMULA Philosophers-PT-000020-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000020-LTLFireability-01 finished in 1506 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 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-27 09:22:14] [INFO ] Invariant cache hit.
[2026-05-27 09:22:14] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-27 09:22:14] [INFO ] Invariant cache hit.
[2026-05-27 09:22:14] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 100/100 places, 100/100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Stuttering acceptance computed with spot in 136 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-03 finished in 378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 10 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-27 09:22:14] [INFO ] Invariant cache hit.
[2026-05-27 09:22:14] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-27 09:22:14] [INFO ] Invariant cache hit.
[2026-05-27 09:22:15] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2026-05-27 09:22:15] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 100/100 places, 100/100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p1)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4178 steps with 1323 reset in 177 ms.
FORMULA Philosophers-PT-000020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-04 finished in 586 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(X(F(!p2)))||p1))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-27 09:22:15] [INFO ] Invariant cache hit.
[2026-05-27 09:22:15] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-27 09:22:15] [INFO ] Invariant cache hit.
[2026-05-27 09:22:15] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 372 ms. Remains : 100/100 places, 100/100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(X(F(p2)))||p1))))'
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-05
Product exploration explored 100000 steps with 18407 reset in 754 ms.
Product exploration explored 100000 steps with 18414 reset in 532 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 3 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 24 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2026-05-27 09:22:17] [INFO ] Invariant cache hit.
[2026-05-27 09:22:17] [INFO ] [Real]Absence check using 40 positive place invariants in 283 ms returned sat
[2026-05-27 09:22:21] [INFO ] [Real]Absence check using state equation in 3889 ms returned sat
[2026-05-27 09:22:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 09:22:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 22 ms returned sat
[2026-05-27 09:22:22] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2026-05-27 09:22:22] [INFO ] Computed and/alt/rep : 60/80/60 causal constraints (skipped 0 transitions) in 15 ms.
[2026-05-27 09:22:22] [INFO ] Added : 0 causal constraints over 0 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 5063 ms.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Support contains 20 out of 100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 8 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-27 09:22:22] [INFO ] Invariant cache hit.
[2026-05-27 09:22:22] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-27 09:22:22] [INFO ] Invariant cache hit.
[2026-05-27 09:22:22] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2026-05-27 09:22:22] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 382 ms. Remains : 100/100 places, 100/100 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 2 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 28 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
[2026-05-27 09:22:23] [INFO ] Invariant cache hit.
[2026-05-27 09:22:23] [INFO ] [Real]Absence check using 40 positive place invariants in 274 ms returned sat
[2026-05-27 09:22:27] [INFO ] [Real]Absence check using state equation in 3842 ms returned sat
[2026-05-27 09:22:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 09:22:27] [INFO ] [Nat]Absence check using 40 positive place invariants in 24 ms returned sat
[2026-05-27 09:22:27] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2026-05-27 09:22:27] [INFO ] Computed and/alt/rep : 60/80/60 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-27 09:22:27] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 4965 ms.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11249 reset in 822 ms.
Product exploration explored 100000 steps with 11285 reset in 902 ms.
Built C files in :
/tmp/ltsmin6373439816925821436
[2026-05-27 09:22:29] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2026-05-27 09:22:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 09:22:29] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2026-05-27 09:22:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 09:22:29] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2026-05-27 09:22:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 09:22:29] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6373439816925821436
Running compilation step : cd /tmp/ltsmin6373439816925821436;'/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 673 ms.
Running link step : cd /tmp/ltsmin6373439816925821436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin6373439816925821436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11426279132322131090.hoa' '--buchi-type=spotba'
LTSmin run took 134 ms.
FORMULA Philosophers-PT-000020-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-PT-000020-LTLFireability-05 finished in 15397 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&&X(!p1))) U ((X((!p0&&X(!p1)))&&G(!p1))||X(G((!p0&&X(!p1))))))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-27 09:22:30] [INFO ] Invariant cache hit.
[2026-05-27 09:22:30] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-27 09:22:30] [INFO ] Invariant cache hit.
[2026-05-27 09:22:31] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 100/100 places, 100/100 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&&X(!p1))) U (X(G((!p0&&X(!p1))))||(X((!p0&&X(!p1)))&&G(!p1))))))'
Stuttering acceptance computed with spot in 394 ms :[true, (OR p0 p1), (OR p0 p1), (OR p1 p0), (OR p1 p0), (OR p0 p1), (OR p0 p1), p1]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-07 finished in 790 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((X(X(F(!p0))) U (F(p1)&&(p2||X(p1)))))))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-27 09:22:31] [INFO ] Invariant cache hit.
[2026-05-27 09:22:31] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-27 09:22:31] [INFO ] Invariant cache hit.
[2026-05-27 09:22:31] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 100/100 places, 100/100 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((X(X(F(!p0))) U (F(p1)&&(X(p1)||p2))))))'
Stuttering acceptance computed with spot in 326 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-09
Stuttering criterion allowed to conclude after 138 steps with 3 reset in 1 ms.
FORMULA Philosophers-PT-000020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-09 finished in 901 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))&&(G(p1) U X((F(p3)&&p2)))))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-27 09:22:32] [INFO ] Invariant cache hit.
[2026-05-27 09:22:32] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-27 09:22:32] [INFO ] Invariant cache hit.
[2026-05-27 09:22:32] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 481 ms. Remains : 100/100 places, 100/100 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))&&(G(p1) U X((F(p3)&&p2)))))'
Stuttering acceptance computed with spot in 446 ms :[(OR (NOT p3) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), true, (NOT p3), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-10 finished in 992 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(((F((!p1&&X(p2))) U !p3) U (!p2&&(F((!p1&&X(p2))) U !p3))))||p0)))'
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-27 09:22:33] [INFO ] Invariant cache hit.
[2026-05-27 09:22:33] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-27 09:22:33] [INFO ] Invariant cache hit.
[2026-05-27 09:22:33] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 100/100 places, 100/100 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(((F((!p1&&X(p2))) U !p3) U (!p2&&(F((!p1&&X(p2))) U !p3))))||p0)))'
Stuttering acceptance computed with spot in 311 ms :[(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), (OR p2 p3), (OR (NOT p2) p1), p3, (NOT p2)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-11
Stuttering criterion allowed to conclude after 508 steps with 12 reset in 5 ms.
FORMULA Philosophers-PT-000020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-11 finished in 846 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((X(F(p1))||p0))))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 84 transition count 84
Applied a total of 32 rules in 35 ms. Remains 84 /100 variables (removed 16) and now considering 84/100 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10254027288547021927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12884828274258788651.kers'
[2026-05-27 09:22:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10254027288547021927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12884828274258788651.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 84 cols 256 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-27 09:22:34] [INFO ] Computed 40 invariants in 0 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12884828274258788651.kers
Total runtime 1 ms.
[2026-05-27 09:22:34] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-27 09:22:34] [INFO ] Invariant cache hit.
[2026-05-27 09:22:34] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2026-05-27 09:22:34] [INFO ] Redundant transitions in 2 ms returned []
Running 44 sub problems to find dead transitions.
[2026-05-27 09:22:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 20/84 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 84/168 variables, 84/208 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 208 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2470 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 20/84 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 84/168 variables, 84/208 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 44/252 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 252 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2350 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4840ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 4841ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/100 places, 84/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5351 ms. Remains : 84/100 places, 84/100 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((X(F(p1))||p0))))'
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-12
Product exploration explored 100000 steps with 332 reset in 637 ms.
Stack based approach found an accepted trace after 2780 steps with 8 reset with depth 29 and stack size 29 in 25 ms.
FORMULA Philosophers-PT-000020-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-12 finished in 6160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p2)&&p1)) U (F(p0)&&p3)))'
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 86 transition count 86
Applied a total of 28 rules in 17 ms. Remains 86 /100 variables (removed 14) and now considering 86/100 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1593388691520472069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7848800643317865749.kers'
[2026-05-27 09:22:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1593388691520472069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7848800643317865749.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 86 cols 264 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-27 09:22:40] [INFO ] Computed 40 invariants in 0 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7848800643317865749.kers
Total runtime 1 ms.
[2026-05-27 09:22:40] [INFO ] Implicit Places using invariants in 193 ms returned []
[2026-05-27 09:22:40] [INFO ] Invariant cache hit.
[2026-05-27 09:22:40] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2026-05-27 09:22:40] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-27 09:22:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 20/86 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 86/172 variables, 86/212 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/172 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 212 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2145 ms.
Refiners :[Domain max(s): 86/86 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 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/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 20/86 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 86/172 variables, 86/212 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 46/258 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/172 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 258 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2673 ms.
Refiners :[Domain max(s): 86/86 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4827ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 4828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/100 places, 86/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5217 ms. Remains : 86/100 places, 86/100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p2)&&p1)) U (F(p0)&&p3)))'
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p3) (NOT p0)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-13 finished in 5571 ms.
All properties solved by simple procedures.
Total runtime 48934 ms.

BK_STOP 1779873766019

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-smll-177969942000124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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