fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r210-smll-177969942100300
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16198.880 3600000.00 5429852.00 169760.40 TFTTFFFTTFFFFTF? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r210-smll-177969942100300.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 PolyORBLF-COL-S02J06T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-177969942100300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.2K Mar 8 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 8 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Mar 8 15:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Mar 8 15:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 16 08:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 16 08:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 16 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 8 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Mar 8 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 8 15:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 8 15:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 16 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J06T08-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780053502149

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202604301425
[2026-05-29 11:18:23] [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-29 11:18:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-29 11:18:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-29 11:18:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-29 11:18:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1029 ms
[2026-05-29 11:18:25] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2026-05-29 11:18:25] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 8 ms.
[2026-05-29 11:18:25] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 32 to 30
RANDOM walk for 40000 steps (21 resets) in 1305 ms. (30 steps per ms) remains 6/30 properties
BEST_FIRST walk for 40000 steps (61 resets) in 522 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (13 resets) in 404 ms. (98 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (27 resets) in 424 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 336 ms. (118 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (50 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (23 resets) in 200 ms. (199 steps per ms) remains 6/6 properties
[2026-05-29 11:18:26] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3522275579000850314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10877090507806173398.kers'
[2026-05-29 11:18:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3522275579000850314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10877090507806173398.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 64 rows 73 cols 204 entries
Finished phase 1 with 43 SingleSign rule and 12 generalized
[2026-05-29 11:18:26] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10877090507806173398.kers
Total runtime 2 ms.
[2026-05-29 11:18:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 3 (OVERLAPS) 53/77 variables, 17/22 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/22 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/80 variables, 3/25 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/81 variables, 1/26 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 5 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 5 solved, 1 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/67 variables, 6/15 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/16 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/77 variables, 10/26 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/26 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/27 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/79 variables, 1/28 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/28 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 64/143 variables, 79/107 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 8/115 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 1/116 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 0/116 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/145 variables, 2/118 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 1/119 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 0/119 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/145 variables, 0/119 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 119 constraints, problems are : Problem set: 5 solved, 1 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1026ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 52 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
Running 43 sub problems to find dead transitions.
[2026-05-29 11:18:27] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15907339932245311593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6676549196138840336.kers'
[2026-05-29 11:18:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15907339932245311593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6676549196138840336.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 43 rows 51 cols 174 entries
Finished phase 1 with 22 SingleSign rule and 12 generalized
[2026-05-29 11:18:27] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6676549196138840336.kers
Total runtime 2 ms.
[2026-05-29 11:18:27] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/59 variables, 1/29 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 3/32 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 43/102 variables, 59/91 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 8/99 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 99 constraints, problems are : Problem set: 2 solved, 41 unsolved in 2540 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 16/24 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/29 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/32 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 2/34 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 43/102 variables, 59/94 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 8/102 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 41/143 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 1/144 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/144 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 14 (OVERLAPS) 0/102 variables, 0/144 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 144 constraints, problems are : Problem set: 2 solved, 41 unsolved in 3950 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 41/43 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6528ms problems are : Problem set: 2 solved, 41 unsolved
Search for dead transitions found 2 dead transitions in 6530ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/81 places, 42/65 transitions.
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 194 edges and 57 vertex of which 1 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 39 output transitions
Drop transitions (Output transitions of discarded places.) removed 39 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 5 ms. Remains 1 /59 variables (removed 58) and now considering 0/42 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6619 ms. Remains : 1/81 places, 0/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-29 11:18:34] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2026-05-29 11:18:34] [INFO ] Flatten gal took : 49 ms
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-29 11:18:34] [INFO ] Flatten gal took : 17 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2026-05-29 11:18:34] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 68 ms.
[2026-05-29 11:18:34] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 335 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 110 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2026-05-29 11:18:34] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7680599411145265264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13788805944398925049.kers'
[2026-05-29 11:18:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7680599411145265264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13788805944398925049.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 2 ms.
// Phase 1: matrix 1274 rows 667 cols 5078 entries
Finished phase 1 with 431 SingleSign rule and 189 generalized
[2026-05-29 11:18:34] [INFO ] Computed 52 invariants in 19 ms
Computed 52 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-13788805944398925049.kers
Total runtime 21 ms.
[2026-05-29 11:18:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
SMT process timed out in 22407ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 22422ms
[2026-05-29 11:18:57] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:18:57] [INFO ] Invariant cache hit.
[2026-05-29 11:18:58] [INFO ] Implicit Places using invariants in 790 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 805 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/690 places, 1290/1306 transitions.
Applied a total of 0 rules in 17 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23365 ms. Remains : 664/690 places, 1290/1306 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 16 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2026-05-29 11:18:58] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3415261463799187809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17875894934549172061.kers'
[2026-05-29 11:18:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3415261463799187809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17875894934549172061.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1274 rows 659 cols 5062 entries
Finished phase 1 with 431 SingleSign rule and 189 generalized
[2026-05-29 11:18:58] [INFO ] Computed 44 invariants in 11 ms
Computed 44 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-17875894934549172061.kers
Total runtime 14 ms.
[2026-05-29 11:18:58] [INFO ] State equation strengthened by 96 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
SMT process timed out in 20855ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 20860ms
[2026-05-29 11:19:18] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:19:18] [INFO ] Invariant cache hit.
[2026-05-29 11:19:20] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2026-05-29 11:19:20] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:19:20] [INFO ] Invariant cache hit.
[2026-05-29 11:19:21] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:19:27] [INFO ] Implicit Places using invariants and state equation in 7138 ms returned []
Implicit Place search using SMT with State Equation took 8187 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 29068 ms. Remains : 664/664 places, 1290/1290 transitions.
Support contains 335 out of 664 places after structural reductions.
[2026-05-29 11:19:27] [INFO ] Flatten gal took : 170 ms
[2026-05-29 11:19:27] [INFO ] Flatten gal took : 173 ms
[2026-05-29 11:19:27] [INFO ] Input system was already deterministic with 1290 transitions.
Support contains 325 out of 664 places (down from 335) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 24
RANDOM walk for 40000 steps (15 resets) in 443 ms. (90 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40002 steps (27 resets) in 532 ms. (75 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 526 ms. (75 steps per ms) remains 2/2 properties
[2026-05-29 11:19:28] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:19:28] [INFO ] Invariant cache hit.
[2026-05-29 11:19:28] [INFO ] State equation strengthened by 96 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 551/594 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 25/619 variables, 7/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/619 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/661 variables, 20/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/664 variables, 3/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1938/1938 variables, and 708 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1642 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 664/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 573/581 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/607 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/658 variables, 29/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 6/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/662 variables, 4/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1936/1938 variables, and 712 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4104 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 662/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5774ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 8 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 664 transition count 1234
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 608 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 608 transition count 1154
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 528 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 464 transition count 1090
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 408 place count 456 transition count 1082
Iterating global reduction 2 with 8 rules applied. Total rules applied 416 place count 456 transition count 1082
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 432 place count 456 transition count 1066
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 448 place count 440 transition count 1066
Applied a total of 448 rules in 271 ms. Remains 440 /664 variables (removed 224) and now considering 1066/1290 (removed 224) transitions.
Running 1064 sub problems to find dead transitions.
[2026-05-29 11:19:34] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17677301666530637270.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1125442472401873588.kers'
[2026-05-29 11:19:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17677301666530637270.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1125442472401873588.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1050 rows 435 cols 4958 entries
Finished phase 1 with 199 SingleSign rule and 197 generalized
[2026-05-29 11:19:34] [INFO ] Computed 44 invariants in 8 ms
Computed 44 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-1125442472401873588.kers
Total runtime 10 ms.
[2026-05-29 11:19:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 53 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 54 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41102ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 41107ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41382 ms. Remains : 440/664 places, 1066/1290 transitions.
RANDOM walk for 40000 steps (20 resets) in 445 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 238275 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 238275 steps, saw 133117 distinct states, run finished after 3007 ms. (steps per millisecond=79 ) properties seen :0
[2026-05-29 11:20:18] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2026-05-29 11:20:18] [INFO ] Invariant cache hit.
[2026-05-29 11:20:18] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 215/252 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/327 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/435 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1050/1488 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1488 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1490 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1490 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1490 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 587 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2626 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 215/252 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/327 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/435 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/438 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1050/1488 variables, 438/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1488 variables, 96/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1490 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1490 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1490 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 590 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3270 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5910ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 253 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 53 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 50 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2026-05-29 11:20:25] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2026-05-29 11:20:25] [INFO ] Invariant cache hit.
[2026-05-29 11:20:26] [INFO ] Implicit Places using invariants in 1539 ms returned []
[2026-05-29 11:20:26] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2026-05-29 11:20:26] [INFO ] Invariant cache hit.
[2026-05-29 11:20:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:20:39] [INFO ] Implicit Places using invariants and state equation in 13143 ms returned []
Implicit Place search using SMT with State Equation took 14692 ms to find 0 implicit places.
[2026-05-29 11:20:39] [INFO ] Redundant transitions in 93 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14851 ms. Remains : 440/440 places, 1066/1066 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 440 transition count 1050
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 32 place count 432 transition count 1082
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 64 place count 432 transition count 1050
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 432 transition count 1042
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 80 place count 424 transition count 1042
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 424 transition count 1034
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 416 transition count 1034
Applied a total of 96 rules in 195 ms. Remains 416 /440 variables (removed 24) and now considering 1034/1066 (removed 32) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16809890355422624129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12999344597655967545.kers'
[2026-05-29 11:20:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16809890355422624129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12999344597655967545.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1034 rows 411 cols 5094 entries
Finished phase 1 with 175 SingleSign rule and 197 generalized
[2026-05-29 11:20:40] [INFO ] Computed 44 invariants in 16 ms
Computed 44 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-12999344597655967545.kers
Total runtime 19 ms.
[2026-05-29 11:20:40] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2026-05-29 11:20:40] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 40 ms returned sat
[2026-05-29 11:20:41] [INFO ] After 1049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-29 11:20:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2026-05-29 11:20:41] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 34 ms returned sat
[2026-05-29 11:20:42] [INFO ] After 1260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-29 11:20:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1595 ms
TRAPS : Iteration 1
[2026-05-29 11:20:44] [INFO ] After 3066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-29 11:20:44] [INFO ] After 3340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 4634 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X(X(!p1)) U (p2&&X(X(!p1)))))||p0)))'
Support contains 16 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 19 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2026-05-29 11:20:45] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1487799755896332116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15428414642785857681.kers'
[2026-05-29 11:20:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1487799755896332116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15428414642785857681.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 2 ms.
// Phase 1: matrix 1274 rows 659 cols 5062 entries
Finished phase 1 with 431 SingleSign rule and 189 generalized
[2026-05-29 11:20:45] [INFO ] Computed 44 invariants in 20 ms
Computed 44 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-15428414642785857681.kers
Total runtime 23 ms.
[2026-05-29 11:20:45] [INFO ] State equation strengthened by 96 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
SMT process timed out in 20758ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 20766ms
[2026-05-29 11:21:05] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:21:05] [INFO ] Invariant cache hit.
[2026-05-29 11:21:07] [INFO ] Implicit Places using invariants in 1225 ms returned []
[2026-05-29 11:21:07] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:21:07] [INFO ] Invariant cache hit.
[2026-05-29 11:21:08] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:21:22] [INFO ] Implicit Places using invariants and state equation in 15057 ms returned []
Implicit Place search using SMT with State Equation took 16284 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 37081 ms. Remains : 664/664 places, 1290/1290 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((X(X(!p1)) U (p2&&X(X(!p1)))))||p0)))'
Stuttering acceptance computed with spot in 560 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-00
Product exploration explored 100000 steps with 10824 reset in 961 ms.
Product exploration explored 100000 steps with 10846 reset in 551 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 9 factoid took 91 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 40000 steps (10 resets) in 481 ms. (82 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (9 resets) in 470 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
[2026-05-29 11:21:24] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:21:24] [INFO ] Invariant cache hit.
[2026-05-29 11:21:24] [INFO ] State equation strengthened by 96 read => feed constraints.
Problem apf0 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 16/1938 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 0/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 11 factoid took 149 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
[2026-05-29 11:21:25] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:21:25] [INFO ] Invariant cache hit.
[2026-05-29 11:21:26] [INFO ] [Real]Absence check using 15 positive place invariants in 51 ms returned sat
[2026-05-29 11:21:28] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 1738 ms returned sat
[2026-05-29 11:21:40] [INFO ] [Real]Absence check using state equation in 11807 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15802 ms.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 8 out of 664 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 : 664/664 places, 1290/1290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 664 transition count 1250
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 624 transition count 1250
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 80 place count 624 transition count 1162
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 256 place count 536 transition count 1162
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 352 place count 488 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 360 place count 480 transition count 1106
Iterating global reduction 2 with 8 rules applied. Total rules applied 368 place count 480 transition count 1106
Applied a total of 368 rules in 121 ms. Remains 480 /664 variables (removed 184) and now considering 1106/1290 (removed 184) transitions.
Running 1104 sub problems to find dead transitions.
[2026-05-29 11:21:40] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7470757001001165184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12903302239139891664.kers'
[2026-05-29 11:21:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7470757001001165184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12903302239139891664.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1090 rows 475 cols 4742 entries
Finished phase 1 with 239 SingleSign rule and 197 generalized
[2026-05-29 11:21:40] [INFO ] Computed 44 invariants in 16 ms
Computed 44 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-12903302239139891664.kers
Total runtime 18 ms.
[2026-05-29 11:21:40] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1570 variables, and 51 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1570 variables, and 55 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40845ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 40850ms
[2026-05-29 11:22:21] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2026-05-29 11:22:21] [INFO ] Invariant cache hit.
[2026-05-29 11:22:22] [INFO ] Implicit Places using invariants in 1361 ms returned []
[2026-05-29 11:22:22] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2026-05-29 11:22:22] [INFO ] Invariant cache hit.
[2026-05-29 11:22:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:22:35] [INFO ] Implicit Places using invariants and state equation in 13285 ms returned []
Implicit Place search using SMT with State Equation took 14648 ms to find 0 implicit places.
[2026-05-29 11:22:35] [INFO ] Redundant transitions in 12 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 480/664 places, 1106/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55645 ms. Remains : 480/664 places, 1106/1290 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 67 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 33 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 62 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 76 ms :[(NOT p0), (NOT p0)]
[2026-05-29 11:22:36] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2026-05-29 11:22:36] [INFO ] Invariant cache hit.
[2026-05-29 11:22:37] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2026-05-29 11:22:39] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 2160 ms returned sat
[2026-05-29 11:22:51] [INFO ] [Real]Absence check using state equation in 11746 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15244 ms.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10823 reset in 363 ms.
Product exploration explored 100000 steps with 10799 reset in 718 ms.
Built C files in :
/tmp/ltsmin17969627563541697023
[2026-05-29 11:22:52] [INFO ] Computing symmetric may disable matrix : 1106 transitions.
[2026-05-29 11:22:52] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-29 11:22:52] [INFO ] Computing symmetric may enable matrix : 1106 transitions.
[2026-05-29 11:22:52] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-29 11:22:52] [INFO ] Computing Do-Not-Accords matrix : 1106 transitions.
[2026-05-29 11:22:52] [INFO ] Computation of Completed DNA matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-29 11:22:52] [INFO ] Built C files in 392ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17969627563541697023
Running compilation step : cd /tmp/ltsmin17969627563541697023;'/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/ltsmin17969627563541697023;'/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/ltsmin17969627563541697023;'/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 8 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 1106/1106 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 480 transition count 1098
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 472 transition count 1098
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 464 transition count 1090
Applied a total of 32 rules in 49 ms. Remains 464 /480 variables (removed 16) and now considering 1090/1106 (removed 16) transitions.
Running 1088 sub problems to find dead transitions.
[2026-05-29 11:22:55] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12226340132070932298.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13461541843554056213.kers'
[2026-05-29 11:22:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12226340132070932298.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13461541843554056213.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1074 rows 459 cols 4718 entries
Finished phase 1 with 223 SingleSign rule and 197 generalized
[2026-05-29 11:22:55] [INFO ] Computed 44 invariants in 10 ms
Computed 44 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-13461541843554056213.kers
Total runtime 12 ms.
[2026-05-29 11:22:55] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1538 variables, and 53 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1538 variables, and 54 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40709ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 40713ms
[2026-05-29 11:23:36] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2026-05-29 11:23:36] [INFO ] Invariant cache hit.
[2026-05-29 11:23:37] [INFO ] Implicit Places using invariants in 1142 ms returned []
[2026-05-29 11:23:37] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2026-05-29 11:23:37] [INFO ] Invariant cache hit.
[2026-05-29 11:23:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:23:46] [INFO ] Implicit Places using invariants and state equation in 8806 ms returned []
Implicit Place search using SMT with State Equation took 9954 ms to find 0 implicit places.
[2026-05-29 11:23:46] [INFO ] Redundant transitions in 77 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 464/480 places, 1090/1106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50807 ms. Remains : 464/480 places, 1090/1106 transitions.
Built C files in :
/tmp/ltsmin15976324491121585779
[2026-05-29 11:23:46] [INFO ] Computing symmetric may disable matrix : 1090 transitions.
[2026-05-29 11:23:46] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-29 11:23:46] [INFO ] Computing symmetric may enable matrix : 1090 transitions.
[2026-05-29 11:23:46] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-29 11:23:46] [INFO ] Computing Do-Not-Accords matrix : 1090 transitions.
[2026-05-29 11:23:47] [INFO ] Computation of Completed DNA matrix. took 128 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-29 11:23:47] [INFO ] Built C files in 365ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15976324491121585779
Running compilation step : cd /tmp/ltsmin15976324491121585779;'/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/ltsmin15976324491121585779;'/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/ltsmin15976324491121585779;'/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-29 11:23:50] [INFO ] Flatten gal took : 79 ms
[2026-05-29 11:23:50] [INFO ] Flatten gal took : 74 ms
[2026-05-29 11:23:50] [INFO ] Time to serialize gal into /tmp/LTL15172278775364230660.gal : 27 ms
[2026-05-29 11:23:50] [INFO ] Time to serialize properties into /tmp/LTL17658514400682424168.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15172278775364230660.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14873661826317284723.hoa' '-atoms' '/tmp/LTL17658514400682424168.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...320
Loading property file /tmp/LTL17658514400682424168.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14873661826317284723.hoa
Detected timeout of ITS tools.
[2026-05-29 11:24:05] [INFO ] Flatten gal took : 59 ms
[2026-05-29 11:24:05] [INFO ] Flatten gal took : 58 ms
[2026-05-29 11:24:05] [INFO ] Time to serialize gal into /tmp/LTL12661127420009406189.gal : 12 ms
[2026-05-29 11:24:05] [INFO ] Time to serialize properties into /tmp/LTL14611389590412078692.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12661127420009406189.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14611389590412078692.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...277
Read 1 LTL properties
Checking formula 0 : !((F(("((((QueueJobE_1>=1)||(QueueJobE_0>=1))||((QueueJobE_3>=1)||(QueueJobE_2>=1)))||(((QueueJobE_5>=1)||(QueueJobE_4>=1))||((QueueJo...795
Formula 0 simplified : G(!"((((QueueJobE_1>=1)||(QueueJobE_0>=1))||((QueueJobE_3>=1)||(QueueJobE_2>=1)))||(((QueueJobE_5>=1)||(QueueJobE_4>=1))||((QueueJob...561
Detected timeout of ITS tools.
[2026-05-29 11:24:20] [INFO ] Flatten gal took : 44 ms
[2026-05-29 11:24:20] [INFO ] Applying decomposition
[2026-05-29 11:24:20] [INFO ] Flatten gal took : 48 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/graph13989483049530944966.txt' '-o' '/tmp/graph13989483049530944966.bin' '-w' '/tmp/graph13989483049530944966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13989483049530944966.bin' '-l' '-1' '-v' '-w' '/tmp/graph13989483049530944966.weights' '-q' '0' '-e' '0.001'
[2026-05-29 11:24:21] [INFO ] Decomposing Gal with order
[2026-05-29 11:24:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 11:24:21] [INFO ] Removed a total of 932 redundant transitions.
[2026-05-29 11:24:21] [INFO ] Flatten gal took : 368 ms
[2026-05-29 11:24:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 77 ms.
[2026-05-29 11:24:21] [INFO ] Time to serialize gal into /tmp/LTL17726353408320221956.gal : 29 ms
[2026-05-29 11:24:21] [INFO ] Time to serialize properties into /tmp/LTL12225742950349426601.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17726353408320221956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12225742950349426601.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...256
Read 1 LTL properties
Checking formula 0 : !((F(("((((i0.u6.QueueJobE_1>=1)||(i0.u6.QueueJobE_0>=1))||((i0.u6.QueueJobE_3>=1)||(i0.u6.QueueJobE_2>=1)))||(((i0.u6.QueueJobE_5>=1)...995
Formula 0 simplified : G(!"((((i0.u6.QueueJobE_1>=1)||(i0.u6.QueueJobE_0>=1))||((i0.u6.QueueJobE_3>=1)||(i0.u6.QueueJobE_2>=1)))||(((i0.u6.QueueJobE_5>=1)|...709
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-00 finished in 231708 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) U X((p1 U X(X(p2)))))||(p1 U p3)))'
Support contains 34 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 19 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2026-05-29 11:24:36] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6546144165327966359.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15675354713670750064.kers'
[2026-05-29 11:24:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6546144165327966359.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15675354713670750064.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1274 rows 659 cols 5062 entries
Finished phase 1 with 431 SingleSign rule and 189 generalized
[2026-05-29 11:24:36] [INFO ] Computed 44 invariants in 11 ms
Computed 44 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-15675354713670750064.kers
Total runtime 13 ms.
[2026-05-29 11:24:36] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 46 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 51 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40883ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 40889ms
[2026-05-29 11:25:17] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:25:17] [INFO ] Invariant cache hit.
[2026-05-29 11:25:19] [INFO ] Implicit Places using invariants in 1331 ms returned []
[2026-05-29 11:25:19] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:25:19] [INFO ] Invariant cache hit.
[2026-05-29 11:25:20] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:25:38] [INFO ] Implicit Places using invariants and state equation in 19789 ms returned []
Implicit Place search using SMT with State Equation took 21125 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 62039 ms. Remains : 664/664 places, 1290/1290 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) U X((p1 U X(X(p2)))))||(p1 U p3)))'
Stuttering acceptance computed with spot in 817 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-01
Stuttering criterion allowed to conclude after 16550 steps with 0 reset in 142 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-01 finished in 63072 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)||(F(p2)&&p1))))'
Support contains 84 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 34 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 11:25:39] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:25:39] [INFO ] Invariant cache hit.
[2026-05-29 11:25:41] [INFO ] Implicit Places using invariants in 1336 ms returned []
[2026-05-29 11:25:41] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:25:41] [INFO ] Invariant cache hit.
[2026-05-29 11:25:42] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:25:53] [INFO ] Implicit Places using invariants and state equation in 12183 ms returned []
Implicit Place search using SMT with State Equation took 13525 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 13560 ms. Remains : 664/664 places, 1290/1290 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)||(F(p2)&&p1))))'
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 1193 ms.
Product exploration explored 100000 steps with 50000 reset in 910 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 9 factoid took 48 ms. Proved property starting from automaton with 4 states, 5 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 61 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-02 finished in 15916 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((G(p1)||p0)))))'
Support contains 78 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 12 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 11:25:55] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:25:55] [INFO ] Invariant cache hit.
[2026-05-29 11:25:57] [INFO ] Implicit Places using invariants in 1581 ms returned []
[2026-05-29 11:25:57] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:25:57] [INFO ] Invariant cache hit.
[2026-05-29 11:25:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:26:14] [INFO ] Implicit Places using invariants and state equation in 17432 ms returned []
Implicit Place search using SMT with State Equation took 19030 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 19045 ms. Remains : 664/664 places, 1290/1290 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-03
Product exploration explored 100000 steps with 2968 reset in 1280 ms.
Product exploration explored 100000 steps with 2970 reset in 1015 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 122 steps (0 resets) in 10 ms. (11 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2026-05-29 11:26:17] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:26:17] [INFO ] Invariant cache hit.
[2026-05-29 11:26:20] [INFO ] [Real]Absence check using 15 positive place invariants in 126 ms returned sat
[2026-05-29 11:26:21] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 912 ms returned sat
[2026-05-29 11:26:25] [INFO ] [Real]Absence check using state equation in 4279 ms returned sat
[2026-05-29 11:26:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-29 11:26:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 302 ms returned sat
[2026-05-29 11:26:28] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 350 ms returned sat
[2026-05-29 11:26:40] [INFO ] [Nat]Absence check using state equation in 11630 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 23177 ms.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 78 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 11 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 11:26:40] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:26:40] [INFO ] Invariant cache hit.
[2026-05-29 11:26:41] [INFO ] Implicit Places using invariants in 1314 ms returned []
[2026-05-29 11:26:41] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:26:41] [INFO ] Invariant cache hit.
[2026-05-29 11:26:42] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:26:58] [INFO ] Implicit Places using invariants and state equation in 16491 ms returned []
Implicit Place search using SMT with State Equation took 17807 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 17820 ms. Remains : 664/664 places, 1290/1290 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 5 factoid took 48 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 140 steps (0 resets) in 12 ms. (10 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2026-05-29 11:26:58] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:26:58] [INFO ] Invariant cache hit.
[2026-05-29 11:27:01] [INFO ] [Real]Absence check using 15 positive place invariants in 114 ms returned sat
[2026-05-29 11:27:01] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 878 ms returned sat
[2026-05-29 11:27:06] [INFO ] [Real]Absence check using state equation in 4184 ms returned sat
[2026-05-29 11:27:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-29 11:27:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 202 ms returned sat
[2026-05-29 11:27:08] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 334 ms returned sat
[2026-05-29 11:27:21] [INFO ] [Nat]Absence check using state equation in 12522 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 22865 ms.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2968 reset in 1561 ms.
Product exploration explored 100000 steps with 2967 reset in 2000 ms.
Spot run failed in 117 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/ltsmin17023275768720573379
[2026-05-29 11:27:25] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17023275768720573379
Running compilation step : cd /tmp/ltsmin17023275768720573379;'/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/ltsmin17023275768720573379;'/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/ltsmin17023275768720573379;'/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 78 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 11 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 11:27:28] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:27:28] [INFO ] Invariant cache hit.
[2026-05-29 11:27:30] [INFO ] Implicit Places using invariants in 2008 ms returned []
[2026-05-29 11:27:30] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:27:30] [INFO ] Invariant cache hit.
[2026-05-29 11:27:31] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:27:46] [INFO ] Implicit Places using invariants and state equation in 16257 ms returned []
Implicit Place search using SMT with State Equation took 18267 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 18279 ms. Remains : 664/664 places, 1290/1290 transitions.
Built C files in :
/tmp/ltsmin6035279568730189848
[2026-05-29 11:27:46] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6035279568730189848
Running compilation step : cd /tmp/ltsmin6035279568730189848;'/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/ltsmin6035279568730189848;'/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/ltsmin6035279568730189848;'/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-29 11:27:49] [INFO ] Flatten gal took : 49 ms
[2026-05-29 11:27:49] [INFO ] Flatten gal took : 45 ms
[2026-05-29 11:27:49] [INFO ] Time to serialize gal into /tmp/LTL1411182508555351105.gal : 9 ms
[2026-05-29 11:27:49] [INFO ] Time to serialize properties into /tmp/LTL5294408376783778708.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1411182508555351105.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4480656964702588755.hoa' '-atoms' '/tmp/LTL5294408376783778708.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...317
Loading property file /tmp/LTL5294408376783778708.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4480656964702588755.hoa
Detected timeout of ITS tools.
[2026-05-29 11:28:04] [INFO ] Flatten gal took : 40 ms
[2026-05-29 11:28:04] [INFO ] Flatten gal took : 40 ms
[2026-05-29 11:28:04] [INFO ] Time to serialize gal into /tmp/LTL8746673167195358998.gal : 9 ms
[2026-05-29 11:28:04] [INFO ] Time to serialize properties into /tmp/LTL10845335119018662989.ltl : 2 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/LTL8746673167195358998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10845335119018662989.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((((((((G("((((Try_Check_Sources_B_5>=1)||(Try_Check_Sources_B_4>=1))||((Try_Check_Sources_B_7>=1)||(Try_Check_Sources_B_6>=1)...6140
Formula 0 simplified : XXG(!"((((((((CreatedJobs_2>=1)&&(ScheduleTaskE_Work_15>=1))||((CreatedJobs_7>=1)&&(ScheduleTaskE_Work_45>=1)))||(((CreatedJobs_6>=1...6118
Detected timeout of ITS tools.
[2026-05-29 11:28:19] [INFO ] Flatten gal took : 37 ms
[2026-05-29 11:28:19] [INFO ] Applying decomposition
[2026-05-29 11:28:20] [INFO ] Flatten gal took : 40 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/graph6590083570792952938.txt' '-o' '/tmp/graph6590083570792952938.bin' '-w' '/tmp/graph6590083570792952938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6590083570792952938.bin' '-l' '-1' '-v' '-w' '/tmp/graph6590083570792952938.weights' '-q' '0' '-e' '0.001'
[2026-05-29 11:28:20] [INFO ] Decomposing Gal with order
[2026-05-29 11:28:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 11:28:20] [INFO ] Removed a total of 1114 redundant transitions.
[2026-05-29 11:28:20] [INFO ] Flatten gal took : 124 ms
[2026-05-29 11:28:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 219 labels/synchronizations in 64 ms.
[2026-05-29 11:28:20] [INFO ] Time to serialize gal into /tmp/LTL17122984839650209644.gal : 19 ms
[2026-05-29 11:28:20] [INFO ] Time to serialize properties into /tmp/LTL14705996274253179213.ltl : 2 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/LTL17122984839650209644.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14705996274253179213.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((((((((G("((((i12.i0.u18.Try_Check_Sources_B_5>=1)||(i12.i0.u18.Try_Check_Sources_B_4>=1))||((i12.i0.u18.Try_Check_Sources_B_...7822
Formula 0 simplified : XXG(!"((((((((i7.u74.CreatedJobs_2>=1)&&(i9.u112.ScheduleTaskE_Work_15>=1))||((i5.u75.CreatedJobs_7>=1)&&(i9.u124.ScheduleTaskE_Work...7800
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-03 finished in 159738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 10 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 11 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 11:28:35] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:28:35] [INFO ] Invariant cache hit.
[2026-05-29 11:28:36] [INFO ] Implicit Places using invariants in 1230 ms returned []
[2026-05-29 11:28:36] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:28:36] [INFO ] Invariant cache hit.
[2026-05-29 11:28:37] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:28:52] [INFO ] Implicit Places using invariants and state equation in 16229 ms returned []
Implicit Place search using SMT with State Equation took 17462 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 17473 ms. Remains : 664/664 places, 1290/1290 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-04
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-04 finished in 17584 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(G(p1))||p0))||((F(G(p3))||p2) U p4)))'
Support contains 25 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 10 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 11:28:53] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:28:53] [INFO ] Invariant cache hit.
[2026-05-29 11:28:54] [INFO ] Implicit Places using invariants in 1698 ms returned []
[2026-05-29 11:28:54] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:28:54] [INFO ] Invariant cache hit.
[2026-05-29 11:28:55] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:29:08] [INFO ] Implicit Places using invariants and state equation in 13694 ms returned []
Implicit Place search using SMT with State Equation took 15397 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 15407 ms. Remains : 664/664 places, 1290/1290 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(G(p1))||p0))||((F(G(p3))||p2) U p4)))'
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1) (NOT p4)), (OR (AND (NOT p0) (NOT p1) (NOT p3) p4) (AND (NOT p0) (NOT p1) p2 (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-05
Stuttering criterion allowed to conclude after 2159 steps with 1 reset in 14 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-05 finished in 15676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 18 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 664 transition count 1250
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 624 transition count 1242
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 616 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 96 place count 616 transition count 1162
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 256 place count 536 transition count 1162
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 384 place count 472 transition count 1098
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 392 place count 464 transition count 1090
Iterating global reduction 3 with 8 rules applied. Total rules applied 400 place count 464 transition count 1090
Applied a total of 400 rules in 74 ms. Remains 464 /664 variables (removed 200) and now considering 1090/1290 (removed 200) transitions.
Running 1088 sub problems to find dead transitions.
[2026-05-29 11:29:08] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13686237583343327032.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1813053815377268309.kers'
[2026-05-29 11:29:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13686237583343327032.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1813053815377268309.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 2 ms.
// Phase 1: matrix 1074 rows 459 cols 4878 entries
Finished phase 1 with 223 SingleSign rule and 197 generalized
[2026-05-29 11:29:08] [INFO ] Computed 44 invariants in 15 ms
Computed 44 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-1813053815377268309.kers
Total runtime 17 ms.
[2026-05-29 11:29:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1538 variables, and 52 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1538 variables, and 52 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41107ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 41113ms
[2026-05-29 11:29:49] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2026-05-29 11:29:49] [INFO ] Invariant cache hit.
[2026-05-29 11:29:51] [INFO ] Implicit Places using invariants in 1597 ms returned []
[2026-05-29 11:29:51] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2026-05-29 11:29:51] [INFO ] Invariant cache hit.
[2026-05-29 11:29:52] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:30:03] [INFO ] Implicit Places using invariants and state equation in 11721 ms returned []
Implicit Place search using SMT with State Equation took 13320 ms to find 0 implicit places.
[2026-05-29 11:30:03] [INFO ] Redundant transitions in 20 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 464/664 places, 1090/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54538 ms. Remains : 464/664 places, 1090/1290 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-06
Product exploration explored 100000 steps with 40 reset in 875 ms.
Stack based approach found an accepted trace after 1111 steps with 0 reset with depth 1112 and stack size 1112 in 9 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-06 finished in 55514 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||G(p1)))))'
Support contains 127 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 664 transition count 1234
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 608 transition count 1234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 112 place count 608 transition count 1210
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 160 place count 584 transition count 1210
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 288 place count 520 transition count 1146
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 296 place count 512 transition count 1138
Iterating global reduction 2 with 8 rules applied. Total rules applied 304 place count 512 transition count 1138
Applied a total of 304 rules in 55 ms. Remains 512 /664 variables (removed 152) and now considering 1138/1290 (removed 152) transitions.
Running 1136 sub problems to find dead transitions.
[2026-05-29 11:30:04] [INFO ] Flow matrix only has 1122 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11916623498342827634.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13156575601201526670.kers'
[2026-05-29 11:30:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11916623498342827634.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13156575601201526670.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1122 rows 507 cols 4974 entries
Finished phase 1 with 271 SingleSign rule and 197 generalized
[2026-05-29 11:30:04] [INFO ] Computed 44 invariants in 9 ms
Computed 44 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-13156575601201526670.kers
Total runtime 12 ms.
[2026-05-29 11:30:04] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1136 unsolved
SMT process timed out in 20830ms, After SMT, problems are : Problem set: 0 solved, 1136 unsolved
Search for dead transitions found 0 dead transitions in 20842ms
[2026-05-29 11:30:25] [INFO ] Flow matrix only has 1122 transitions (discarded 16 similar events)
[2026-05-29 11:30:25] [INFO ] Invariant cache hit.
[2026-05-29 11:30:26] [INFO ] Implicit Places using invariants in 1643 ms returned []
[2026-05-29 11:30:26] [INFO ] Flow matrix only has 1122 transitions (discarded 16 similar events)
[2026-05-29 11:30:26] [INFO ] Invariant cache hit.
[2026-05-29 11:30:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:30:38] [INFO ] Implicit Places using invariants and state equation in 11723 ms returned []
Implicit Place search using SMT with State Equation took 13370 ms to find 0 implicit places.
[2026-05-29 11:30:38] [INFO ] Redundant transitions in 21 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/664 places, 1138/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34302 ms. Remains : 512/664 places, 1138/1290 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)||p1))))'
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-07
Product exploration explored 100000 steps with 42 reset in 706 ms.
Product exploration explored 100000 steps with 34 reset in 1061 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 9 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (22 resets) in 1004 ms. (39 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (11 resets) in 1590 ms. (25 steps per ms) remains 1/1 properties
[2026-05-29 11:30:41] [INFO ] Flow matrix only has 1122 transitions (discarded 16 similar events)
[2026-05-29 11:30:41] [INFO ] Invariant cache hit.
[2026-05-29 11:30:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 122/249 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/1634 variables, and 27 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1183 ms.
Refiners :[Positive P Invariants (semi-flows): 7/13 constraints, Generalized P Invariants (flows): 20/31 constraints, State Equation: 0/512 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 122/249 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/1634 variables, and 27 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 7/13 constraints, Generalized P Invariants (flows): 20/31 constraints, State Equation: 0/512 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2359ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 127 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1138/1138 transitions.
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 512 transition count 1122
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 32 place count 496 transition count 1122
Applied a total of 32 rules in 41 ms. Remains 496 /512 variables (removed 16) and now considering 1122/1138 (removed 16) transitions.
Running 1120 sub problems to find dead transitions.
[2026-05-29 11:30:43] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-844998794911989189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7191907012062684668.kers'
[2026-05-29 11:30:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-844998794911989189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7191907012062684668.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1106 rows 491 cols 5070 entries
Finished phase 1 with 255 SingleSign rule and 197 generalized
[2026-05-29 11:30:43] [INFO ] Computed 44 invariants in 14 ms
Computed 44 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-7191907012062684668.kers
Total runtime 16 ms.
[2026-05-29 11:30:43] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1602 variables, and 55 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/1602 variables, and 56 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40917ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 40921ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40965 ms. Remains : 496/512 places, 1122/1138 transitions.
RANDOM walk for 40000 steps (24 resets) in 425 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (9 resets) in 658 ms. (60 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 197885 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 197885 steps, saw 111371 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2026-05-29 11:31:28] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2026-05-29 11:31:28] [INFO ] Invariant cache hit.
[2026-05-29 11:31:28] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 122/249 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 196/445 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/450 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 493/1602 variables, and 42 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5454 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
After SMT solving in domain Int declared 127/1602 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 0/30 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5509ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 14 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 53074 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-07 finished in 89326 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(p1)||p0)) U X(X(X(!p1))))))'
Support contains 28 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 16 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2026-05-29 11:31:33] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11820731361777885814.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9691765017470949942.kers'
[2026-05-29 11:31:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11820731361777885814.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9691765017470949942.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1274 rows 659 cols 5062 entries
Finished phase 1 with 431 SingleSign rule and 189 generalized
[2026-05-29 11:31:33] [INFO ] Computed 44 invariants in 12 ms
Computed 44 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-9691765017470949942.kers
Total runtime 14 ms.
[2026-05-29 11:31:33] [INFO ] State equation strengthened by 96 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
SMT process timed out in 21274ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 21277ms
[2026-05-29 11:31:54] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:31:54] [INFO ] Invariant cache hit.
[2026-05-29 11:31:56] [INFO ] Implicit Places using invariants in 1562 ms returned []
[2026-05-29 11:31:56] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:31:56] [INFO ] Invariant cache hit.
[2026-05-29 11:31:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:32:11] [INFO ] Implicit Places using invariants and state equation in 15215 ms returned []
Implicit Place search using SMT with State Equation took 16783 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 38081 ms. Remains : 664/664 places, 1290/1290 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(p1)||p0)) U X(X(X(!p1))))))'
Stuttering acceptance computed with spot in 467 ms :[p1, false, p1, false, false, p1, false, false, false, p1, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-09
Product exploration explored 100000 steps with 22221 reset in 731 ms.
Product exploration explored 100000 steps with 22270 reset in 517 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 115 ms. Reduced automaton from 11 states, 17 edges and 2 AP (stutter sensitive) to 11 states, 17 edges and 2 AP (stutter sensitive).
RANDOM walk for 395 steps (0 resets) in 8 ms. (43 steps per ms) remains 0/4 properties
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 11 states, 17 edges and 2 AP (stutter sensitive) to 11 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 580 ms :[p1, false, p1, false, false, p1, false, false, false, p1, (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 877 ms.
Stuttering acceptance computed with spot in 446 ms :[p1, false, p1, false, false, p1, false, false, false, p1, (AND (NOT p0) (NOT p1))]
Support contains 28 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 10 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 11:32:14] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:32:14] [INFO ] Invariant cache hit.
[2026-05-29 11:32:16] [INFO ] Implicit Places using invariants in 1184 ms returned []
[2026-05-29 11:32:16] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:32:16] [INFO ] Invariant cache hit.
[2026-05-29 11:32:16] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:32:31] [INFO ] Implicit Places using invariants and state equation in 15131 ms returned []
Implicit Place search using SMT with State Equation took 16319 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 16330 ms. Remains : 664/664 places, 1290/1290 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 11 states, 17 edges and 2 AP (stutter sensitive) to 11 states, 17 edges and 2 AP (stutter sensitive).
RANDOM walk for 782 steps (0 resets) in 9 ms. (78 steps per ms) remains 0/4 properties
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 11 states, 17 edges and 2 AP (stutter sensitive) to 11 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 391 ms :[p1, false, p1, false, false, p1, false, false, false, p1, (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 580 ms.
Stuttering acceptance computed with spot in 388 ms :[p1, false, p1, false, false, p1, false, false, false, p1, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 432 ms :[p1, false, p1, false, false, p1, false, false, false, p1, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22214 reset in 625 ms.
Product exploration explored 100000 steps with 22265 reset in 540 ms.
Spot run failed in 60 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/ltsmin2490333380328071875
[2026-05-29 11:32:33] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2490333380328071875
Running compilation step : cd /tmp/ltsmin2490333380328071875;'/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/ltsmin2490333380328071875;'/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/ltsmin2490333380328071875;'/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 28 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 11 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 11:32:36] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:32:36] [INFO ] Invariant cache hit.
[2026-05-29 11:32:38] [INFO ] Implicit Places using invariants in 1170 ms returned []
[2026-05-29 11:32:38] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:32:38] [INFO ] Invariant cache hit.
[2026-05-29 11:32:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:32:53] [INFO ] Implicit Places using invariants and state equation in 15320 ms returned []
Implicit Place search using SMT with State Equation took 16492 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 16505 ms. Remains : 664/664 places, 1290/1290 transitions.
Built C files in :
/tmp/ltsmin9748588120951151066
[2026-05-29 11:32:53] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9748588120951151066
Running compilation step : cd /tmp/ltsmin9748588120951151066;'/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/ltsmin9748588120951151066;'/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/ltsmin9748588120951151066;'/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-29 11:32:56] [INFO ] Flatten gal took : 34 ms
[2026-05-29 11:32:56] [INFO ] Flatten gal took : 44 ms
[2026-05-29 11:32:56] [INFO ] Time to serialize gal into /tmp/LTL16077016701235721576.gal : 7 ms
[2026-05-29 11:32:56] [INFO ] Time to serialize properties into /tmp/LTL2017237206777856039.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16077016701235721576.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1698051852448052557.hoa' '-atoms' '/tmp/LTL2017237206777856039.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/LTL2017237206777856039.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1698051852448052557.hoa
Detected timeout of ITS tools.
[2026-05-29 11:33:11] [INFO ] Flatten gal took : 59 ms
[2026-05-29 11:33:11] [INFO ] Flatten gal took : 61 ms
[2026-05-29 11:33:11] [INFO ] Time to serialize gal into /tmp/LTL221213177108349277.gal : 19 ms
[2026-05-29 11:33:11] [INFO ] Time to serialize properties into /tmp/LTL8233600809837304166.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL221213177108349277.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8233600809837304166.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...274
Read 1 LTL properties
Checking formula 0 : !((G((F((((((G("((((((cPollingAbort>=1)&&(ScheduleTaskB_0>=1))&&(cIsMonitoring>=1))||(((cPollingAbort>=1)&&(ScheduleTaskB_5>=1))&&(cIs...2074
Formula 0 simplified : F(G(!"((((((cBlockedTasks>=10)&&(ORB_Lock>=1))&&(P_2579_14>=1))||(((cBlockedTasks>=10)&&(ORB_Lock>=1))&&(P_2579_11>=1)))||((((cBlock...2049
Detected timeout of ITS tools.
[2026-05-29 11:33:26] [INFO ] Flatten gal took : 36 ms
[2026-05-29 11:33:26] [INFO ] Applying decomposition
[2026-05-29 11:33:26] [INFO ] Flatten gal took : 37 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/graph5040871823844543059.txt' '-o' '/tmp/graph5040871823844543059.bin' '-w' '/tmp/graph5040871823844543059.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5040871823844543059.bin' '-l' '-1' '-v' '-w' '/tmp/graph5040871823844543059.weights' '-q' '0' '-e' '0.001'
[2026-05-29 11:33:26] [INFO ] Decomposing Gal with order
[2026-05-29 11:33:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 11:33:27] [INFO ] Removed a total of 1157 redundant transitions.
[2026-05-29 11:33:27] [INFO ] Flatten gal took : 142 ms
[2026-05-29 11:33:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 33 ms.
[2026-05-29 11:33:27] [INFO ] Time to serialize gal into /tmp/LTL16041768209662443351.gal : 14 ms
[2026-05-29 11:33:27] [INFO ] Time to serialize properties into /tmp/LTL17943560615181563457.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16041768209662443351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17943560615181563457.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...256
Read 1 LTL properties
Checking formula 0 : !((G((F((((((G("((((((i2.i0.u18.cPollingAbort>=1)&&(i2.i4.u102.ScheduleTaskB_0>=1))&&(i2.i0.u106.cIsMonitoring>=1))||(((i2.i0.u18.cPol...3060
Formula 0 simplified : F(G(!"((((((i2.i0.u18.cBlockedTasks>=10)&&(i2.i0.u18.ORB_Lock>=1))&&(i2.i0.u18.P_2579_14>=1))||(((i2.i0.u18.cBlockedTasks>=10)&&(i2....3035
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-09 finished in 128727 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(p1)&&X((F(p2)||G(p3)))&&p0))))'
Support contains 34 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 17 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 11:33:42] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:33:42] [INFO ] Invariant cache hit.
[2026-05-29 11:33:43] [INFO ] Implicit Places using invariants in 1201 ms returned []
[2026-05-29 11:33:43] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:33:43] [INFO ] Invariant cache hit.
[2026-05-29 11:33:44] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:34:00] [INFO ] Implicit Places using invariants and state equation in 16528 ms returned []
Implicit Place search using SMT with State Equation took 17739 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 17757 ms. Remains : 664/664 places, 1290/1290 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(p1)&&X((F(p2)||G(p3)))&&p0))))'
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-10
Stuttering criterion allowed to conclude after 11247 steps with 250 reset in 97 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-10 finished in 18196 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(p1))))'
Support contains 19 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 12 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 11:34:00] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:34:00] [INFO ] Invariant cache hit.
[2026-05-29 11:34:01] [INFO ] Implicit Places using invariants in 1372 ms returned []
[2026-05-29 11:34:01] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:34:01] [INFO ] Invariant cache hit.
[2026-05-29 11:34:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:34:16] [INFO ] Implicit Places using invariants and state equation in 14850 ms returned []
Implicit Place search using SMT with State Equation took 16227 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 16240 ms. Remains : 664/664 places, 1290/1290 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-14
Entered a terminal (fully accepting) state of product in 522 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-14 finished in 16355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||F((G(p1)||(p1&&F((G(F(!p2))||(F(!p2)&&p3)))))))))))'
Support contains 27 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 11 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 11:34:16] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:34:16] [INFO ] Invariant cache hit.
[2026-05-29 11:34:18] [INFO ] Implicit Places using invariants in 1266 ms returned []
[2026-05-29 11:34:18] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:34:18] [INFO ] Invariant cache hit.
[2026-05-29 11:34:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:34:31] [INFO ] Implicit Places using invariants and state equation in 13750 ms returned []
Implicit Place search using SMT with State Equation took 15018 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 15030 ms. Remains : 664/664 places, 1290/1290 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((F((G(p0)||(p0&&F((G(F(p1))||(F(p1)&&p2))))))||p3)))))'
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-15
Product exploration explored 100000 steps with 671 reset in 823 ms.
Product exploration explored 100000 steps with 721 reset in 850 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 8 factoid took 69 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 12 to 10
RANDOM walk for 40000 steps (8 resets) in 344 ms. (115 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40000 steps (12 resets) in 356 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 300 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 376 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 227 ms. (175 steps per ms) remains 4/4 properties
[2026-05-29 11:34:34] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:34:34] [INFO ] Invariant cache hit.
[2026-05-29 11:34:34] [INFO ] State equation strengthened by 96 read => feed constraints.
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 584/1938 variables, and 4 constraints, problems are : Problem set: 4 solved, 0 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 4/15 constraints, Generalized P Invariants (flows): 0/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 186ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge based reduction with 13 factoid took 161 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Knowledge-based reduction took 1139 ms.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Support contains 26 out of 664 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 11 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 11:34:35] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:34:35] [INFO ] Invariant cache hit.
[2026-05-29 11:34:36] [INFO ] Implicit Places using invariants in 1280 ms returned []
[2026-05-29 11:34:36] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:34:36] [INFO ] Invariant cache hit.
[2026-05-29 11:34:37] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:34:50] [INFO ] Implicit Places using invariants and state equation in 13989 ms returned []
Implicit Place search using SMT with State Equation took 15271 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 15282 ms. Remains : 664/664 places, 1290/1290 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 4 factoid took 51 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 223 steps (0 resets) in 7 ms. (27 steps per ms) remains 0/3 properties
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Knowledge-based reduction took 287 ms.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Product exploration explored 100000 steps with 682 reset in 549 ms.
Product exploration explored 100000 steps with 689 reset in 576 ms.
Spot run failed in 58 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/ltsmin203457277420314301
[2026-05-29 11:34:52] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin203457277420314301
Running compilation step : cd /tmp/ltsmin203457277420314301;'/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/ltsmin203457277420314301;'/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/ltsmin203457277420314301;'/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 26 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 14 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 11:34:55] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:34:55] [INFO ] Invariant cache hit.
[2026-05-29 11:34:56] [INFO ] Implicit Places using invariants in 1252 ms returned []
[2026-05-29 11:34:56] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2026-05-29 11:34:56] [INFO ] Invariant cache hit.
[2026-05-29 11:34:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2026-05-29 11:35:16] [INFO ] Implicit Places using invariants and state equation in 20063 ms returned []
Implicit Place search using SMT with State Equation took 21317 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 21336 ms. Remains : 664/664 places, 1290/1290 transitions.
Built C files in :
/tmp/ltsmin8914423286249772565
[2026-05-29 11:35:16] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8914423286249772565
Running compilation step : cd /tmp/ltsmin8914423286249772565;'/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/ltsmin8914423286249772565;'/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/ltsmin8914423286249772565;'/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-29 11:35:19] [INFO ] Flatten gal took : 38 ms
[2026-05-29 11:35:19] [INFO ] Flatten gal took : 39 ms
[2026-05-29 11:35:19] [INFO ] Time to serialize gal into /tmp/LTL3292608820592172915.gal : 7 ms
[2026-05-29 11:35:19] [INFO ] Time to serialize properties into /tmp/LTL5697682012365994714.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3292608820592172915.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15649499235878141095.hoa' '-atoms' '/tmp/LTL5697682012365994714.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/LTL5697682012365994714.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15649499235878141095.hoa
Detected timeout of ITS tools.
[2026-05-29 11:35:34] [INFO ] Flatten gal took : 44 ms
[2026-05-29 11:35:35] [INFO ] Flatten gal took : 49 ms
[2026-05-29 11:35:35] [INFO ] Time to serialize gal into /tmp/LTL13271686577771061120.gal : 7 ms
[2026-05-29 11:35:35] [INFO ] Time to serialize properties into /tmp/LTL3540159985784381367.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13271686577771061120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3540159985784381367.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((F((G("((((NotifyEventSourceAddedB_5>=1)||(NotifyEventSourceAddedB_4>=1))||((NotifyEventSourceAddedB_7>=1)||(NotifyEventSourc...4255
Formula 0 simplified : XXF(!"(((((((cPollingAbort<1)||(BlockedTasks<1))||(DisablePollingB_0<1))&&(((cPollingAbort<1)||(BlockedTasks<1))||(DisablePollingB_8...4235
Detected timeout of ITS tools.
[2026-05-29 11:35:50] [INFO ] Flatten gal took : 36 ms
[2026-05-29 11:35:50] [INFO ] Applying decomposition
[2026-05-29 11:35:50] [INFO ] Flatten gal took : 44 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/graph11275673645613163379.txt' '-o' '/tmp/graph11275673645613163379.bin' '-w' '/tmp/graph11275673645613163379.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11275673645613163379.bin' '-l' '-1' '-v' '-w' '/tmp/graph11275673645613163379.weights' '-q' '0' '-e' '0.001'
[2026-05-29 11:35:50] [INFO ] Decomposing Gal with order
[2026-05-29 11:35:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 11:35:50] [INFO ] Removed a total of 1117 redundant transitions.
[2026-05-29 11:35:50] [INFO ] Flatten gal took : 228 ms
[2026-05-29 11:35:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 35 ms.
[2026-05-29 11:35:50] [INFO ] Time to serialize gal into /tmp/LTL1615501462274087654.gal : 44 ms
[2026-05-29 11:35:50] [INFO ] Time to serialize properties into /tmp/LTL10250141191472022501.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1615501462274087654.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10250141191472022501.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G((F((G("((((i6.i4.u62.NotifyEventSourceAddedB_5>=1)||(i6.i7.u61.NotifyEventSourceAddedB_4>=1))||((i6.i7.u78.NotifyEventSourceA...5833
Formula 0 simplified : XXF(!"(((((((i6.i7.u17.cPollingAbort<1)||(i6.i7.u17.BlockedTasks<1))||(i10.u18.DisablePollingB_0<1))&&(((i6.i7.u17.cPollingAbort<1)|...5813
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-15 finished in 109146 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((X(X(!p1)) U (p2&&X(X(!p1)))))||p0)))'
Spot run failed in 54 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Spot run failed in 51 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)||p0)) U X(X(X(!p1))))))'
Spot run failed in 49 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||F((G(p1)||(p1&&F((G(F(!p2))||(F(!p2)&&p3)))))))))))'
Spot run failed in 50 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-29 11:36:06] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9639307485316170921
[2026-05-29 11:36:06] [INFO ] Computing symmetric may disable matrix : 1290 transitions.
[2026-05-29 11:36:06] [INFO ] Applying decomposition
[2026-05-29 11:36:06] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-29 11:36:06] [INFO ] Computing symmetric may enable matrix : 1290 transitions.
[2026-05-29 11:36:06] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-29 11:36:06] [INFO ] Flatten gal took : 51 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/graph2006334548244584326.txt' '-o' '/tmp/graph2006334548244584326.bin' '-w' '/tmp/graph2006334548244584326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2006334548244584326.bin' '-l' '-1' '-v' '-w' '/tmp/graph2006334548244584326.weights' '-q' '0' '-e' '0.001'
[2026-05-29 11:36:06] [INFO ] Decomposing Gal with order
[2026-05-29 11:36:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 11:36:06] [INFO ] Removed a total of 1122 redundant transitions.
[2026-05-29 11:36:06] [INFO ] Flatten gal took : 138 ms
[2026-05-29 11:36:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 221 labels/synchronizations in 37 ms.
[2026-05-29 11:36:06] [INFO ] Computing Do-Not-Accords matrix : 1290 transitions.
[2026-05-29 11:36:06] [INFO ] Time to serialize gal into /tmp/LTLFireability12041858795767505680.gal : 37 ms
[2026-05-29 11:36:06] [INFO ] Time to serialize properties into /tmp/LTLFireability18129482814465823701.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/LTLFireability12041858795767505680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18129482814465823701.ltl' '-c' '-stutter-deadlock'
[2026-05-29 11:36:06] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-29 11:36:07] [INFO ] Built C files in 592ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9639307485316170921
Running compilation step : cd /tmp/ltsmin9639307485316170921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '180' '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'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
Checking formula 0 : !((F(("((((i2.u24.QueueJobE_1>=1)||(i2.u24.QueueJobE_0>=1))||((i2.u24.QueueJobE_3>=1)||(i2.u24.QueueJobE_2>=1)))||(((i2.u24.QueueJobE_...1067
Formula 0 simplified : G(!"((((i2.u24.QueueJobE_1>=1)||(i2.u24.QueueJobE_0>=1))||((i2.u24.QueueJobE_3>=1)||(i2.u24.QueueJobE_2>=1)))||(((i2.u24.QueueJobE_5...753
Compilation finished in 7618 ms.
Running link step : cd /tmp/ltsmin9639307485316170921;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 102 ms.
Running LTSmin : cd /tmp/ltsmin9639307485316170921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>((X((X(X(!(LTLAPp1==true))) U ((LTLAPp2==true)&&X(X(!(LTLAPp1==true))))))||(LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 576 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9639307485316170921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(<>(([]((LTLAPp4==true))||(LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 21160 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9639307485316170921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((<>(([]((LTLAPp6==true))||(LTLAPp5==true))) U X(X(X(!(LTLAPp6==true))))))' '--buchi-type=spotba'
LTSmin run took 517 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9639307485316170921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([](((LTLAPp7==true)||<>(([]((LTLAPp8==true))||((LTLAPp8==true)&&<>(([](<>(!(LTLAPp9==true)))||(<>(!(LTLAPp9==true))&&(LTLAPp10==true)))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9639307485316170921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([](((LTLAPp7==true)||<>(([]((LTLAPp8==true))||((LTLAPp8==true)&&<>(([](<>(!(LTLAPp9==true)))||(<>(!(LTLAPp9==true))&&(LTLAPp10==true)))))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin9639307485316170921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([](((LTLAPp7==true)||<>(([]((LTLAPp8==true))||((LTLAPp8==true)&&<>(([](<>(!(LTLAPp9==true)))||(<>(!(LTLAPp9==true))&&(LTLAPp10==true)))))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-29 12:02:09] [INFO ] Applying decomposition
[2026-05-29 12:02:10] [INFO ] Flatten gal took : 585 ms
[2026-05-29 12:02:10] [INFO ] Decomposing Gal with order
[2026-05-29 12:02:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 12:02:11] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, P_1617_5, ScheduleTaskE_Idle_5],[AwakeTasks_6, IdleTasks_6, NotifyEventJobQueuedE_6, QueueJobE_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingE_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, NotifyEventSourceAddedB_6, Insert_Source_E_6, NotifyEventSourceAddedE_6, P_1113_6, ProcessingEvt_6, P_1155_6, nyo_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, NotifyEventEndOfCheckSourcesE_6, Check_Sources_B_6, Check_Sources_E_6, NotifyEventJobCompletedB_6, RunE_6, RunB_6, Perform_Work_E_6, Try_Check_Sources_B_6, P_1617_6, ScheduleTaskE_Idle_6],[AwakeTasks_7, IdleTasks_7, NotifyEventJobQueuedE_7, QueueJobE_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingE_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, NotifyEventSourceAddedB_7, Insert_Source_E_7, NotifyEventSourceAddedE_7, P_1113_7, ProcessingEvt_7, P_1155_7, nyo_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, NotifyEventEndOfCheckSourcesE_7, Check_Sources_B_7, Check_Sources_E_7, NotifyEventJobCompletedB_7, RunE_7, RunB_7, Perform_Work_E_7, Try_Check_Sources_B_7, P_1617_7, ScheduleTaskE_Idle_7],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42, ScheduleTaskE_Work_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43, ScheduleTaskE_Work_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44, ScheduleTaskE_Work_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45, ScheduleTaskE_Work_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46, ScheduleTaskE_Work_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47, ScheduleTaskE_Work_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48, ScheduleTaskE_Work_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49, ScheduleTaskE_Work_49],[NotifyEventJobQueuedB_50, QueueJobB_50, FetchJobE_50, ScheduleTaskE_Work_50],[NotifyEventJobQueuedB_51, QueueJobB_51, FetchJobE_51, ScheduleTaskE_Work_51],[NotifyEventJobQueuedB_52, QueueJobB_52, FetchJobE_52, ScheduleTaskE_Work_52],[NotifyEventJobQueuedB_53, QueueJobB_53, FetchJobE_53, ScheduleTaskE_Work_53],[NotifyEventJobQueuedB_54, QueueJobB_54, FetchJobE_54, ScheduleTaskE_Work_54],[NotifyEventJobQueuedB_55, QueueJobB_55, FetchJobE_55, ScheduleTaskE_Work_55],[PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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)
[2026-05-29 12:02:12] [INFO ] Flatten gal took : 660 ms
[2026-05-29 12:02:12] [INFO ] Time to serialize gal into /tmp/LTLFireability16297511671043091245.gal : 167 ms
[2026-05-29 12:02:12] [INFO ] Time to serialize properties into /tmp/LTLFireability9215370017089286293.ltl : 44 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/LTLFireability16297511671043091245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9215370017089286293.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...298
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(((((((cPollingAbort<1)||(BlockedTasks<1))||(DisablePollingB_0<1))&&(((cPollingAbort<1)||(BlockedTasks<1))||(DisablePolling...4325
Formula 0 simplified : XXF(!"(((((((cPollingAbort<1)||(BlockedTasks<1))||(DisablePollingB_0<1))&&(((cPollingAbort<1)||(BlockedTasks<1))||(DisablePollingB_8...4297
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin9639307485316170921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([](((LTLAPp7==true)||<>(([]((LTLAPp8==true))||((LTLAPp8==true)&&<>(([](<>(!(LTLAPp9==true)))||(<>(!(LTLAPp9==true))&&(LTLAPp10==true)))))))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

--------------------
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="PolyORBLF-COL-S02J06T08"
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 PolyORBLF-COL-S02J06T08, 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-177969942100300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T08.tgz
mv PolyORBLF-COL-S02J06T08 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 ;