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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.9M
-rw-r--r-- 1 mcc users 201K Mar 5 12:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Mar 5 12:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 171K Mar 5 12:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Mar 5 12:24 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 106K Mar 16 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 426K Mar 16 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Mar 16 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 402K Mar 16 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 271K Mar 5 12:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Mar 5 12:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 141K Mar 5 12:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 888K Mar 5 12:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Mar 16 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K 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 445K 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-000200-LTLFireability-00
FORMULA_NAME Philosophers-PT-000200-LTLFireability-01
FORMULA_NAME Philosophers-PT-000200-LTLFireability-02
FORMULA_NAME Philosophers-PT-000200-LTLFireability-03
FORMULA_NAME Philosophers-PT-000200-LTLFireability-04
FORMULA_NAME Philosophers-PT-000200-LTLFireability-05
FORMULA_NAME Philosophers-PT-000200-LTLFireability-06
FORMULA_NAME Philosophers-PT-000200-LTLFireability-07
FORMULA_NAME Philosophers-PT-000200-LTLFireability-08
FORMULA_NAME Philosophers-PT-000200-LTLFireability-09
FORMULA_NAME Philosophers-PT-000200-LTLFireability-10
FORMULA_NAME Philosophers-PT-000200-LTLFireability-11
FORMULA_NAME Philosophers-PT-000200-LTLFireability-12
FORMULA_NAME Philosophers-PT-000200-LTLFireability-13
FORMULA_NAME Philosophers-PT-000200-LTLFireability-14
FORMULA_NAME Philosophers-PT-000200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779885666450

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-000200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 12:41:08] [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 12:41:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 12:41:09] [INFO ] Load time of PNML (sax parser for PT used): 353 ms
[2026-05-27 12:41:09] [INFO ] Transformed 1000 places.
[2026-05-27 12:41:09] [INFO ] Transformed 1000 transitions.
[2026-05-27 12:41:09] [INFO ] Found NUPN structural information;
[2026-05-27 12:41:09] [INFO ] Parsed PT model containing 1000 places and 1000 transitions and 3200 arcs in 604 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 86 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-PT-000200-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 808 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 52 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (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-17154597890942653778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5728280647726190933.kers'
[2026-05-27 12:41:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17154597890942653778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5728280647726190933.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1000 rows 1000 cols 3200 entries
Finished phase 1 with 600 SingleSign rule and 0 generalized
[2026-05-27 12:41:10] [INFO ] Computed 400 invariants in 9 ms
Computed 400 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-5728280647726190933.kers
Total runtime 13 ms.
[2026-05-27 12:41:11] [INFO ] Implicit Places using invariants in 1508 ms returned []
[2026-05-27 12:41:11] [INFO ] Invariant cache hit.
[2026-05-27 12:41:13] [INFO ] Implicit Places using invariants and state equation in 1747 ms returned []
Implicit Place search using SMT with State Equation took 3305 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2026-05-27 12:41:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 800/800 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/800 variables, 200/1000 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 800/2000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30069 ms.
Refiners :[Domain max(s): 800/1000 constraints, Positive P Invariants (semi-flows): 200/400 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 800/800 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/800 variables, 200/1000 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/800 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 60576ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60610ms
Finished structural reductions in LTL mode , in 1 iterations and 64047 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 30 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:42:14] [INFO ] Invariant cache hit.
[2026-05-27 12:42:14] [INFO ] Implicit Places using invariants in 705 ms returned []
[2026-05-27 12:42:14] [INFO ] Invariant cache hit.
[2026-05-27 12:42:16] [INFO ] Implicit Places using invariants and state equation in 1413 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2152 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 808 out of 1000 places after structural reductions.
[2026-05-27 12:42:16] [INFO ] Flatten gal took : 271 ms
[2026-05-27 12:42:17] [INFO ] Flatten gal took : 145 ms
[2026-05-27 12:42:17] [INFO ] Input system was already deterministic with 1000 transitions.
Support contains 806 out of 1000 places (down from 808) after GAL structural reductions.
RANDOM walk for 31478 steps (7 resets) in 2155 ms. (14 steps per ms) remains 0/27 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 125 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:42:18] [INFO ] Invariant cache hit.
[2026-05-27 12:42:20] [INFO ] Implicit Places using invariants in 1833 ms returned []
[2026-05-27 12:42:20] [INFO ] Invariant cache hit.
[2026-05-27 12:42:23] [INFO ] Implicit Places using invariants and state equation in 2533 ms returned []
Implicit Place search using SMT with State Equation took 4369 ms to find 0 implicit places.
[2026-05-27 12:42:23] [INFO ] Redundant transitions in 107 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4613 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 320 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-00
Product exploration explored 100000 steps with 1771 reset in 4427 ms.
Product exploration explored 100000 steps with 3146 reset in 6539 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 108 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 110 steps (0 resets) in 18 ms. (5 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 112 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 94 ms :[(NOT p0), (NOT p0)]
[2026-05-27 12:42:36] [INFO ] Invariant cache hit.
[2026-05-27 12:42:49] [INFO ] [Real]Absence check using 400 positive place invariants in 8315 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15199 ms.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 58 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:42:50] [INFO ] Invariant cache hit.
[2026-05-27 12:42:51] [INFO ] Implicit Places using invariants in 1558 ms returned []
[2026-05-27 12:42:51] [INFO ] Invariant cache hit.
[2026-05-27 12:42:53] [INFO ] Implicit Places using invariants and state equation in 2246 ms returned []
Implicit Place search using SMT with State Equation took 3809 ms to find 0 implicit places.
[2026-05-27 12:42:53] [INFO ] Redundant transitions in 75 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3949 ms. Remains : 1000/1000 places, 1000/1000 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 73 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 74 steps (0 resets) in 14 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 102 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 102 ms :[(NOT p0), (NOT p0)]
[2026-05-27 12:42:55] [INFO ] Invariant cache hit.
[2026-05-27 12:43:07] [INFO ] [Real]Absence check using 400 positive place invariants in 7815 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 13894 ms.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2489 reset in 5078 ms.
Product exploration explored 100000 steps with 2090 reset in 4545 ms.
Built C files in :
/tmp/ltsmin6206964941332169801
[2026-05-27 12:43:17] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2026-05-27 12:43:17] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 12:43:17] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2026-05-27 12:43:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 12:43:18] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2026-05-27 12:43:18] [INFO ] Computation of Completed DNA matrix. took 75 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 12:43:18] [INFO ] Built C files in 509ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6206964941332169801
Running compilation step : cd /tmp/ltsmin6206964941332169801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6206964941332169801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6206964941332169801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 69 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:43:21] [INFO ] Invariant cache hit.
[2026-05-27 12:43:22] [INFO ] Implicit Places using invariants in 1228 ms returned []
[2026-05-27 12:43:22] [INFO ] Invariant cache hit.
[2026-05-27 12:43:24] [INFO ] Implicit Places using invariants and state equation in 1991 ms returned []
Implicit Place search using SMT with State Equation took 3222 ms to find 0 implicit places.
[2026-05-27 12:43:24] [INFO ] Redundant transitions in 33 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3335 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin1790596945218659970
[2026-05-27 12:43:24] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2026-05-27 12:43:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 12:43:24] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2026-05-27 12:43:24] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 12:43:24] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2026-05-27 12:43:25] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 12:43:25] [INFO ] Built C files in 400ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1790596945218659970
Running compilation step : cd /tmp/ltsmin1790596945218659970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1790596945218659970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1790596945218659970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 12:43:28] [INFO ] Flatten gal took : 63 ms
[2026-05-27 12:43:28] [INFO ] Flatten gal took : 88 ms
[2026-05-27 12:43:28] [INFO ] Time to serialize gal into /tmp/LTL2932893267775515617.gal : 32 ms
[2026-05-27 12:43:28] [INFO ] Time to serialize properties into /tmp/LTL1161483878635350336.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2932893267775515617.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16663756568332184305.hoa' '-atoms' '/tmp/LTL1161483878635350336.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1161483878635350336.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16663756568332184305.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2026-05-27 12:43:43] [INFO ] Flatten gal took : 81 ms
[2026-05-27 12:43:43] [INFO ] Flatten gal took : 77 ms
[2026-05-27 12:43:43] [INFO ] Time to serialize gal into /tmp/LTL8131181992455393770.gal : 15 ms
[2026-05-27 12:43:43] [INFO ] Time to serialize properties into /tmp/LTL5431288554676116136.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8131181992455393770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5431288554676116136.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((Eat_63==1)||(Eat_141==1))||((Eat_2==1)||(Eat_184==1)))||(((Eat_86==1)||(Eat_148==1))||((Eat_27==1)||(Eat_191==1))))||...3122
Formula 0 simplified : FG!"(((((((((Eat_63==1)||(Eat_141==1))||((Eat_2==1)||(Eat_184==1)))||(((Eat_86==1)||(Eat_148==1))||((Eat_27==1)||(Eat_191==1))))||((...3116
Detected timeout of ITS tools.
[2026-05-27 12:43:58] [INFO ] Flatten gal took : 57 ms
[2026-05-27 12:43:58] [INFO ] Applying decomposition
[2026-05-27 12:43:58] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6411578105557686942.txt' '-o' '/tmp/graph6411578105557686942.bin' '-w' '/tmp/graph6411578105557686942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6411578105557686942.bin' '-l' '-1' '-v' '-w' '/tmp/graph6411578105557686942.weights' '-q' '0' '-e' '0.001'
[2026-05-27 12:43:59] [INFO ] Decomposing Gal with order
[2026-05-27 12:43:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 12:43:59] [INFO ] Removed a total of 200 redundant transitions.
[2026-05-27 12:43:59] [INFO ] Flatten gal took : 235 ms
[2026-05-27 12:43:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 560 labels/synchronizations in 87 ms.
[2026-05-27 12:43:59] [INFO ] Time to serialize gal into /tmp/LTL2204489105025938012.gal : 31 ms
[2026-05-27 12:43:59] [INFO ] Time to serialize properties into /tmp/LTL1858305246187984036.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2204489105025938012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1858305246187984036.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((i9.u134.Eat_63==1)||(i22.u78.Eat_141==1))||((i0.i1.i1.u120.Eat_2==1)||(i14.i0.i0.u100.Eat_184==1)))||(((i8.i1.i0.u108...5231
Formula 0 simplified : FG!"(((((((((i9.u134.Eat_63==1)||(i22.u78.Eat_141==1))||((i0.i1.i1.u120.Eat_2==1)||(i14.i0.i0.u100.Eat_184==1)))||(((i8.i1.i0.u108.E...5225
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Treatment of property Philosophers-PT-000200-LTLFireability-00 finished in 116227 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((X(p1)&&p0))&&X((F(p2) U X(X(G(p1)))))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 50 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:44:15] [INFO ] Invariant cache hit.
[2026-05-27 12:44:15] [INFO ] Implicit Places using invariants in 880 ms returned []
[2026-05-27 12:44:15] [INFO ] Invariant cache hit.
[2026-05-27 12:44:17] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2214 ms. Remains : 1000/1000 places, 1000/1000 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((X(p1)&&p0))&&X((F(p2) U X(X(G(p1)))))))'
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-01
Product exploration explored 100000 steps with 57 reset in 2440 ms.
Stack based approach found an accepted trace after 274 steps with 0 reset with depth 275 and stack size 275 in 10 ms.
FORMULA Philosophers-PT-000200-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-01 finished in 5095 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 X(G(p1))) U X(X((F(!p0)&&p2)))))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:44:20] [INFO ] Invariant cache hit.
[2026-05-27 12:44:20] [INFO ] Implicit Places using invariants in 764 ms returned []
[2026-05-27 12:44:20] [INFO ] Invariant cache hit.
[2026-05-27 12:44:22] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 2083 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2095 ms. Remains : 1000/1000 places, 1000/1000 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 X(G(p1))) U X(X((F(!p0)&&p2)))))'
Stuttering acceptance computed with spot in 636 ms :[(NOT p1), (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), true, (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1600 steps with 0 reset in 64 ms.
FORMULA Philosophers-PT-000200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-03 finished in 2849 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(G(p0))&&F(p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 54 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:44:22] [INFO ] Invariant cache hit.
[2026-05-27 12:44:23] [INFO ] Implicit Places using invariants in 953 ms returned []
[2026-05-27 12:44:23] [INFO ] Invariant cache hit.
[2026-05-27 12:44:25] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 2191 ms to find 0 implicit places.
[2026-05-27 12:44:25] [INFO ] Redundant transitions in 12 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2262 ms. Remains : 1000/1000 places, 1000/1000 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(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-07
Stuttering criterion allowed to conclude after 78302 steps with 2 reset in 1165 ms.
FORMULA Philosophers-PT-000200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-07 finished in 3569 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(G(p1))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 33 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:44:26] [INFO ] Invariant cache hit.
[2026-05-27 12:44:27] [INFO ] Implicit Places using invariants in 1066 ms returned []
[2026-05-27 12:44:27] [INFO ] Invariant cache hit.
[2026-05-27 12:44:29] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 3101 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3134 ms. Remains : 1000/1000 places, 1000/1000 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(G(p1))))'
Stuttering acceptance computed with spot in 159 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-08
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-08 finished in 3326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 25 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:44:29] [INFO ] Invariant cache hit.
[2026-05-27 12:44:31] [INFO ] Implicit Places using invariants in 1452 ms returned []
[2026-05-27 12:44:31] [INFO ] Invariant cache hit.
[2026-05-27 12:44:33] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 3363 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3390 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-09
Stuttering criterion allowed to conclude after 27711 steps with 4 reset in 475 ms.
FORMULA Philosophers-PT-000200-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-09 finished in 3983 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)&&F((p2 U p3))) U G(!p2)))'
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:44:33] [INFO ] Invariant cache hit.
[2026-05-27 12:44:34] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2026-05-27 12:44:34] [INFO ] Invariant cache hit.
[2026-05-27 12:44:36] [INFO ] Implicit Places using invariants and state equation in 1787 ms returned []
Implicit Place search using SMT with State Equation took 2950 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2970 ms. Remains : 1000/1000 places, 1000/1000 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)&&F((p2 U p3))) U G(!p2)))'
Stuttering acceptance computed with spot in 191 ms :[p2, (OR (NOT p0) p1), (NOT p3), (AND p2 (NOT p0)), true, p2]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-11
Entered a terminal (fully accepting) state of product in 43204 steps with 1 reset in 402 ms.
FORMULA Philosophers-PT-000200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-11 finished in 3628 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 U p1)&&X(F(!p2)))) U !p3))))'
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:44:37] [INFO ] Invariant cache hit.
[2026-05-27 12:44:38] [INFO ] Implicit Places using invariants in 1400 ms returned []
[2026-05-27 12:44:38] [INFO ] Invariant cache hit.
[2026-05-27 12:44:40] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 3317 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3338 ms. Remains : 1000/1000 places, 1000/1000 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 U p1)&&X(F(!p2)))) U !p3))))'
Stuttering acceptance computed with spot in 229 ms :[p3, p3, p3, (OR (NOT p1) p2), (NOT p1), p2]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-12
Product exploration explored 100000 steps with 28889 reset in 5738 ms.
Product exploration explored 100000 steps with 28842 reset in 4567 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 31996 steps (6 resets) in 1154 ms. (27 steps per ms) remains 0/9 properties
Knowledge based reduction with 2 factoid took 277 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[p3, p3, p3, (OR (NOT p1) p2), (NOT p1), p2]
Knowledge-based reduction took 2546 ms.
Stuttering acceptance computed with spot in 332 ms :[p3, p3, p3, (OR (NOT p1) p2), (NOT p1), p2]
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:44:54] [INFO ] Invariant cache hit.
[2026-05-27 12:44:55] [INFO ] Implicit Places using invariants in 1453 ms returned []
[2026-05-27 12:44:55] [INFO ] Invariant cache hit.
[2026-05-27 12:44:57] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 3313 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3332 ms. Remains : 1000/1000 places, 1000/1000 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 239 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 9589 steps (1 resets) in 367 ms. (26 steps per ms) remains 0/9 properties
Knowledge based reduction with 2 factoid took 348 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[p3, p3, p3, (OR (NOT p1) p2), (NOT p1), p2]
Knowledge-based reduction took 2808 ms.
Stuttering acceptance computed with spot in 326 ms :[p3, p3, p3, (OR (NOT p1) p2), (NOT p1), p2]
Stuttering acceptance computed with spot in 295 ms :[p3, p3, p3, (OR (NOT p1) p2), (NOT p1), p2]
Product exploration explored 100000 steps with 28356 reset in 5079 ms.
Product exploration explored 100000 steps with 29359 reset in 5220 ms.
Spot run failed in 124 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin16219793978523158132
[2026-05-27 12:45:11] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16219793978523158132
Running compilation step : cd /tmp/ltsmin16219793978523158132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16219793978523158132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16219793978523158132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:45:14] [INFO ] Invariant cache hit.
[2026-05-27 12:45:15] [INFO ] Implicit Places using invariants in 1456 ms returned []
[2026-05-27 12:45:15] [INFO ] Invariant cache hit.
[2026-05-27 12:45:17] [INFO ] Implicit Places using invariants and state equation in 1867 ms returned []
Implicit Place search using SMT with State Equation took 3325 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3337 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin12785308261061745708
[2026-05-27 12:45:17] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12785308261061745708
Running compilation step : cd /tmp/ltsmin12785308261061745708;'/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 2838 ms.
Running link step : cd /tmp/ltsmin12785308261061745708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin12785308261061745708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7807376084176447742.hoa' '--buchi-type=spotba'
LTSmin run took 757 ms.
FORMULA Philosophers-PT-000200-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-PT-000200-LTLFireability-12 finished in 44125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0) U (G(p1)||F(!p2)))))))'
Support contains 5 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:45:21] [INFO ] Invariant cache hit.
[2026-05-27 12:45:23] [INFO ] Implicit Places using invariants in 1488 ms returned []
[2026-05-27 12:45:23] [INFO ] Invariant cache hit.
[2026-05-27 12:45:25] [INFO ] Implicit Places using invariants and state equation in 2202 ms returned []
Implicit Place search using SMT with State Equation took 3694 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3717 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0) U (G(p1)||F(!p2)))))))'
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND p2 (NOT p1)), (AND p2 p1 (NOT p0)), (AND (NOT p1) p2)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-13
Product exploration explored 100000 steps with 57 reset in 1556 ms.
Product exploration explored 100000 steps with 39 reset in 1574 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 142 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 780 ms. (51 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 459 ms. (86 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 3/3 properties
[2026-05-27 12:45:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 15/20 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/40 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 20/60 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 20/80 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/80 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 20/100 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 20/120 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/120 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/120 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 20/140 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/140 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/140 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 20/160 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/160 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/160 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 20/180 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/180 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/180 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 20/200 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/200 variables, 20/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/200 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 20/220 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/220 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/220 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 20/240 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/240 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/240 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 20/260 variables, 8/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/260 variables, 20/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/260 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 20/280 variables, 8/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/280 variables, 20/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/280 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 20/300 variables, 8/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/300 variables, 20/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/300 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 20/320 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/320 variables, 20/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/320 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 20/340 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/340 variables, 20/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/340 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 20/360 variables, 8/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/360 variables, 20/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/360 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 20/380 variables, 8/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/380 variables, 20/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/380 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 20/400 variables, 8/538 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/400 variables, 20/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/400 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 20/420 variables, 8/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/420 variables, 20/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/420 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 20/440 variables, 8/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/440 variables, 20/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/440 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (OVERLAPS) 20/460 variables, 8/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/460 variables, 20/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/460 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (OVERLAPS) 20/480 variables, 8/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/480 variables, 20/670 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/480 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (OVERLAPS) 20/500 variables, 8/678 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/500 variables, 20/698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/500 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (OVERLAPS) 20/520 variables, 8/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/520 variables, 20/726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/520 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (OVERLAPS) 20/540 variables, 8/734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/540 variables, 20/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/540 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 20/560 variables, 8/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/560 variables, 20/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/560 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (OVERLAPS) 20/580 variables, 8/790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/580 variables, 20/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/580 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (OVERLAPS) 20/600 variables, 8/818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/600 variables, 20/838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/600 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (OVERLAPS) 20/620 variables, 8/846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/620 variables, 20/866 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/620 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (OVERLAPS) 19/639 variables, 8/874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/639 variables, 19/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/639 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (OVERLAPS) 11/650 variables, 5/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/650 variables, 11/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/650 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (OVERLAPS) 10/660 variables, 4/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/660 variables, 10/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/660 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (OVERLAPS) 10/670 variables, 4/927 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/670 variables, 10/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/670 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (OVERLAPS) 10/680 variables, 4/941 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/680 variables, 10/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/680 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (OVERLAPS) 10/690 variables, 4/955 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/690 variables, 10/965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/690 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (OVERLAPS) 10/700 variables, 4/969 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/700 variables, 10/979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/700 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 10/710 variables, 4/983 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/710 variables, 10/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/710 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 10/720 variables, 4/997 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/720 variables, 10/1007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/720 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (OVERLAPS) 10/730 variables, 4/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/730 variables, 10/1021 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/730 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (OVERLAPS) 10/740 variables, 4/1025 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/740 variables, 10/1035 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/740 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (OVERLAPS) 10/750 variables, 4/1039 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/750 variables, 10/1049 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/750 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (OVERLAPS) 10/760 variables, 4/1053 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/760 variables, 10/1063 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/760 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (OVERLAPS) 10/770 variables, 4/1067 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/770 variables, 10/1077 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/770 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (OVERLAPS) 10/780 variables, 4/1081 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/780 variables, 10/1091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/780 variables, 0/1091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (OVERLAPS) 10/790 variables, 4/1095 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/790 variables, 10/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/790 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (OVERLAPS) 10/800 variables, 4/1109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/800 variables, 10/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/800 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (OVERLAPS) 10/810 variables, 4/1123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/810 variables, 10/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/810 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (OVERLAPS) 10/820 variables, 4/1137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/820 variables, 10/1147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/820 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 152 (OVERLAPS) 10/830 variables, 4/1151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/830 variables, 10/1161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/830 variables, 0/1161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 155 (OVERLAPS) 10/840 variables, 4/1165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/840 variables, 10/1175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/840 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 158 (OVERLAPS) 10/850 variables, 4/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/850 variables, 10/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/850 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 161 (OVERLAPS) 10/860 variables, 4/1193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/860 variables, 10/1203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/860 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 164 (OVERLAPS) 10/870 variables, 4/1207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/870 variables, 10/1217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/870 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 167 (OVERLAPS) 10/880 variables, 4/1221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/880 variables, 10/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/880 variables, 0/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 170 (OVERLAPS) 10/890 variables, 4/1235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/890 variables, 10/1245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/890 variables, 0/1245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 173 (OVERLAPS) 10/900 variables, 4/1249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/900 variables, 10/1259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/900 variables, 0/1259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 176 (OVERLAPS) 10/910 variables, 4/1263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/910 variables, 10/1273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/910 variables, 0/1273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 179 (OVERLAPS) 10/920 variables, 4/1277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/920 variables, 10/1287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/920 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 182 (OVERLAPS) 10/930 variables, 4/1291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/930 variables, 10/1301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/930 variables, 0/1301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 185 (OVERLAPS) 10/940 variables, 4/1305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/940 variables, 10/1315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/940 variables, 0/1315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 188 (OVERLAPS) 10/950 variables, 4/1319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/950 variables, 10/1329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/950 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 191 (OVERLAPS) 10/960 variables, 4/1333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/960 variables, 10/1343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/960 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 194 (OVERLAPS) 10/970 variables, 4/1347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/970 variables, 10/1357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/970 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 197 (OVERLAPS) 10/980 variables, 4/1361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/980 variables, 10/1371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/980 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 200 (OVERLAPS) 10/990 variables, 4/1375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/990 variables, 10/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/990 variables, 0/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 203 (OVERLAPS) 9/999 variables, 4/1389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/999 variables, 9/1398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/999 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 206 (OVERLAPS) 1/1000 variables, 1/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/1000 variables, 1/1400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1000 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 209 (OVERLAPS) 1000/2000 variables, 1000/2400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/2000 variables, 0/2400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 211 (OVERLAPS) 0/2000 variables, 0/2400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2000/2000 variables, and 2400 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4910 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Int declared 20/2000 variables, and 11 constraints, problems are : Problem set: 3 solved, 0 unsolved in 60 ms.
Refiners :[Domain max(s): 5/1000 constraints, Positive P Invariants (semi-flows): 6/400 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4987ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 6 factoid took 293 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[p2, p2]
Knowledge-based reduction took 7698 ms.
Stuttering acceptance computed with spot in 97 ms :[p2, p2]
Support contains 2 out of 1000 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 : 1000/1000 places, 1000/1000 transitions.
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 196
Deduced a syphon composed of 196 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 0 with 392 rules applied. Total rules applied 392 place count 804 transition count 804
Applied a total of 392 rules in 254 ms. Remains 804 /1000 variables (removed 196) and now considering 804/1000 (removed 196) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13875336490957589440.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7390935315227058844.kers'
[2026-05-27 12:45:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13875336490957589440.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7390935315227058844.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 804 rows 804 cols 2416 entries
Finished phase 1 with 404 SingleSign rule and 0 generalized
[2026-05-27 12:45:36] [INFO ] Computed 400 invariants in 8 ms
Computed 400 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7390935315227058844.kers
Total runtime 11 ms.
[2026-05-27 12:45:38] [INFO ] Implicit Places using invariants in 1514 ms returned []
[2026-05-27 12:45:38] [INFO ] Invariant cache hit.
[2026-05-27 12:45:40] [INFO ] Implicit Places using invariants and state equation in 2252 ms returned []
Implicit Place search using SMT with State Equation took 3768 ms to find 0 implicit places.
[2026-05-27 12:45:40] [INFO ] Redundant transitions in 8 ms returned []
Running 404 sub problems to find dead transitions.
[2026-05-27 12:45:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 604/604 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 200/804 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 200/804 variables, 200/1004 constraints. Problems are: Problem set: 0 solved, 404 unsolved
SMT process timed out in 30083ms, After SMT, problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 30086ms
Starting structural reductions in SI_LTL mode, iteration 1 : 804/1000 places, 804/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34126 ms. Remains : 804/1000 places, 804/1000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 87 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 1217 steps (0 resets) in 51 ms. (23 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 93 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 69 ms :[p2, p2]
Knowledge-based reduction took 1916 ms.
Stuttering acceptance computed with spot in 70 ms :[p2, p2]
Stuttering acceptance computed with spot in 66 ms :[p2, p2]
Product exploration explored 100000 steps with 49 reset in 2004 ms.
Stack based approach found an accepted trace after 928 steps with 0 reset with depth 929 and stack size 927 in 45 ms.
FORMULA Philosophers-PT-000200-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-13 finished in 53192 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(p2)||p1))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (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-7582480290807918712.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14445895574810160779.kers'
[2026-05-27 12:46:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7582480290807918712.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14445895574810160779.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1000 rows 1000 cols 3200 entries
Finished phase 1 with 600 SingleSign rule and 0 generalized
[2026-05-27 12:46:14] [INFO ] Computed 400 invariants in 8 ms
Computed 400 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14445895574810160779.kers
Total runtime 10 ms.
[2026-05-27 12:46:16] [INFO ] Implicit Places using invariants in 1653 ms returned []
[2026-05-27 12:46:16] [INFO ] Invariant cache hit.
[2026-05-27 12:46:18] [INFO ] Implicit Places using invariants and state equation in 1966 ms returned []
Implicit Place search using SMT with State Equation took 3622 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2026-05-27 12:46:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 800/800 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/800 variables, 200/1000 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 800/2000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Domain max(s): 800/1000 constraints, Positive P Invariants (semi-flows): 200/400 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 800/800 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/800 variables, 200/1000 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/800 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 200/1000 variables, 200/1200 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 200/1400 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2000 variables, and 1400 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Finished structural reductions in LTL mode , in 1 iterations and 63824 ms. Remains : 1000/1000 places, 1000/1000 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(p2)||p1))))'
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-14
Entered a terminal (fully accepting) state of product in 39041 steps with 19494 reset in 1753 ms.
FORMULA Philosophers-PT-000200-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-14 finished in 65779 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||X(X(p1)))&&(p2||X(G(p3))))))'
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-27 12:47:20] [INFO ] Invariant cache hit.
[2026-05-27 12:47:21] [INFO ] Implicit Places using invariants in 1353 ms returned []
[2026-05-27 12:47:21] [INFO ] Invariant cache hit.
[2026-05-27 12:47:23] [INFO ] Implicit Places using invariants and state equation in 1848 ms returned []
Implicit Place search using SMT with State Equation took 3203 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3217 ms. Remains : 1000/1000 places, 1000/1000 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(X(p0))||p1)&&(p2||X(G(p3))))))'
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p3), (NOT p0), true]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-15 finished in 3524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Spot run failed in 82 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-27 12:47:24] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9339030313735883793
[2026-05-27 12:47:24] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2026-05-27 12:47:24] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 12:47:24] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2026-05-27 12:47:24] [INFO ] Applying decomposition
[2026-05-27 12:47:24] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 12:47:24] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13160199380548254981.txt' '-o' '/tmp/graph13160199380548254981.bin' '-w' '/tmp/graph13160199380548254981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13160199380548254981.bin' '-l' '-1' '-v' '-w' '/tmp/graph13160199380548254981.weights' '-q' '0' '-e' '0.001'
[2026-05-27 12:47:24] [INFO ] Decomposing Gal with order
[2026-05-27 12:47:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 12:47:24] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2026-05-27 12:47:24] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 12:47:24] [INFO ] Removed a total of 193 redundant transitions.
[2026-05-27 12:47:24] [INFO ] Built C files in 474ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9339030313735883793
Running compilation step : cd /tmp/ltsmin9339030313735883793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-27 12:47:24] [INFO ] Flatten gal took : 118 ms
[2026-05-27 12:47:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 578 labels/synchronizations in 36 ms.
[2026-05-27 12:47:24] [INFO ] Time to serialize gal into /tmp/LTLFireability1988654609452057662.gal : 13 ms
[2026-05-27 12:47:24] [INFO ] Time to serialize properties into /tmp/LTLFireability6013771825925243131.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1988654609452057662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6013771825925243131.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((i18.i0.i0.u131.Eat_63==1)||(i10.u156.Eat_141==1))||((i14.u21.Eat_2==1)||(i4.u179.Eat_184==1)))||(((i9.i0.i1.u68.Eat_8...5332
Formula 0 simplified : FG!"(((((((((i18.i0.i0.u131.Eat_63==1)||(i10.u156.Eat_141==1))||((i14.u21.Eat_2==1)||(i4.u179.Eat_184==1)))||(((i9.i0.i1.u68.Eat_86=...5326
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Compilation finished in 5236 ms.
Running link step : cd /tmp/ltsmin9339030313735883793;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin9339030313735883793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
3180 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,32.0038,635060,1,0,1.79771e+06,879,5266,740445,382,3265,714287
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000200-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 411412 ms.

BK_STOP 1779886080388

--------------------
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-000200"
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-000200, 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-177969942000148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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