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-177969020000267.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-22, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000267
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:31 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 238K 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-22-LTLCardinality-00
FORMULA_NAME MedleyA-PT-22-LTLCardinality-01
FORMULA_NAME MedleyA-PT-22-LTLCardinality-02
FORMULA_NAME MedleyA-PT-22-LTLCardinality-03
FORMULA_NAME MedleyA-PT-22-LTLCardinality-04
FORMULA_NAME MedleyA-PT-22-LTLCardinality-05
FORMULA_NAME MedleyA-PT-22-LTLCardinality-06
FORMULA_NAME MedleyA-PT-22-LTLCardinality-07
FORMULA_NAME MedleyA-PT-22-LTLCardinality-08
FORMULA_NAME MedleyA-PT-22-LTLCardinality-09
FORMULA_NAME MedleyA-PT-22-LTLCardinality-10
FORMULA_NAME MedleyA-PT-22-LTLCardinality-11
FORMULA_NAME MedleyA-PT-22-LTLCardinality-12
FORMULA_NAME MedleyA-PT-22-LTLCardinality-13
FORMULA_NAME MedleyA-PT-22-LTLCardinality-14
FORMULA_NAME MedleyA-PT-22-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779702549968

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-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 09:49:11] [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:49:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:49:11] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2026-05-25 09:49:11] [INFO ] Transformed 307 places.
[2026-05-25 09:49:11] [INFO ] Transformed 740 transitions.
[2026-05-25 09:49:11] [INFO ] Found NUPN structural information;
[2026-05-25 09:49:11] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-22-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-22-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 303 transition count 740
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 86 place count 221 transition count 641
Iterating global reduction 1 with 82 rules applied. Total rules applied 168 place count 221 transition count 641
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 173 place count 221 transition count 636
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 193 place count 201 transition count 581
Iterating global reduction 2 with 20 rules applied. Total rules applied 213 place count 201 transition count 581
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 219 place count 195 transition count 567
Iterating global reduction 2 with 6 rules applied. Total rules applied 225 place count 195 transition count 567
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 228 place count 192 transition count 558
Iterating global reduction 2 with 3 rules applied. Total rules applied 231 place count 192 transition count 558
Applied a total of 231 rules in 99 ms. Remains 192 /307 variables (removed 115) and now considering 558/740 (removed 182) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14862918567849814540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18119126717951021317.kers'
[2026-05-25 09:49:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14862918567849814540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18119126717951021317.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 558 rows 192 cols 3267 entries
Finished phase 1 with 162 SingleSign rule and 8 generalized
[2026-05-25 09:49:12] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18119126717951021317.kers
Total runtime 6 ms.
[2026-05-25 09:49:12] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-05-25 09:49:12] [INFO ] Invariant cache hit.
[2026-05-25 09:49:13] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
Running 557 sub problems to find dead transitions.
[2026-05-25 09:49:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD532 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/192 variables, 12/22 constraints. Problems are: Problem set: 144 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 9/31 constraints. Problems are: Problem set: 144 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 1/32 constraints. Problems are: Problem set: 144 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/32 constraints. Problems are: Problem set: 144 solved, 413 unsolved
At refinement iteration 6 (OVERLAPS) 558/750 variables, 192/224 constraints. Problems are: Problem set: 144 solved, 413 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/750 variables, and 226 constraints, problems are : Problem set: 144 solved, 413 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 144 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 10/10 constraints. Problems are: Problem set: 144 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 144 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 12/22 constraints. Problems are: Problem set: 144 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 12/34 constraints. Problems are: Problem set: 144 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/34 constraints. Problems are: Problem set: 144 solved, 413 unsolved
At refinement iteration 5 (OVERLAPS) 558/750 variables, 192/226 constraints. Problems are: Problem set: 144 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 413/639 constraints. Problems are: Problem set: 144 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/750 variables, and 646 constraints, problems are : Problem set: 144 solved, 413 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 413/557 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61181ms problems are : Problem set: 144 solved, 413 unsolved
Search for dead transitions found 144 dead transitions in 61210ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 192/307 places, 414/740 transitions.
Applied a total of 0 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62212 ms. Remains : 192/307 places, 414/740 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 414/414 transitions.
Applied a total of 0 rules in 3 ms. Remains 192 /192 variables (removed 0) and now considering 414/414 (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-17847611522643118904.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2029573319884898299.kers'
[2026-05-25 09:50:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17847611522643118904.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2029573319884898299.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 414 rows 192 cols 2115 entries
Finished phase 1 with 162 SingleSign rule and 8 generalized
[2026-05-25 09:50:14] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2029573319884898299.kers
Total runtime 2 ms.
[2026-05-25 09:50:14] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-25 09:50:14] [INFO ] Invariant cache hit.
[2026-05-25 09:50:14] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2026-05-25 09:50:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (OVERLAPS) 414/606 variables, 192/227 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/606 variables, and 231 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (OVERLAPS) 414/606 variables, 192/231 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/606 variables, 413/644 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 2/646 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/606 variables, and 646 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60315ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 60316ms
Finished structural reductions in LTL mode , in 1 iterations and 60772 ms. Remains : 192/192 places, 414/414 transitions.
Support contains 38 out of 192 places after structural reductions.
[2026-05-25 09:51:15] [INFO ] Flatten gal took : 62 ms
[2026-05-25 09:51:15] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:51:15] [INFO ] Input system was already deterministic with 414 transitions.
RANDOM walk for 40000 steps (1161 resets) in 2074 ms. (19 steps per ms) remains 16/25 properties
BEST_FIRST walk for 4004 steps (23 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (23 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (22 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (21 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (21 resets) in 67 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (24 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (21 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (23 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (23 resets) in 34 ms. (114 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (22 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (22 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (21 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (24 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (22 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
[2026-05-25 09:51:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 132/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 24/179 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 3/182 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 406/588 variables, 182/204 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 12/600 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 5/605 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/605 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 1/606 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/606 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/606 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 214 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1825 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 132/155 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 24/179 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 3/182 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 406/588 variables, 182/208 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/588 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/588 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 12/600 variables, 7/229 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/600 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/606 variables, and 236 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 189/192 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6841ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 414/414 transitions.
Graph (complete) has 789 edges and 192 vertex of which 191 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 191 transition count 386
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 165 transition count 385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 164 transition count 385
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 56 place count 164 transition count 381
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 64 place count 160 transition count 381
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 69 place count 155 transition count 371
Iterating global reduction 3 with 5 rules applied. Total rules applied 74 place count 155 transition count 371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 74 place count 155 transition count 370
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 154 transition count 370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 153 transition count 368
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 153 transition count 368
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 123 place count 130 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 130 transition count 345
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 128 place count 126 transition count 339
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 126 transition count 339
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 144 place count 120 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 4 with 41 rules applied. Total rules applied 185 place count 120 transition count 342
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 188 place count 120 transition count 339
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 191 place count 117 transition count 339
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 208 place count 117 transition count 506
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 225 place count 100 transition count 506
Applied a total of 225 rules in 150 ms. Remains 100 /192 variables (removed 92) and now considering 506/414 (removed -92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 100/192 places, 506/414 transitions.
RANDOM walk for 40000 steps (3438 resets) in 1880 ms. (21 steps per ms) remains 2/15 properties
BEST_FIRST walk for 36120 steps (687 resets) in 119 ms. (301 steps per ms) remains 0/2 properties
FORMULA MedleyA-PT-22-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 17 stabilizing places and 18 stable transitions
Graph (complete) has 789 edges and 192 vertex of which 191 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G((p1||G(p2)))||X(p3))))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 414/414 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 175 transition count 389
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 175 transition count 389
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 175 transition count 386
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 167 transition count 367
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 167 transition count 367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 166 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 166 transition count 364
Applied a total of 55 rules in 15 ms. Remains 166 /192 variables (removed 26) and now considering 364/414 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7624786117343725774.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16491699156759693624.kers'
[2026-05-25 09:51:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7624786117343725774.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16491699156759693624.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 166 cols 1967 entries
Finished phase 1 with 136 SingleSign rule and 8 generalized
[2026-05-25 09:51:24] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16491699156759693624.kers
Total runtime 2 ms.
[2026-05-25 09:51:24] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-25 09:51:24] [INFO ] Invariant cache hit.
[2026-05-25 09:51:24] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-25 09:51:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/530 variables, 166/197 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/530 variables, and 200 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/530 variables, 166/198 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 363/561 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 3/564 constraints. Problems are: Problem set: 0 solved, 363 unsolved
SMT process timed out in 60342ms, After SMT, problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60357ms
Starting structural reductions in LTL mode, iteration 1 : 166/192 places, 364/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60728 ms. Remains : 166/192 places, 364/414 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G((p1||G(p2)))||X(p3))))'
Stuttering acceptance computed with spot in 430 ms :[true, (OR (NOT p3) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-00
Product exploration explored 100000 steps with 2911 reset in 301 ms.
Product exploration explored 100000 steps with 2914 reset in 266 ms.
Computed a total of 17 stabilizing places and 18 stable transitions
Graph (complete) has 700 edges and 166 vertex of which 165 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 18 stable transitions
Knowledge based reduction with 15 factoid took 67 ms. Reduced automaton from 7 states, 15 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (1158 resets) in 361 ms. (110 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (233 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1256976 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :0 out of 1
Probabilistic random walk after 1256976 steps, saw 246744 distinct states, run finished after 3008 ms. (steps per millisecond=417 ) properties seen :0
[2026-05-25 09:52:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 72/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/126 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/141 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/490 variables, 141/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/515 variables, 16/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/517 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/517 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/517 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/524 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/529 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/530 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/530 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 72/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/126 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/141 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/490 variables, 141/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 25/515 variables, 16/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/515 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/517 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/517 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/524 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/524 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/529 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/529 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/530 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/530 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/530 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 955ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 792 steps, including 15 resets, run visited all 1 properties in 5 ms. (steps per millisecond=158 )
Parikh walk visited 1 properties in 11 ms.
Negative knowledge disproves property using: (G p2)
Knowledge based reduction with 15 factoid took 56 ms. Proved property starting from automaton with 4 states, 5 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 4303 ms.
FORMULA MedleyA-PT-22-LTLCardinality-00 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyA-PT-22-LTLCardinality-00 finished in 66182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 414/414 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 172 transition count 389
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 172 transition count 389
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 172 transition count 385
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 163 transition count 364
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 163 transition count 364
Applied a total of 62 rules in 10 ms. Remains 163 /192 variables (removed 29) and now considering 364/414 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12155445756295479073.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3385006347238780459.kers'
[2026-05-25 09:52:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12155445756295479073.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3385006347238780459.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 163 cols 1985 entries
Finished phase 1 with 133 SingleSign rule and 8 generalized
[2026-05-25 09:52:30] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3385006347238780459.kers
Total runtime 2 ms.
[2026-05-25 09:52:30] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-25 09:52:30] [INFO ] Invariant cache hit.
[2026-05-25 09:52:30] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-25 09:52:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/527 variables, 163/191 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/527 variables, and 193 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/527 variables, 163/192 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 363/555 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 363 unsolved
SMT process timed out in 60319ms, After SMT, problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60321ms
Starting structural reductions in LTL mode, iteration 1 : 163/192 places, 364/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60833 ms. Remains : 163/192 places, 364/414 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 696 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 10 ms. Proved property starting from automaton with 3 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 16 ms.
FORMULA MedleyA-PT-22-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-22-LTLCardinality-04 finished in 61290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 414/414 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 174 transition count 391
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 174 transition count 391
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 174 transition count 387
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 166 transition count 370
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 166 transition count 370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 165 transition count 367
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 165 transition count 367
Applied a total of 58 rules in 8 ms. Remains 165 /192 variables (removed 27) and now considering 367/414 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10852478820891299627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17828702278720261339.kers'
[2026-05-25 09:53:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10852478820891299627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17828702278720261339.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 367 rows 165 cols 1991 entries
Finished phase 1 with 135 SingleSign rule and 8 generalized
[2026-05-25 09:53:31] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17828702278720261339.kers
Total runtime 3 ms.
[2026-05-25 09:53:32] [INFO ] Implicit Places using invariants in 281 ms returned []
[2026-05-25 09:53:32] [INFO ] Invariant cache hit.
[2026-05-25 09:53:32] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2026-05-25 09:53:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/532 variables, 165/195 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 366 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 532/532 variables, and 199 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/532 variables, 165/196 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 366/562 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 571 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60294ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Starting structural reductions in LTL mode, iteration 1 : 165/192 places, 367/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60790 ms. Remains : 165/192 places, 367/414 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Stuttering acceptance computed with spot in 129 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-05
Product exploration explored 100000 steps with 2910 reset in 163 ms.
Product exploration explored 100000 steps with 2901 reset in 174 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 701 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 6 factoid took 84 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (1157 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (234 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1450766 steps, run timeout after 3001 ms. (steps per millisecond=483 ) properties seen :0 out of 1
Probabilistic random walk after 1450766 steps, saw 282399 distinct states, run finished after 3001 ms. (steps per millisecond=483 ) properties seen :0
[2026-05-25 09:54:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/125 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/139 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 351/490 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/517 variables, 17/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/517 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/519 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/526 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/531 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/531 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/532 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/532 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/125 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/139 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 351/490 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 27/517 variables, 17/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/517 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/517 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/519 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/526 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/526 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/531 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/531 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/532 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/532 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 716ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 1 properties in 1 ms.
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 6 factoid took 51 ms. Proved property starting from automaton with 4 states, 5 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 3961 ms.
FORMULA MedleyA-PT-22-LTLCardinality-05 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyA-PT-22-LTLCardinality-05 finished in 65255 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 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 414/414 transitions.
Graph (complete) has 789 edges and 192 vertex of which 191 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 190 transition count 380
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 158 transition count 380
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 65 place count 158 transition count 375
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 75 place count 153 transition count 375
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 90 place count 138 transition count 348
Iterating global reduction 2 with 15 rules applied. Total rules applied 105 place count 138 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 105 place count 138 transition count 347
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 137 transition count 347
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 132 transition count 339
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 132 transition count 339
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 131 transition count 336
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 131 transition count 336
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 166 place count 106 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 169 place count 106 transition count 311
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 176 place count 99 transition count 296
Iterating global reduction 3 with 7 rules applied. Total rules applied 183 place count 99 transition count 296
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
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 195 place count 93 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 215 place count 93 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 217 place count 92 transition count 315
Applied a total of 217 rules in 79 ms. Remains 92 /192 variables (removed 100) and now considering 315/414 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2517417164141410451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11204374978104841047.kers'
[2026-05-25 09:54:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2517417164141410451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11204374978104841047.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 92 cols 1591 entries
Finished phase 1 with 68 SingleSign rule and 5 generalized
[2026-05-25 09:54:37] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11204374978104841047.kers
Total runtime 2 ms.
[2026-05-25 09:54:37] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 09:54:37] [INFO ] Invariant cache hit.
[2026-05-25 09:54:37] [INFO ] State equation strengthened by 142 read => feed constraints.
[2026-05-25 09:54:37] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2026-05-25 09:54:37] [INFO ] Redundant transitions in 10 ms returned []
Running 305 sub problems to find dead transitions.
[2026-05-25 09:54:37] [INFO ] Invariant cache hit.
[2026-05-25 09:54:37] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 315/406 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 142/252 constraints. Problems are: Problem set: 0 solved, 305 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/407 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/407 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 253 constraints, problems are : Problem set: 0 solved, 305 unsolved in 24401 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 315/406 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 142/252 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 305/557 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 1/407 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 558 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54673ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 54674ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/192 places, 315/414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55186 ms. Remains : 92/192 places, 315/414 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 41 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-06
Product exploration explored 100000 steps with 11675 reset in 317 ms.
Product exploration explored 100000 steps with 11657 reset in 367 ms.
Computed a total of 10 stabilizing places and 133 stable transitions
Computed a total of 10 stabilizing places and 133 stable transitions
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 14129 steps (1661 resets) in 77 ms. (181 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Knowledge-based reduction took 310 ms.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 315/315 transitions.
Applied a total of 0 rules in 7 ms. Remains 92 /92 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2026-05-25 09:55:33] [INFO ] Invariant cache hit.
[2026-05-25 09:55:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 09:55:33] [INFO ] Invariant cache hit.
[2026-05-25 09:55:33] [INFO ] State equation strengthened by 142 read => feed constraints.
[2026-05-25 09:55:33] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2026-05-25 09:55:33] [INFO ] Redundant transitions in 12 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 439 ms. Remains : 92/92 places, 315/315 transitions.
Computed a total of 10 stabilizing places and 133 stable transitions
Computed a total of 10 stabilizing places and 133 stable transitions
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 4349 steps (505 resets) in 47 ms. (90 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Knowledge-based reduction took 220 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11670 reset in 313 ms.
Product exploration explored 100000 steps with 11655 reset in 321 ms.
Built C files in :
/tmp/ltsmin1568587558216577009
[2026-05-25 09:55:34] [INFO ] Computing symmetric may disable matrix : 315 transitions.
[2026-05-25 09:55:34] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:55:34] [INFO ] Computing symmetric may enable matrix : 315 transitions.
[2026-05-25 09:55:34] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:55:34] [INFO ] Computing Do-Not-Accords matrix : 315 transitions.
[2026-05-25 09:55:34] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:55:34] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1568587558216577009
Running compilation step : cd /tmp/ltsmin1568587558216577009;'/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 1014 ms.
Running link step : cd /tmp/ltsmin1568587558216577009;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 109 ms.
Running LTSmin : cd /tmp/ltsmin1568587558216577009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11204329777783108886.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 315/315 transitions.
Applied a total of 0 rules in 7 ms. Remains 92 /92 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2026-05-25 09:55:49] [INFO ] Invariant cache hit.
[2026-05-25 09:55:49] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 09:55:49] [INFO ] Invariant cache hit.
[2026-05-25 09:55:50] [INFO ] State equation strengthened by 142 read => feed constraints.
[2026-05-25 09:55:50] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2026-05-25 09:55:50] [INFO ] Redundant transitions in 11 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 554 ms. Remains : 92/92 places, 315/315 transitions.
Built C files in :
/tmp/ltsmin13328000538702484675
[2026-05-25 09:55:50] [INFO ] Computing symmetric may disable matrix : 315 transitions.
[2026-05-25 09:55:50] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:55:50] [INFO ] Computing symmetric may enable matrix : 315 transitions.
[2026-05-25 09:55:50] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:55:50] [INFO ] Computing Do-Not-Accords matrix : 315 transitions.
[2026-05-25 09:55:50] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:55:50] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13328000538702484675
Running compilation step : cd /tmp/ltsmin13328000538702484675;'/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 774 ms.
Running link step : cd /tmp/ltsmin13328000538702484675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin13328000538702484675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18263549819029679957.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 09:56:05] [INFO ] Flatten gal took : 29 ms
[2026-05-25 09:56:05] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:56:05] [INFO ] Time to serialize gal into /tmp/LTL4809139382415647777.gal : 5 ms
[2026-05-25 09:56:05] [INFO ] Time to serialize properties into /tmp/LTL10264245443867558001.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/LTL4809139382415647777.gal' '-t' 'CGAL' '-hoa' '/tmp/aut912297478557093855.hoa' '-atoms' '/tmp/LTL10264245443867558001.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL10264245443867558001.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut912297478557093855.hoa
Reverse transition relation is NOT exact ! Due to transitions t37, t38.t39, t41, t42, t46, t73, t85, t88, t89, t93, t97, t98, t133, t136, t137, t145, t134....1179
Computing Next relation with stutter on 8258 deadlock states
Detected timeout of ITS tools.
[2026-05-25 09:56:20] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:56:20] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:56:20] [INFO ] Time to serialize gal into /tmp/LTL5502522378576415725.gal : 5 ms
[2026-05-25 09:56:20] [INFO ] Time to serialize properties into /tmp/LTL9837955581060264755.ltl : 6 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/LTL5502522378576415725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9837955581060264755.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((p99==0)||(p210==1))"))))
Formula 0 simplified : GF!"((p99==0)||(p210==1))"
Reverse transition relation is NOT exact ! Due to transitions t37, t38.t39, t41, t42, t46, t73, t85, t88, t89, t93, t97, t98, t133, t136, t137, t145, t134....1179
Computing Next relation with stutter on 8258 deadlock states
Detected timeout of ITS tools.
[2026-05-25 09:56:35] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:56:35] [INFO ] Applying decomposition
[2026-05-25 09:56:35] [INFO ] Flatten gal took : 18 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/graph16527676696801532575.txt' '-o' '/tmp/graph16527676696801532575.bin' '-w' '/tmp/graph16527676696801532575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16527676696801532575.bin' '-l' '-1' '-v' '-w' '/tmp/graph16527676696801532575.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:56:35] [INFO ] Decomposing Gal with order
[2026-05-25 09:56:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:56:35] [INFO ] Removed a total of 583 redundant transitions.
[2026-05-25 09:56:36] [INFO ] Flatten gal took : 77 ms
[2026-05-25 09:56:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 7 ms.
[2026-05-25 09:56:36] [INFO ] Time to serialize gal into /tmp/LTL1024857241715716488.gal : 3 ms
[2026-05-25 09:56:36] [INFO ] Time to serialize properties into /tmp/LTL4698518604970127784.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1024857241715716488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4698518604970127784.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((i5.u9.p99==0)||(i3.u10.p210==1))"))))
Formula 0 simplified : GF!"((i5.u9.p99==0)||(i3.u10.p210==1))"
Reverse transition relation is NOT exact ! Due to transitions t1_t2_t4_t5_t6_t7_t8, t254_t2_t3, t254_t2_t4_t5_t6_t7_t8, t15_t68_t117_t118_t119_t123_t69_t70...808
Computing Next relation with stutter on 8258 deadlock states
Detected timeout of ITS tools.
Treatment of property MedleyA-PT-22-LTLCardinality-06 finished in 134093 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(((p1 U !p2)&&p0))))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 414/414 transitions.
Graph (complete) has 789 edges and 192 vertex of which 191 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 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 191 transition count 382
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 160 transition count 381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 159 transition count 381
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 65 place count 159 transition count 376
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 75 place count 154 transition count 376
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 88 place count 141 transition count 351
Iterating global reduction 3 with 13 rules applied. Total rules applied 101 place count 141 transition count 351
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 136 transition count 343
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 136 transition count 343
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 135 transition count 340
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 135 transition count 340
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 159 place count 111 transition count 318
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 162 place count 111 transition count 315
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 169 place count 104 transition count 300
Iterating global reduction 4 with 7 rules applied. Total rules applied 176 place count 104 transition count 300
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 190 place count 97 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 214 place count 97 transition count 315
Applied a total of 214 rules in 87 ms. Remains 97 /192 variables (removed 95) and now considering 315/414 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9382387849516568506.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15569533028469321037.kers'
[2026-05-25 09:56:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9382387849516568506.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15569533028469321037.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 97 cols 1592 entries
Finished phase 1 with 71 SingleSign rule and 6 generalized
[2026-05-25 09:56:51] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15569533028469321037.kers
Total runtime 2 ms.
[2026-05-25 09:56:51] [INFO ] Implicit Places using invariants in 192 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 205 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/192 places, 315/414 transitions.
Applied a total of 0 rules in 15 ms. Remains 96 /96 variables (removed 0) and now considering 315/315 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 308 ms. Remains : 96/192 places, 315/414 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(((p1 U !p2)&&p0))))'
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), p2]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-08
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLCardinality-08 finished in 522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(!p0&&F(p1)))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 414/414 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 173 transition count 386
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 173 transition count 386
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 173 transition count 383
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 164 transition count 363
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 164 transition count 363
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 163 transition count 360
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 163 transition count 360
Applied a total of 61 rules in 6 ms. Remains 163 /192 variables (removed 29) and now considering 360/414 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15756806954578680347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5981382867267597161.kers'
[2026-05-25 09:56:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15756806954578680347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5981382867267597161.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 360 rows 163 cols 1957 entries
Finished phase 1 with 133 SingleSign rule and 8 generalized
[2026-05-25 09:56:51] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5981382867267597161.kers
Total runtime 2 ms.
[2026-05-25 09:56:51] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-25 09:56:51] [INFO ] Invariant cache hit.
[2026-05-25 09:56:52] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 359 sub problems to find dead transitions.
[2026-05-25 09:56:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/523 variables, 163/191 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/523 variables, and 195 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/523 variables, 163/192 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 359/551 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 5/556 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 560 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60406ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Starting structural reductions in LTL mode, iteration 1 : 163/192 places, 360/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61152 ms. Remains : 163/192 places, 360/414 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p2)&&p1))))'
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-22-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLCardinality-09 finished in 61466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0&&X(X(F(p1)))))||F(p2))))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 414/414 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 175 transition count 388
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 175 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 175 transition count 385
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 167 transition count 368
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 167 transition count 368
Applied a total of 53 rules in 4 ms. Remains 167 /192 variables (removed 25) and now considering 368/414 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12822453481975168487.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11919760177654419681.kers'
[2026-05-25 09:57:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12822453481975168487.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11919760177654419681.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 167 cols 1975 entries
Finished phase 1 with 137 SingleSign rule and 8 generalized
[2026-05-25 09:57:53] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-11919760177654419681.kers
Total runtime 14 ms.
[2026-05-25 09:57:53] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-25 09:57:53] [INFO ] Invariant cache hit.
[2026-05-25 09:57:53] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2026-05-25 09:57:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/535 variables, 167/195 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 199 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/535 variables, 167/196 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 367/563 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 3/566 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 567 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60338ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60339ms
Starting structural reductions in LTL mode, iteration 1 : 167/192 places, 368/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60786 ms. Remains : 167/192 places, 368/414 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0&&X(X(F(p1)))))||F(p2))))'
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-10
Product exploration explored 100000 steps with 2930 reset in 226 ms.
Product exploration explored 100000 steps with 2919 reset in 200 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 705 edges and 167 vertex of which 166 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 6 factoid took 68 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (1167 resets) in 257 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (244 resets) in 345 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (242 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (240 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (244 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (239 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 592506 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 5
Probabilistic random walk after 592506 steps, saw 118551 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
[2026-05-25 09:58:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 25/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 98/129 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 24/153 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3/156 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 359/515 variables, 156/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 14/529 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 5/534 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/535 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/535 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/535 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 189 constraints, problems are : Problem set: 0 solved, 5 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/31 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 98/129 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 24/153 variables, 9/21 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/156 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 359/515 variables, 156/178 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 2/181 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/515 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 14/529 variables, 8/189 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 3/192 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/529 variables, 2/194 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 1/195 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 5/534 variables, 2/197 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/534 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1/535 variables, 1/198 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/535 variables, 1/199 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/535 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/535 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 199 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2230 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2755ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 256 ms.
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 368/368 transitions.
Graph (complete) has 705 edges and 167 vertex of which 166 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 166 transition count 338
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 138 transition count 338
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 58 place count 138 transition count 332
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 70 place count 132 transition count 332
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 51 rules applied. Total rules applied 121 place count 105 transition count 308
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 101 transition count 302
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 101 transition count 302
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 139 place count 96 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 160 place count 96 transition count 310
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 95 transition count 320
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 166 place count 95 transition count 316
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 170 place count 91 transition count 316
Free-agglomeration rule (complex) applied 20 times with reduction of 8 identical transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 190 place count 91 transition count 535
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 234 place count 71 transition count 511
Applied a total of 234 rules in 41 ms. Remains 71 /167 variables (removed 96) and now considering 511/368 (removed -143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 71/167 places, 511/368 transitions.
RANDOM walk for 40000 steps (6437 resets) in 409 ms. (97 steps per ms) remains 0/3 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Knowledge-based reduction took 6769 ms.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Support contains 4 out of 167 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Applied a total of 0 rules in 3 ms. Remains 167 /167 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2026-05-25 09:59:01] [INFO ] Invariant cache hit.
[2026-05-25 09:59:01] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-25 09:59:01] [INFO ] Invariant cache hit.
[2026-05-25 09:59:01] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 167/167 places, 368/368 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 705 edges and 167 vertex of which 166 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (1168 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (250 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (241 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 788804 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 2
Probabilistic random walk after 788804 steps, saw 160869 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
[2026-05-25 09:59:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 98/128 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 21/149 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 356/505 variables, 149/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 20/525 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/526 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/531 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/531 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/535 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/535 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/535 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 98/128 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 21/149 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 356/505 variables, 149/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/525 variables, 12/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/526 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 5/531 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/531 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/535 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/535 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1037ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 3163 steps, including 66 resets, run visited all 2 properties in 53 ms. (steps per millisecond=59 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 54 ms.
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Knowledge-based reduction took 4667 ms.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Product exploration explored 100000 steps with 2901 reset in 234 ms.
Product exploration explored 100000 steps with 2909 reset in 209 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/ltsmin16939648518105954644
[2026-05-25 09:59:07] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16939648518105954644
Running compilation step : cd /tmp/ltsmin16939648518105954644;'/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 691 ms.
Running link step : cd /tmp/ltsmin16939648518105954644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin16939648518105954644;'/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/stateBased18421094448202573893.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 166 transition count 367
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 166 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 165 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 165 transition count 364
Applied a total of 4 rules in 12 ms. Remains 165 /167 variables (removed 2) and now considering 364/368 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1670163866890071583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13802145371931771042.kers'
[2026-05-25 09:59:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1670163866890071583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13802145371931771042.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 165 cols 1967 entries
Finished phase 1 with 135 SingleSign rule and 8 generalized
[2026-05-25 09:59:22] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13802145371931771042.kers
Total runtime 5 ms.
[2026-05-25 09:59:22] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-25 09:59:22] [INFO ] Invariant cache hit.
[2026-05-25 09:59:23] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-25 09:59:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/529 variables, 165/193 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/529 variables, and 198 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/529 variables, 165/195 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 363/558 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 4/562 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/529 variables, and 566 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60364ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Starting structural reductions in LTL mode, iteration 1 : 165/167 places, 364/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60836 ms. Remains : 165/167 places, 364/368 transitions.
Built C files in :
/tmp/ltsmin5964206148961660607
[2026-05-25 10:00:23] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5964206148961660607
Running compilation step : cd /tmp/ltsmin5964206148961660607;'/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 620 ms.
Running link step : cd /tmp/ltsmin5964206148961660607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5964206148961660607;'/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/stateBased2837535986813844658.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 10:00:38] [INFO ] Flatten gal took : 39 ms
[2026-05-25 10:00:38] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:00:38] [INFO ] Time to serialize gal into /tmp/LTL1159810387488063134.gal : 4 ms
[2026-05-25 10:00:38] [INFO ] Time to serialize properties into /tmp/LTL11992871134944748088.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/LTL1159810387488063134.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11297221081021028057.hoa' '-atoms' '/tmp/LTL11992871134944748088.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/LTL11992871134944748088.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11297221081021028057.hoa
Detected timeout of ITS tools.
[2026-05-25 10:00:53] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:00:53] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:00:53] [INFO ] Time to serialize gal into /tmp/LTL5205639829152390178.gal : 4 ms
[2026-05-25 10:00:53] [INFO ] Time to serialize properties into /tmp/LTL1312195207164938595.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5205639829152390178.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1312195207164938595.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X(("(((p195==0)||(p301==1))||((p263==0)||(p249==1)))")&&(X(X(F("((p269==0)||(p297==1))"))))))||(F("((p263==0)||(p249==1))")))))
Formula 0 simplified : F(X(!"(((p195==0)||(p301==1))||((p263==0)||(p249==1)))" | XXG!"((p269==0)||(p297==1))") & G!"((p263==0)||(p249==1))")
Detected timeout of ITS tools.
[2026-05-25 10:01:08] [INFO ] Flatten gal took : 30 ms
[2026-05-25 10:01:08] [INFO ] Applying decomposition
[2026-05-25 10:01:08] [INFO ] Flatten gal took : 28 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/graph14135431738790718084.txt' '-o' '/tmp/graph14135431738790718084.bin' '-w' '/tmp/graph14135431738790718084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14135431738790718084.bin' '-l' '-1' '-v' '-w' '/tmp/graph14135431738790718084.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:01:08] [INFO ] Decomposing Gal with order
[2026-05-25 10:01:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:01:08] [INFO ] Removed a total of 796 redundant transitions.
[2026-05-25 10:01:09] [INFO ] Flatten gal took : 43 ms
[2026-05-25 10:01:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 11 ms.
[2026-05-25 10:01:09] [INFO ] Time to serialize gal into /tmp/LTL8297832227152249351.gal : 4 ms
[2026-05-25 10:01:09] [INFO ] Time to serialize properties into /tmp/LTL13763122934183732726.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/LTL8297832227152249351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13763122934183732726.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 : !((G((X(("(((i8.u45.p195==0)||(i2.u52.p301==1))||((i8.u44.p263==0)||(i8.u43.p249==1)))")&&(X(X(F("((i8.u45.p269==0)||(i9.i1.u46.p297==...213
Formula 0 simplified : F(X(!"(((i8.u45.p195==0)||(i2.u52.p301==1))||((i8.u44.p263==0)||(i8.u43.p249==1)))" | XXG!"((i8.u45.p269==0)||(i9.i1.u46.p297==1))")...199
Reverse transition relation is NOT exact ! Due to transitions t1, t22, t75, t123, t172, t174, t181, t198, t202, t212, t215, t238, t242, i0.u5.t165, i1.t155...1195
Computing Next relation with stutter on 32780 deadlock states
Detected timeout of ITS tools.
Treatment of property MedleyA-PT-22-LTLCardinality-10 finished in 211017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U ((p1&&X((p1 U (X(X(!p2))||G(p1))))) U (G((p1&&X((p1 U (X(X(!p2))||G(p1))))))||(p1&&X((p1 U (X(X(!p2))||G(p1))))&&G(p3))))))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 414/414 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 174 transition count 387
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 174 transition count 387
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 174 transition count 384
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 166 transition count 365
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 166 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 165 transition count 362
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 165 transition count 362
Applied a total of 57 rules in 7 ms. Remains 165 /192 variables (removed 27) and now considering 362/414 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16604228140823505909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2075531632114006192.kers'
[2026-05-25 10:01:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16604228140823505909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2075531632114006192.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 362 rows 165 cols 1965 entries
Finished phase 1 with 135 SingleSign rule and 8 generalized
[2026-05-25 10:01:24] [INFO ] Computed 22 invariants in 14 ms
Computed 22 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-2075531632114006192.kers
Total runtime 15 ms.
[2026-05-25 10:01:24] [INFO ] Implicit Places using invariants in 341 ms returned []
[2026-05-25 10:01:24] [INFO ] Invariant cache hit.
[2026-05-25 10:01:24] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2026-05-25 10:01:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/527 variables, 165/194 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/527 variables, and 196 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/527 variables, 165/195 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 361/556 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 3/559 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/527 variables, and 561 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 60371ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 60372ms
Starting structural reductions in LTL mode, iteration 1 : 165/192 places, 362/414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61041 ms. Remains : 165/192 places, 362/414 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U ((p1&&X((p1 U (X(X(!p2))||G(p1))))) U (G((p1&&X((p1 U (X(X(!p2))||G(p1))))))||(p1&&X((p1 U (X(X(!p2))||G(p1))))&&G(p3))))))'
Stuttering acceptance computed with spot in 2533 ms :[(NOT p1), true, p0, (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), p2, (AND (NOT p1) p2), p2, (OR (AND (NOT p1) p2) (AND p0 p2)), (AND (NOT p1) p2), (NOT p3), (AND p0 (NOT p3) p1), (AND (NOT p1) p2 (NOT p3)), p2, (AND (NOT p1) p2), (AND p0 p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p1) p2) (AND p0 p2)), (AND (NOT p1) p2), (AND p2 (NOT p3)), (AND (NOT p3) (NOT p1) p2), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p3) p1 p2), (AND (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p3) (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-11
Stuttering criterion allowed to conclude after 1288 steps with 36 reset in 7 ms.
FORMULA MedleyA-PT-22-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLCardinality-11 finished in 63737 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)&&F(G(p1)))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 414/414 transitions.
Graph (complete) has 789 edges and 192 vertex of which 191 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 191 transition count 381
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 159 transition count 381
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 65 place count 159 transition count 375
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 77 place count 153 transition count 375
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 91 place count 139 transition count 349
Iterating global reduction 2 with 14 rules applied. Total rules applied 105 place count 139 transition count 349
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 105 place count 139 transition count 348
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 138 transition count 348
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 134 transition count 341
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 134 transition count 341
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 133 transition count 338
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 133 transition count 338
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 164 place count 109 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 167 place count 109 transition count 312
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 174 place count 102 transition count 297
Iterating global reduction 3 with 7 rules applied. Total rules applied 181 place count 102 transition count 297
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
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 193 place count 96 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 213 place count 96 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 215 place count 95 transition count 316
Applied a total of 215 rules in 78 ms. Remains 95 /192 variables (removed 97) and now considering 316/414 (removed 98) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1004620070439334907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5074663198256458554.kers'
[2026-05-25 10:02:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1004620070439334907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5074663198256458554.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 316 rows 95 cols 1506 entries
Finished phase 1 with 67 SingleSign rule and 7 generalized
[2026-05-25 10:02:27] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5074663198256458554.kers
Total runtime 3 ms.
[2026-05-25 10:02:28] [INFO ] Implicit Places using invariants in 135 ms returned [3, 33]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 139 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/192 places, 316/414 transitions.
Applied a total of 0 rules in 7 ms. Remains 93 /93 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 93/192 places, 316/414 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-15
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLCardinality-15 finished in 385 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)))'
Spot run failed in 45 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0&&X(X(F(p1)))))||F(p2))))'
Spot run failed in 61 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 10:02:28] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17143780173673520088
[2026-05-25 10:02:28] [INFO ] Computing symmetric may disable matrix : 414 transitions.
[2026-05-25 10:02:28] [INFO ] Applying decomposition
[2026-05-25 10:02:28] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:02:28] [INFO ] Computing symmetric may enable matrix : 414 transitions.
[2026-05-25 10:02:28] [INFO ] Flatten gal took : 22 ms
[2026-05-25 10:02:28] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph2724493625611546620.txt' '-o' '/tmp/graph2724493625611546620.bin' '-w' '/tmp/graph2724493625611546620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2724493625611546620.bin' '-l' '-1' '-v' '-w' '/tmp/graph2724493625611546620.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:02:28] [INFO ] Decomposing Gal with order
[2026-05-25 10:02:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:02:28] [INFO ] Computing Do-Not-Accords matrix : 414 transitions.
[2026-05-25 10:02:28] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:02:28] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17143780173673520088
Running compilation step : cd /tmp/ltsmin17143780173673520088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 10:02:28] [INFO ] Removed a total of 740 redundant transitions.
[2026-05-25 10:02:28] [INFO ] Flatten gal took : 29 ms
[2026-05-25 10:02:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 20 ms.
[2026-05-25 10:02:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality2629004691151141440.gal : 6 ms
[2026-05-25 10:02:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality12187246176466605168.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2629004691151141440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12187246176466605168.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...277
Read 2 LTL properties
Checking formula 0 : !((F(G("((i4.u16.p99==0)||(i7.u30.p210==1))"))))
Formula 0 simplified : GF!"((i4.u16.p99==0)||(i7.u30.p210==1))"
Compilation finished in 1058 ms.
Running link step : cd /tmp/ltsmin17143780173673520088;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17143780173673520088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t22, t75, t96, t103, t173, t174, t181, t188, t191, t193, t197, t213, t215, t294, t295, t2...1768
Computing Next relation with stutter on 88986 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17143780173673520088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17143780173673520088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((X(((LTLAPp1==true)&&X(X(<>((LTLAPp2==true))))))||<>((LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 10:26:55] [INFO ] Applying decomposition
[2026-05-25 10:26:56] [INFO ] Flatten gal took : 223 ms
[2026-05-25 10:26:56] [INFO ] Decomposing Gal with order
[2026-05-25 10:26:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:26:57] [INFO ] Removed a total of 770 redundant transitions.
[2026-05-25 10:26:57] [INFO ] Flatten gal took : 1164 ms
[2026-05-25 10:26:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 123 labels/synchronizations in 268 ms.
[2026-05-25 10:26:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality6799408277309173283.gal : 24 ms
[2026-05-25 10:26:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality2617544146703963606.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6799408277309173283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2617544146703963606.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F(G("((i0.i0.i1.u13.p99==0)||(i0.i1.u22.p210==1))"))))
Formula 0 simplified : GF!"((i0.i0.i1.u13.p99==0)||(i0.i1.u22.p210==1))"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17143780173673520088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((X(((LTLAPp1==true)&&X(X(<>((LTLAPp2==true))))))||<>((LTLAPp3==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin17143780173673520088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t193, t198, t216, t221, t223, t227, t228, t232, t243, t246, t248, t251, i0.t304, i0.t299, i0....2866
Computing Next relation with stutter on 88986 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-22"
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-22, 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-177969020000267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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