Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000243.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-19, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.0K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 184K 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 MedleyA-PT-19-LTLCardinality-00
FORMULA_NAME MedleyA-PT-19-LTLCardinality-01
FORMULA_NAME MedleyA-PT-19-LTLCardinality-02
FORMULA_NAME MedleyA-PT-19-LTLCardinality-03
FORMULA_NAME MedleyA-PT-19-LTLCardinality-04
FORMULA_NAME MedleyA-PT-19-LTLCardinality-05
FORMULA_NAME MedleyA-PT-19-LTLCardinality-06
FORMULA_NAME MedleyA-PT-19-LTLCardinality-07
FORMULA_NAME MedleyA-PT-19-LTLCardinality-08
FORMULA_NAME MedleyA-PT-19-LTLCardinality-09
FORMULA_NAME MedleyA-PT-19-LTLCardinality-10
FORMULA_NAME MedleyA-PT-19-LTLCardinality-11
FORMULA_NAME MedleyA-PT-19-LTLCardinality-12
FORMULA_NAME MedleyA-PT-19-LTLCardinality-13
FORMULA_NAME MedleyA-PT-19-LTLCardinality-14
FORMULA_NAME MedleyA-PT-19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779701333512

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 09:28:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:28:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:28:55] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2026-05-25 09:28:55] [INFO ] Transformed 272 places.
[2026-05-25 09:28:55] [INFO ] Transformed 586 transitions.
[2026-05-25 09:28:55] [INFO ] Found NUPN structural information;
[2026-05-25 09:28:55] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 3 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-19-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 583
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 71 place count 198 transition count 503
Iterating global reduction 1 with 69 rules applied. Total rules applied 140 place count 198 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 197 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 197 transition count 501
Applied a total of 142 rules in 71 ms. Remains 197 /269 variables (removed 72) and now considering 501/583 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13396671172887734990.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1317863887483414358.kers'
[2026-05-25 09:28:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13396671172887734990.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1317863887483414358.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 501 rows 197 cols 2717 entries
Finished phase 1 with 167 SingleSign rule and 8 generalized
[2026-05-25 09:28:55] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1317863887483414358.kers
Total runtime 6 ms.
[2026-05-25 09:28:56] [INFO ] Implicit Places using invariants in 482 ms returned []
[2026-05-25 09:28:56] [INFO ] Invariant cache hit.
[2026-05-25 09:28:56] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2026-05-25 09:28:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD475 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/197 variables, 8/22 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 11/33 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/33 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 5 (OVERLAPS) 501/698 variables, 197/230 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 6/236 constraints. Problems are: Problem set: 120 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 698/698 variables, and 236 constraints, problems are : Problem set: 120 solved, 380 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 120 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 14/14 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 8/22 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 17/39 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/39 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 5 (OVERLAPS) 501/698 variables, 197/236 constraints. Problems are: Problem set: 120 solved, 380 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 380/616 constraints. Problems are: Problem set: 120 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 698/698 variables, and 622 constraints, problems are : Problem set: 120 solved, 380 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 380/500 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60757ms problems are : Problem set: 120 solved, 380 unsolved
Search for dead transitions found 120 dead transitions in 60772ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 197/269 places, 381/583 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61760 ms. Remains : 197/269 places, 381/583 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 381/381 transitions.
Applied a total of 0 rules in 10 ms. Remains 197 /197 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3445120584120371731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4391488050851692599.kers'
[2026-05-25 09:29:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3445120584120371731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4391488050851692599.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 381 rows 197 cols 1789 entries
Finished phase 1 with 167 SingleSign rule and 8 generalized
[2026-05-25 09:29:57] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4391488050851692599.kers
Total runtime 2 ms.
[2026-05-25 09:29:57] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 09:29:57] [INFO ] Invariant cache hit.
[2026-05-25 09:29:57] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2026-05-25 09:29:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (OVERLAPS) 381/578 variables, 197/232 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 6/238 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/578 variables, and 239 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 6 (OVERLAPS) 381/578 variables, 197/239 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 380/619 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/578 variables, and 627 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Finished structural reductions in LTL mode , in 1 iterations and 60707 ms. Remains : 197/197 places, 381/381 transitions.
Support contains 30 out of 197 places after structural reductions.
[2026-05-25 09:30:58] [INFO ] Flatten gal took : 53 ms
[2026-05-25 09:30:58] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:30:58] [INFO ] Input system was already deterministic with 381 transitions.
Support contains 29 out of 197 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (17 resets) in 1065 ms. (37 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40002 steps (12 resets) in 507 ms. (78 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (17 resets) in 417 ms. (95 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (22 resets) in 206 ms. (193 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40001 steps (25 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (21 resets) in 220 ms. (181 steps per ms) remains 6/6 properties
[2026-05-25 09:30:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 60/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/87 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 79/166 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3/169 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 364/533 variables, 169/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 29/562 variables, 19/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/564 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/564 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/564 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 9/573 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/573 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 5/578 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/578 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/578 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 219 constraints, problems are : Problem set: 0 solved, 6 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 60/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/87 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 79/166 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/169 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 364/533 variables, 169/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/533 variables, 5/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/533 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 29/562 variables, 19/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/562 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/562 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/562 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/562 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/562 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/562 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 2/564 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/564 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/564 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 9/573 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/573 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 5/578 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/578 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 0/578 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 238 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4824 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 5575ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 9794 steps, including 130 resets, run visited all 6 properties in 62 ms. (steps per millisecond=157 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 80 ms.
FORMULA MedleyA-PT-19-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 22 stabilizing places and 24 stable transitions
Graph (complete) has 681 edges and 197 vertex of which 194 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.11 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(F(p0)) U ((!p0 U X(p0)) U (G((!p0 U X(p0)))||(!p1&&(!p0 U X(p0)))))))))'
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 381/381 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 185 transition count 366
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 185 transition count 366
Applied a total of 24 rules in 28 ms. Remains 185 /197 variables (removed 12) and now considering 366/381 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8355654994800934215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6257243946483796481.kers'
[2026-05-25 09:31:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8355654994800934215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6257243946483796481.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 185 cols 1759 entries
Finished phase 1 with 155 SingleSign rule and 8 generalized
[2026-05-25 09:31:05] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6257243946483796481.kers
Total runtime 2 ms.
[2026-05-25 09:31:05] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-25 09:31:05] [INFO ] Invariant cache hit.
[2026-05-25 09:31:05] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-25 09:31:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 225 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/223 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/588 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 7/595 constraints. Problems are: Problem set: 0 solved, 365 unsolved
SMT process timed out in 60212ms, After SMT, problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Starting structural reductions in LTL mode, iteration 1 : 185/197 places, 366/381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60693 ms. Remains : 185/197 places, 366/381 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(p0)) U ((!p0 U X(p0)) U (G((!p0 U X(p0)))||(!p1&&(!p0 U X(p0)))))))))'
Stuttering acceptance computed with spot in 473 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-00
Product exploration explored 100000 steps with 20071 reset in 259 ms.
Product exploration explored 100000 steps with 20141 reset in 192 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 650 edges and 185 vertex of which 183 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 30222 steps (21 resets) in 331 ms. (91 steps per ms) remains 0/3 properties
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 662 ms.
Stuttering acceptance computed with spot in 351 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 366/366 transitions.
Applied a total of 0 rules in 7 ms. Remains 185 /185 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2026-05-25 09:32:08] [INFO ] Invariant cache hit.
[2026-05-25 09:32:08] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-25 09:32:08] [INFO ] Invariant cache hit.
[2026-05-25 09:32:08] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 185/185 places, 366/366 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 650 edges and 185 vertex of which 183 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 30507 steps (17 resets) in 182 ms. (166 steps per ms) remains 0/3 properties
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 597 ms.
Stuttering acceptance computed with spot in 383 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 418 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20192 reset in 135 ms.
Product exploration explored 100000 steps with 20127 reset in 156 ms.
Spot run failed in 149 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/ltsmin1729266952561396412
[2026-05-25 09:32:10] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1729266952561396412
Running compilation step : cd /tmp/ltsmin1729266952561396412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 884 ms.
Running link step : cd /tmp/ltsmin1729266952561396412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin1729266952561396412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10274063164055188206.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 366/366 transitions.
Applied a total of 0 rules in 6 ms. Remains 185 /185 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2026-05-25 09:32:25] [INFO ] Invariant cache hit.
[2026-05-25 09:32:25] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-25 09:32:25] [INFO ] Invariant cache hit.
[2026-05-25 09:32:26] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 185/185 places, 366/366 transitions.
Built C files in :
/tmp/ltsmin67807725573509113
[2026-05-25 09:32:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin67807725573509113
Running compilation step : cd /tmp/ltsmin67807725573509113;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 652 ms.
Running link step : cd /tmp/ltsmin67807725573509113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin67807725573509113;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased17061902742429664621.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 09:32:41] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:32:41] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:32:41] [INFO ] Time to serialize gal into /tmp/LTL2731144983910951183.gal : 8 ms
[2026-05-25 09:32:41] [INFO ] Time to serialize properties into /tmp/LTL12642388475541120889.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/LTL2731144983910951183.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10186838634342373668.hoa' '-atoms' '/tmp/LTL12642388475541120889.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...319
Loading property file /tmp/LTL12642388475541120889.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10186838634342373668.hoa
Detected timeout of ITS tools.
[2026-05-25 09:32:56] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:32:56] [INFO ] Flatten gal took : 30 ms
[2026-05-25 09:32:56] [INFO ] Time to serialize gal into /tmp/LTL4413532641833935090.gal : 17 ms
[2026-05-25 09:32:56] [INFO ] Time to serialize properties into /tmp/LTL13408110810387208461.ltl : 14 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/LTL4413532641833935090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13408110810387208461.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("((p253==0)||(p10==1))")))U(((!("((p253==0)||(p10==1))"))U(X("((p253==0)||(p10==1))")))U((G((!("((p253==0)||(p10==1))"))U(...282
Formula 0 simplified : XX(FG!"((p253==0)||(p10==1))" R ("((p4==0)||(p134==1))" U ("((p253==0)||(p10==1))" R X!"((p253==0)||(p10==1))")))
Detected timeout of ITS tools.
[2026-05-25 09:33:11] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:33:11] [INFO ] Applying decomposition
[2026-05-25 09:33:11] [INFO ] Flatten gal took : 13 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/graph17532470233965847262.txt' '-o' '/tmp/graph17532470233965847262.bin' '-w' '/tmp/graph17532470233965847262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17532470233965847262.bin' '-l' '-1' '-v' '-w' '/tmp/graph17532470233965847262.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:33:11] [INFO ] Decomposing Gal with order
[2026-05-25 09:33:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:33:11] [INFO ] Removed a total of 681 redundant transitions.
[2026-05-25 09:33:11] [INFO ] Flatten gal took : 80 ms
[2026-05-25 09:33:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 11 ms.
[2026-05-25 09:33:11] [INFO ] Time to serialize gal into /tmp/LTL3276668607026965223.gal : 5 ms
[2026-05-25 09:33:11] [INFO ] Time to serialize properties into /tmp/LTL10489547928098972530.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/LTL3276668607026965223.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10489547928098972530.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("((u58.p253==0)||(i4.u3.p10==1))")))U(((!("((u58.p253==0)||(i4.u3.p10==1))"))U(X("((u58.p253==0)||(i4.u3.p10==1))")))U((G(...368
Formula 0 simplified : XX(FG!"((u58.p253==0)||(i4.u3.p10==1))" R ("((i0.i0.u2.p4==0)||(i7.u33.p134==1))" U ("((u58.p253==0)||(i4.u3.p10==1))" R X!"((u58.p2...182
Reverse transition relation is NOT exact ! Due to transitions t49, t86, t142, t149, t151, i0.i2.t19, i0.i2.u57.t18, i2.t162, i2.t160, i2.u9.t168, i2.u9.t16...982
Computing Next relation with stutter on 4850 deadlock states
49 unique states visited
49 strongly connected components in search stack
50 transitions explored
49 items max in DFS search stack
712 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.15075,230644,1,0,413437,621,3409,1.0627e+06,289,2847,805380
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-19-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property MedleyA-PT-19-LTLCardinality-00 finished in 134721 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((X(X((G(p1)&&X((F(p2) U p3)))))||p0))))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 381/381 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 188 transition count 370
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 188 transition count 370
Applied a total of 18 rules in 10 ms. Remains 188 /197 variables (removed 9) and now considering 370/381 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14727538831035433556.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14293917664888510405.kers'
[2026-05-25 09:33:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14727538831035433556.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14293917664888510405.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 188 cols 1767 entries
Finished phase 1 with 158 SingleSign rule and 8 generalized
[2026-05-25 09:33:20] [INFO ] Computed 22 invariants in 16 ms
Computed 22 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-14293917664888510405.kers
Total runtime 18 ms.
[2026-05-25 09:33:20] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-25 09:33:20] [INFO ] Invariant cache hit.
[2026-05-25 09:33:20] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2026-05-25 09:33:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 370/558 variables, 188/221 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/558 variables, and 229 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 370/558 variables, 188/227 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 369/596 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 5/601 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 602 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60256ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Starting structural reductions in LTL mode, iteration 1 : 188/197 places, 370/381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60790 ms. Remains : 188/197 places, 370/381 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X((G(p1)&&X((F(p2) U p3)))))||p0))))'
Stuttering acceptance computed with spot in 435 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), true, (NOT p1), (NOT p3), (NOT p2)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 92 ms.
Product exploration explored 100000 steps with 33333 reset in 124 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 657 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge based reduction with 2 factoid took 70 ms. Proved property starting from automaton with 9 states, 13 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 89 ms.
FORMULA MedleyA-PT-19-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLCardinality-02 finished in 61595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p0))))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 381/381 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 185 transition count 366
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 185 transition count 366
Applied a total of 24 rules in 4 ms. Remains 185 /197 variables (removed 12) and now considering 366/381 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8015997986158423800.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7388831452776263134.kers'
[2026-05-25 09:34:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8015997986158423800.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7388831452776263134.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 185 cols 1759 entries
Finished phase 1 with 155 SingleSign rule and 8 generalized
[2026-05-25 09:34:21] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7388831452776263134.kers
Total runtime 2 ms.
[2026-05-25 09:34:21] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:34:21] [INFO ] Invariant cache hit.
[2026-05-25 09:34:22] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-25 09:34:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 226 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/223 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/588 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 6/594 constraints. Problems are: Problem set: 0 solved, 365 unsolved
SMT process timed out in 60179ms, After SMT, problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LTL mode, iteration 1 : 185/197 places, 366/381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60566 ms. Remains : 185/197 places, 366/381 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p0))))'
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 135 ms.
Product exploration explored 100000 steps with 0 reset in 243 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 650 edges and 185 vertex of which 183 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (15 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (12 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 235 steps, run visited all 1 properties in 9 ms. (steps per millisecond=26 )
Probabilistic random walk after 235 steps, saw 194 distinct states, run finished after 22 ms. (steps per millisecond=10 ) properties seen :1
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Knowledge-based reduction took 368 ms.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 366/366 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2026-05-25 09:35:23] [INFO ] Invariant cache hit.
[2026-05-25 09:35:23] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-25 09:35:23] [INFO ] Invariant cache hit.
[2026-05-25 09:35:23] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 185/185 places, 366/366 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 650 edges and 185 vertex of which 183 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (11 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (20 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 235 steps, run visited all 1 properties in 8 ms. (steps per millisecond=29 )
Probabilistic random walk after 235 steps, saw 194 distinct states, run finished after 8 ms. (steps per millisecond=29 ) properties seen :1
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Knowledge-based reduction took 243 ms.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 112 ms.
Product exploration explored 100000 steps with 1 reset in 154 ms.
Spot run failed in 73 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/ltsmin1435929473926682844
[2026-05-25 09:35:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1435929473926682844
Running compilation step : cd /tmp/ltsmin1435929473926682844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 669 ms.
Running link step : cd /tmp/ltsmin1435929473926682844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin1435929473926682844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased6314389890946137610.hoa' '--buchi-type=spotba'
LTSmin run took 3923 ms.
FORMULA MedleyA-PT-19-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-19-LTLCardinality-03 finished in 67544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 381/381 transitions.
Graph (complete) has 681 edges and 197 vertex of which 194 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 193 transition count 346
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 69 place count 162 transition count 340
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 159 transition count 340
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 72 place count 159 transition count 330
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 92 place count 149 transition count 330
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 106 place count 135 transition count 310
Iterating global reduction 3 with 14 rules applied. Total rules applied 120 place count 135 transition count 310
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 120 place count 135 transition count 308
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 133 transition count 308
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 65 rules applied. Total rules applied 189 place count 99 transition count 277
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 201 place count 93 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 225 place count 93 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 92 transition count 292
Applied a total of 226 rules in 96 ms. Remains 92 /197 variables (removed 105) and now considering 292/381 (removed 89) transitions.
[2026-05-25 09:35:29] [INFO ] Flow matrix only has 291 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-7139989739303378493.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12074933626194099084.kers'
[2026-05-25 09:35:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7139989739303378493.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12074933626194099084.kers]
Normalized transition count is 290 out of 291 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 92 cols 1279 entries
Finished phase 1 with 68 SingleSign rule and 5 generalized
[2026-05-25 09:35:29] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12074933626194099084.kers
Total runtime 5 ms.
[2026-05-25 09:35:29] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 09:35:29] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2026-05-25 09:35:29] [INFO ] Invariant cache hit.
[2026-05-25 09:35:29] [INFO ] State equation strengthened by 136 read => feed constraints.
[2026-05-25 09:35:29] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2026-05-25 09:35:29] [INFO ] Redundant transitions in 59 ms returned []
Running 288 sub problems to find dead transitions.
[2026-05-25 09:35:29] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2026-05-25 09:35:29] [INFO ] Invariant cache hit.
[2026-05-25 09:35:29] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 290/382 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 135/248 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/383 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 252 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (OVERLAPS) 290/382 variables, 92/116 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 135/251 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 288/539 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 540 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/197 places, 292/381 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60702 ms. Remains : 92/197 places, 292/381 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 67 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-10
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLCardinality-10 finished in 60829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p1)))'
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 381/381 transitions.
Graph (complete) has 681 edges and 197 vertex of which 194 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 193 transition count 347
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 163 transition count 341
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 160 transition count 341
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 70 place count 160 transition count 330
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 92 place count 149 transition count 330
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 104 place count 137 transition count 313
Iterating global reduction 3 with 12 rules applied. Total rules applied 116 place count 137 transition count 313
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 116 place count 137 transition count 311
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 120 place count 135 transition count 311
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 182 place count 103 transition count 281
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 194 place count 97 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 218 place count 97 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 96 transition count 294
Applied a total of 219 rules in 61 ms. Remains 96 /197 variables (removed 101) and now considering 294/381 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9090350460055350252.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2358980904378123645.kers'
[2026-05-25 09:36:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9090350460055350252.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2358980904378123645.kers]
Normalized transition count is 293 out of 294 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 293 rows 96 cols 1271 entries
Finished phase 1 with 70 SingleSign rule and 6 generalized
[2026-05-25 09:36:30] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2358980904378123645.kers
Total runtime 3 ms.
[2026-05-25 09:36:30] [INFO ] Implicit Places using invariants in 97 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/197 places, 294/381 transitions.
Applied a total of 0 rules in 12 ms. Remains 95 /95 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 95/197 places, 294/381 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p1)))'
Stuttering acceptance computed with spot in 124 ms :[p1, true, p1]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLCardinality-11 finished in 336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 381/381 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 184 transition count 365
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 184 transition count 365
Applied a total of 26 rules in 8 ms. Remains 184 /197 variables (removed 13) and now considering 365/381 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16569045615880325352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3361732870149322269.kers'
[2026-05-25 09:36:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16569045615880325352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3361732870149322269.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 184 cols 1757 entries
Finished phase 1 with 154 SingleSign rule and 8 generalized
[2026-05-25 09:36:30] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3361732870149322269.kers
Total runtime 4 ms.
[2026-05-25 09:36:30] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-25 09:36:30] [INFO ] Invariant cache hit.
[2026-05-25 09:36:30] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2026-05-25 09:36:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/216 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 224 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/586 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 590 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60244ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Starting structural reductions in LTL mode, iteration 1 : 184/197 places, 365/381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60711 ms. Remains : 184/197 places, 365/381 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 647 edges and 184 vertex of which 182 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 19 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA MedleyA-PT-19-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLCardinality-12 finished in 61221 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||(p1 U G(p2))))))'
Support contains 3 out of 197 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 : 197/197 places, 381/381 transitions.
Graph (complete) has 681 edges and 197 vertex of which 195 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 194 transition count 347
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 69 place count 163 transition count 341
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 160 transition count 341
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 72 place count 160 transition count 330
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 94 place count 149 transition count 330
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 107 place count 136 transition count 312
Iterating global reduction 3 with 13 rules applied. Total rules applied 120 place count 136 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 120 place count 136 transition count 311
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 135 transition count 311
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 185 place count 102 transition count 281
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 199 place count 95 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 223 place count 95 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 224 place count 94 transition count 296
Applied a total of 224 rules in 32 ms. Remains 94 /197 variables (removed 103) and now considering 296/381 (removed 85) transitions.
[2026-05-25 09:37:31] [INFO ] Flow matrix only has 295 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-9558346006879756825.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17037898305383264620.kers'
[2026-05-25 09:37:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9558346006879756825.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17037898305383264620.kers]
Normalized transition count is 294 out of 295 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 294 rows 94 cols 1292 entries
Finished phase 1 with 70 SingleSign rule and 5 generalized
[2026-05-25 09:37:31] [INFO ] Computed 19 invariants in 10 ms
Computed 19 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-17037898305383264620.kers
Total runtime 11 ms.
[2026-05-25 09:37:31] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-25 09:37:31] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2026-05-25 09:37:31] [INFO ] Invariant cache hit.
[2026-05-25 09:37:31] [INFO ] State equation strengthened by 136 read => feed constraints.
[2026-05-25 09:37:32] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2026-05-25 09:37:32] [INFO ] Redundant transitions in 51 ms returned []
Running 294 sub problems to find dead transitions.
[2026-05-25 09:37:32] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2026-05-25 09:37:32] [INFO ] Invariant cache hit.
[2026-05-25 09:37:32] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 294/388 variables, 94/117 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 135/252 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 1/389 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 255 constraints, problems are : Problem set: 0 solved, 294 unsolved in 22274 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 294/388 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 135/254 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 294/548 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 10 (OVERLAPS) 1/389 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 549 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52470ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 52470ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/197 places, 296/381 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52974 ms. Remains : 94/197 places, 296/381 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U G(p1))||p2))))'
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-14
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLCardinality-14 finished in 53076 ms.
All properties solved by simple procedures.
Total runtime 569539 ms.

BK_STOP 1779701904731

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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