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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 231K 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 MedleyB-PT-B01-LTLCardinality-00
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-01
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-02
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-03
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-04
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-05
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-06
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-07
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-08
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-09
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-10
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-11
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-12
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-13
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-14
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779704478777

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 10:21:20] [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 10:21:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:21:20] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2026-05-25 10:21:20] [INFO ] Transformed 925 places.
[2026-05-25 10:21:20] [INFO ] Transformed 1037 transitions.
[2026-05-25 10:21:20] [INFO ] Found NUPN structural information;
[2026-05-25 10:21:20] [INFO ] Parsed PT model containing 925 places and 1037 transitions and 2433 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA MedleyB-PT-B01-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 925 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 925/925 places, 1037/1037 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 74 place count 851 transition count 963
Iterating global reduction 0 with 74 rules applied. Total rules applied 148 place count 851 transition count 963
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 193 place count 806 transition count 918
Iterating global reduction 0 with 45 rules applied. Total rules applied 238 place count 806 transition count 918
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 265 place count 779 transition count 891
Iterating global reduction 0 with 27 rules applied. Total rules applied 292 place count 779 transition count 891
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 314 place count 757 transition count 869
Iterating global reduction 0 with 22 rules applied. Total rules applied 336 place count 757 transition count 869
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 355 place count 738 transition count 850
Iterating global reduction 0 with 19 rules applied. Total rules applied 374 place count 738 transition count 850
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 392 place count 720 transition count 832
Iterating global reduction 0 with 18 rules applied. Total rules applied 410 place count 720 transition count 832
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 427 place count 703 transition count 815
Iterating global reduction 0 with 17 rules applied. Total rules applied 444 place count 703 transition count 815
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 461 place count 686 transition count 798
Iterating global reduction 0 with 17 rules applied. Total rules applied 478 place count 686 transition count 798
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 492 place count 672 transition count 784
Iterating global reduction 0 with 14 rules applied. Total rules applied 506 place count 672 transition count 784
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 517 place count 661 transition count 773
Iterating global reduction 0 with 11 rules applied. Total rules applied 528 place count 661 transition count 773
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 530 place count 661 transition count 771
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 535 place count 656 transition count 766
Iterating global reduction 1 with 5 rules applied. Total rules applied 540 place count 656 transition count 766
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 545 place count 651 transition count 761
Iterating global reduction 1 with 5 rules applied. Total rules applied 550 place count 651 transition count 761
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 552 place count 649 transition count 759
Iterating global reduction 1 with 2 rules applied. Total rules applied 554 place count 649 transition count 759
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 556 place count 647 transition count 757
Iterating global reduction 1 with 2 rules applied. Total rules applied 558 place count 647 transition count 757
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 560 place count 645 transition count 755
Iterating global reduction 1 with 2 rules applied. Total rules applied 562 place count 645 transition count 755
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 564 place count 643 transition count 753
Iterating global reduction 1 with 2 rules applied. Total rules applied 566 place count 643 transition count 753
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 568 place count 641 transition count 751
Iterating global reduction 1 with 2 rules applied. Total rules applied 570 place count 641 transition count 751
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 572 place count 639 transition count 749
Iterating global reduction 1 with 2 rules applied. Total rules applied 574 place count 639 transition count 749
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 576 place count 637 transition count 747
Iterating global reduction 1 with 2 rules applied. Total rules applied 578 place count 637 transition count 747
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 580 place count 635 transition count 745
Iterating global reduction 1 with 2 rules applied. Total rules applied 582 place count 635 transition count 745
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 584 place count 633 transition count 743
Iterating global reduction 1 with 2 rules applied. Total rules applied 586 place count 633 transition count 743
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 588 place count 631 transition count 741
Iterating global reduction 1 with 2 rules applied. Total rules applied 590 place count 631 transition count 741
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 592 place count 631 transition count 739
Applied a total of 592 rules in 965 ms. Remains 631 /925 variables (removed 294) and now considering 739/1037 (removed 298) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5482677594160621892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5318584779887259145.kers'
[2026-05-25 10:21:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5482677594160621892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5318584779887259145.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 739 rows 631 cols 1819 entries
Finished phase 1 with 627 SingleSign rule and 0 generalized
[2026-05-25 10:21:22] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5318584779887259145.kers
Total runtime 5 ms.
[2026-05-25 10:21:22] [INFO ] Implicit Places using invariants in 565 ms returned []
[2026-05-25 10:21:22] [INFO ] Invariant cache hit.
[2026-05-25 10:21:23] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1604 ms to find 0 implicit places.
Running 738 sub problems to find dead transitions.
[2026-05-25 10:21:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/631 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 631/1370 variables, and 4 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 738 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/631 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 631/1370 variables, and 8 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 0/738 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60307ms problems are : Problem set: 0 solved, 738 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Starting structural reductions in LTL mode, iteration 1 : 631/925 places, 739/1037 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62962 ms. Remains : 631/925 places, 739/1037 transitions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 739/739 transitions.
Applied a total of 0 rules in 23 ms. Remains 631 /631 variables (removed 0) and now considering 739/739 (removed 0) transitions.
[2026-05-25 10:22:24] [INFO ] Invariant cache hit.
[2026-05-25 10:22:24] [INFO ] Implicit Places using invariants in 324 ms returned []
[2026-05-25 10:22:24] [INFO ] Invariant cache hit.
[2026-05-25 10:22:25] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1251 ms. Remains : 631/631 places, 739/739 transitions.
Support contains 29 out of 631 places after structural reductions.
[2026-05-25 10:22:25] [INFO ] Flatten gal took : 63 ms
[2026-05-25 10:22:25] [INFO ] Flatten gal took : 29 ms
[2026-05-25 10:22:25] [INFO ] Input system was already deterministic with 739 transitions.
RANDOM walk for 40000 steps (644 resets) in 1637 ms. (24 steps per ms) remains 4/16 properties
BEST_FIRST walk for 40003 steps (168 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (130 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (162 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (159 resets) in 163 ms. (243 steps per ms) remains 3/4 properties
[2026-05-25 10:22:26] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 610/616 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/631 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/631 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 739/1370 variables, 631/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1370 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1370 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1370/1370 variables, and 635 constraints, problems are : Problem set: 0 solved, 3 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 610/616 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/616 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 15/631 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/631 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 739/1370 variables, 631/637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1370 variables, 3/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1370 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1370 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1370/1370 variables, and 640 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1922 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2653ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 651 ms.
Support contains 6 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 739/739 transitions.
Graph (trivial) has 618 edges and 631 vertex of which 48 / 631 are part of one of the 9 SCC in 6 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 868 edges and 592 vertex of which 589 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 431 transitions
Trivial Post-agglo rules discarded 431 transitions
Performed 431 trivial Post agglomeration. Transition count delta: 431
Iterating post reduction 0 with 434 rules applied. Total rules applied 436 place count 589 transition count 251
Reduce places removed 431 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 440 rules applied. Total rules applied 876 place count 158 transition count 242
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 884 place count 154 transition count 238
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 888 place count 150 transition count 238
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 888 place count 150 transition count 203
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 958 place count 115 transition count 203
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 962 place count 111 transition count 199
Iterating global reduction 4 with 4 rules applied. Total rules applied 966 place count 111 transition count 199
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 967 place count 110 transition count 198
Iterating global reduction 4 with 1 rules applied. Total rules applied 968 place count 110 transition count 198
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1014 place count 87 transition count 175
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1022 place count 87 transition count 167
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1041 place count 68 transition count 114
Iterating global reduction 5 with 19 rules applied. Total rules applied 1060 place count 68 transition count 114
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1068 place count 68 transition count 106
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1077 place count 59 transition count 97
Iterating global reduction 6 with 9 rules applied. Total rules applied 1086 place count 59 transition count 97
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1091 place count 54 transition count 92
Iterating global reduction 6 with 5 rules applied. Total rules applied 1096 place count 54 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1098 place count 54 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1104 place count 51 transition count 87
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1112 place count 47 transition count 110
Free-agglomeration rule applied 19 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 19 rules applied. Total rules applied 1131 place count 47 transition count 84
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 1158 place count 28 transition count 76
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1161 place count 25 transition count 73
Iterating global reduction 8 with 3 rules applied. Total rules applied 1164 place count 25 transition count 73
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1167 place count 25 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 1187 place count 25 transition count 50
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1188 place count 25 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1189 place count 25 transition count 49
Applied a total of 1189 rules in 69 ms. Remains 25 /631 variables (removed 606) and now considering 49/739 (removed 690) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 25/631 places, 49/739 transitions.
RANDOM walk for 23372 steps (5 resets) in 208 ms. (111 steps per ms) remains 0/3 properties
Computed a total of 130 stabilizing places and 136 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p0)||(X(!p0)&&F((G(F(!p1))||(F(!p1)&&X(!p2)))))))))'
Support contains 6 out of 631 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 739/739 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 625 transition count 733
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 625 transition count 733
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 621 transition count 729
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 621 transition count 729
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 617 transition count 725
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 617 transition count 725
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 613 transition count 721
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 613 transition count 721
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 609 transition count 717
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 609 transition count 717
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 605 transition count 713
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 605 transition count 713
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 601 transition count 709
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 601 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 600 transition count 707
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 599 transition count 706
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 598 transition count 705
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 598 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 598 transition count 704
Applied a total of 68 rules in 169 ms. Remains 598 /631 variables (removed 33) and now considering 704/739 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16004947928685790351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5996382152932309175.kers'
[2026-05-25 10:22:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16004947928685790351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5996382152932309175.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 704 rows 598 cols 1743 entries
Finished phase 1 with 594 SingleSign rule and 0 generalized
[2026-05-25 10:22:30] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5996382152932309175.kers
Total runtime 3 ms.
[2026-05-25 10:22:30] [INFO ] Implicit Places using invariants in 347 ms returned []
[2026-05-25 10:22:30] [INFO ] Invariant cache hit.
[2026-05-25 10:22:31] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
Running 703 sub problems to find dead transitions.
[2026-05-25 10:22:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/598 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/1302 variables, and 4 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/598 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/598 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/1302 variables, and 7 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/598 constraints, PredecessorRefiner: 0/703 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Starting structural reductions in LTL mode, iteration 1 : 598/631 places, 704/739 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61252 ms. Remains : 598/631 places, 704/739 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(X(p0)&&F((G(F(p1))||(F(p1)&&X(p2)))))))))'
Stuttering acceptance computed with spot in 485 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-01
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 3 ms.
FORMULA MedleyB-PT-B01-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLCardinality-01 finished in 61863 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) U X(X(X(G(p1)))))))'
Support contains 4 out of 631 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 739/739 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 624 transition count 732
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 624 transition count 732
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 619 transition count 727
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 619 transition count 727
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 614 transition count 722
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 614 transition count 722
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 609 transition count 717
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 609 transition count 717
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 605 transition count 713
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 605 transition count 713
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 601 transition count 709
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 601 transition count 709
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 597 transition count 705
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 597 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 597 transition count 704
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 596 transition count 703
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 596 transition count 703
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 595 transition count 702
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 595 transition count 702
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 594 transition count 701
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 594 transition count 701
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 594 transition count 700
Applied a total of 76 rules in 266 ms. Remains 594 /631 variables (removed 37) and now considering 700/739 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8692865413684267530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13378463856990305216.kers'
[2026-05-25 10:23:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8692865413684267530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13378463856990305216.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 700 rows 594 cols 1735 entries
Finished phase 1 with 590 SingleSign rule and 0 generalized
[2026-05-25 10:23:32] [INFO ] Computed 4 invariants in 7 ms
Computed 4 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-13378463856990305216.kers
Total runtime 9 ms.
[2026-05-25 10:23:32] [INFO ] Implicit Places using invariants in 364 ms returned []
[2026-05-25 10:23:32] [INFO ] Invariant cache hit.
[2026-05-25 10:23:33] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
Running 699 sub problems to find dead transitions.
[2026-05-25 10:23:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/594 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1294 variables, and 4 constraints, problems are : Problem set: 0 solved, 699 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/594 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 699 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/594 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 699 unsolved
SMT process timed out in 60274ms, After SMT, problems are : Problem set: 0 solved, 699 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 594/631 places, 700/739 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61593 ms. Remains : 594/631 places, 700/739 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) U X(X(X(G(p1)))))))'
Stuttering acceptance computed with spot in 525 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-02
Product exploration explored 100000 steps with 16649 reset in 299 ms.
Product exploration explored 100000 steps with 16625 reset in 254 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge based reduction with 9 factoid took 68 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (657 resets) in 265 ms. (150 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (161 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (164 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (164 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
[2026-05-25 10:24:34] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 398/402 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 192/594 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 700/1294 variables, 594/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1294 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1294 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1294/1294 variables, and 598 constraints, problems are : Problem set: 0 solved, 3 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 594/594 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 398/402 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 192/594 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 700/1294 variables, 594/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1294 variables, 3/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1294 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1294 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1294 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1294/1294 variables, and 603 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3219 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 594/594 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4117ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 129 ms.
Support contains 4 out of 594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 700/700 transitions.
Graph (trivial) has 586 edges and 594 vertex of which 48 / 594 are part of one of the 9 SCC in 1 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 824 edges and 555 vertex of which 552 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 411 rules applied. Total rules applied 413 place count 552 transition count 235
Reduce places removed 408 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 417 rules applied. Total rules applied 830 place count 144 transition count 226
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 836 place count 141 transition count 223
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 839 place count 138 transition count 223
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 839 place count 138 transition count 189
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 907 place count 104 transition count 189
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 908 place count 104 transition count 188
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 952 place count 82 transition count 166
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 958 place count 82 transition count 160
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 976 place count 64 transition count 110
Iterating global reduction 6 with 18 rules applied. Total rules applied 994 place count 64 transition count 110
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1003 place count 64 transition count 101
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1012 place count 55 transition count 89
Iterating global reduction 7 with 9 rules applied. Total rules applied 1021 place count 55 transition count 89
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1026 place count 50 transition count 84
Iterating global reduction 7 with 5 rules applied. Total rules applied 1031 place count 50 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1032 place count 50 transition count 83
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1038 place count 47 transition count 80
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1046 place count 43 transition count 108
Free-agglomeration rule applied 17 times with reduction of 10 identical transitions.
Iterating global reduction 8 with 17 rules applied. Total rules applied 1063 place count 43 transition count 81
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 1089 place count 26 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1091 place count 25 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1100 place count 25 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 1110 place count 25 transition count 68
Applied a total of 1110 rules in 27 ms. Remains 25 /594 variables (removed 569) and now considering 68/700 (removed 632) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 25/594 places, 68/700 transitions.
RANDOM walk for 30004 steps (6 resets) in 104 ms. (285 steps per ms) remains 0/3 properties
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 566 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Knowledge-based reduction took 5307 ms.
Stuttering acceptance computed with spot in 632 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Support contains 4 out of 594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 700/700 transitions.
Applied a total of 0 rules in 37 ms. Remains 594 /594 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2026-05-25 10:24:40] [INFO ] Invariant cache hit.
[2026-05-25 10:24:40] [INFO ] Implicit Places using invariants in 334 ms returned []
[2026-05-25 10:24:40] [INFO ] Invariant cache hit.
[2026-05-25 10:24:41] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1111 ms. Remains : 594/594 places, 700/700 transitions.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge based reduction with 9 factoid took 88 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (646 resets) in 102 ms. (388 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (162 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (159 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (160 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
[2026-05-25 10:24:41] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 398/402 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 192/594 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 700/1294 variables, 594/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1294 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1294 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1294/1294 variables, and 598 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 594/594 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 398/402 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 192/594 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 700/1294 variables, 594/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1294 variables, 3/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1294 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1294 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1294 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1294/1294 variables, and 603 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3298 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 594/594 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4531ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 127 ms.
Support contains 4 out of 594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 700/700 transitions.
Graph (trivial) has 586 edges and 594 vertex of which 48 / 594 are part of one of the 9 SCC in 1 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 824 edges and 555 vertex of which 552 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 411 rules applied. Total rules applied 413 place count 552 transition count 235
Reduce places removed 408 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 417 rules applied. Total rules applied 830 place count 144 transition count 226
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 836 place count 141 transition count 223
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 839 place count 138 transition count 223
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 839 place count 138 transition count 189
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 907 place count 104 transition count 189
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 908 place count 104 transition count 188
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 952 place count 82 transition count 166
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 958 place count 82 transition count 160
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 976 place count 64 transition count 110
Iterating global reduction 6 with 18 rules applied. Total rules applied 994 place count 64 transition count 110
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1003 place count 64 transition count 101
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1012 place count 55 transition count 89
Iterating global reduction 7 with 9 rules applied. Total rules applied 1021 place count 55 transition count 89
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1026 place count 50 transition count 84
Iterating global reduction 7 with 5 rules applied. Total rules applied 1031 place count 50 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1032 place count 50 transition count 83
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1038 place count 47 transition count 80
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1046 place count 43 transition count 108
Free-agglomeration rule applied 17 times with reduction of 10 identical transitions.
Iterating global reduction 8 with 17 rules applied. Total rules applied 1063 place count 43 transition count 81
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 1089 place count 26 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1091 place count 25 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1100 place count 25 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 1110 place count 25 transition count 68
Applied a total of 1110 rules in 29 ms. Remains 25 /594 variables (removed 569) and now considering 68/700 (removed 632) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 25/594 places, 68/700 transitions.
RANDOM walk for 40000 steps (8 resets) in 72 ms. (547 steps per ms) remains 1/3 properties
BEST_FIRST walk for 30024 steps (6 resets) in 19 ms. (1501 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Knowledge-based reduction took 5448 ms.
Stuttering acceptance computed with spot in 420 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 437 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 16634 reset in 191 ms.
Product exploration explored 100000 steps with 16658 reset in 182 ms.
Spot run failed in 162 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/ltsmin95912627684306843
[2026-05-25 10:24:48] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin95912627684306843
Running compilation step : cd /tmp/ltsmin95912627684306843;'/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 1235 ms.
Running link step : cd /tmp/ltsmin95912627684306843;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin95912627684306843;'/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/stateBased13809765039915497224.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 700/700 transitions.
Applied a total of 0 rules in 14 ms. Remains 594 /594 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2026-05-25 10:25:03] [INFO ] Invariant cache hit.
[2026-05-25 10:25:03] [INFO ] Implicit Places using invariants in 272 ms returned []
[2026-05-25 10:25:03] [INFO ] Invariant cache hit.
[2026-05-25 10:25:04] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 970 ms. Remains : 594/594 places, 700/700 transitions.
Built C files in :
/tmp/ltsmin16889313753124545436
[2026-05-25 10:25:04] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16889313753124545436
Running compilation step : cd /tmp/ltsmin16889313753124545436;'/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 1140 ms.
Running link step : cd /tmp/ltsmin16889313753124545436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin16889313753124545436;'/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/stateBased12597226676790481591.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 10:25:19] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:25:19] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:25:19] [INFO ] Time to serialize gal into /tmp/LTL11076285929948777930.gal : 6 ms
[2026-05-25 10:25:19] [INFO ] Time to serialize properties into /tmp/LTL13042831244368701400.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/LTL11076285929948777930.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11375817090480875418.hoa' '-atoms' '/tmp/LTL13042831244368701400.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13042831244368701400.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11375817090480875418.hoa
Detected timeout of ITS tools.
[2026-05-25 10:25:34] [INFO ] Flatten gal took : 22 ms
[2026-05-25 10:25:34] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:25:34] [INFO ] Time to serialize gal into /tmp/LTL11428046644035825931.gal : 5 ms
[2026-05-25 10:25:34] [INFO ] Time to serialize properties into /tmp/LTL5830904881516835433.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11428046644035825931.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5830904881516835433.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((p872==0)||(p915==1))"))U(X(X(X(G("((p564==0)||(p707==1))"))))))))
Formula 0 simplified : X(F!"((p872==0)||(p915==1))" R XXXF!"((p564==0)||(p707==1))")
Detected timeout of ITS tools.
[2026-05-25 10:25:50] [INFO ] Flatten gal took : 43 ms
[2026-05-25 10:25:50] [INFO ] Applying decomposition
[2026-05-25 10:25:50] [INFO ] Flatten gal took : 35 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/graph4376260638932686309.txt' '-o' '/tmp/graph4376260638932686309.bin' '-w' '/tmp/graph4376260638932686309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4376260638932686309.bin' '-l' '-1' '-v' '-w' '/tmp/graph4376260638932686309.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:25:50] [INFO ] Decomposing Gal with order
[2026-05-25 10:25:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:25:50] [INFO ] Removed a total of 388 redundant transitions.
[2026-05-25 10:25:50] [INFO ] Flatten gal took : 99 ms
[2026-05-25 10:25:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2026-05-25 10:25:50] [INFO ] Time to serialize gal into /tmp/LTL3389397657070652614.gal : 7 ms
[2026-05-25 10:25:50] [INFO ] Time to serialize properties into /tmp/LTL9845903087590053580.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/LTL3389397657070652614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9845903087590053580.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 : !((X((G("((i24.u214.p872==0)||(i27.u225.p915==1))"))U(X(X(X(G("((i15.u136.p564==0)||(i21.u182.p707==1))"))))))))
Formula 0 simplified : X(F!"((i24.u214.p872==0)||(i27.u225.p915==1))" R XXXF!"((i15.u136.p564==0)||(i21.u182.p707==1))")
Reverse transition relation is NOT exact ! Due to transitions t164, t218, t220, t254, t405, t407, t440, t523, t578, t596, t597, t600, t603, t608, t611, t61...522
Computing Next relation with stutter on 6260 deadlock states
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B01-LTLCardinality-02 finished in 153603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((!p0||G(p0)))))'
Support contains 2 out of 631 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 739/739 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 624 transition count 732
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 624 transition count 732
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 620 transition count 728
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 620 transition count 728
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 616 transition count 724
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 616 transition count 724
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 612 transition count 720
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 612 transition count 720
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 609 transition count 717
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 609 transition count 717
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 606 transition count 714
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 606 transition count 714
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 603 transition count 711
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 603 transition count 711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 602 transition count 710
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 602 transition count 710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 601 transition count 709
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 601 transition count 709
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 600 transition count 708
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 600 transition count 708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 600 transition count 707
Applied a total of 63 rules in 204 ms. Remains 600 /631 variables (removed 31) and now considering 707/739 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5861698821359175227.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3028702195341901499.kers'
[2026-05-25 10:26:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5861698821359175227.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3028702195341901499.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 707 rows 600 cols 1749 entries
Finished phase 1 with 596 SingleSign rule and 0 generalized
[2026-05-25 10:26:05] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-3028702195341901499.kers
Total runtime 11 ms.
[2026-05-25 10:26:06] [INFO ] Implicit Places using invariants in 343 ms returned []
[2026-05-25 10:26:06] [INFO ] Invariant cache hit.
[2026-05-25 10:26:06] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
Running 706 sub problems to find dead transitions.
[2026-05-25 10:26:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 706 unsolved
SMT process timed out in 30130ms, After SMT, problems are : Problem set: 0 solved, 706 unsolved
Search for dead transitions found 0 dead transitions in 30132ms
Starting structural reductions in LTL mode, iteration 1 : 600/631 places, 707/739 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31283 ms. Remains : 600/631 places, 707/739 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((!p0||G(p0)))))'
Stuttering acceptance computed with spot in 124 ms :[true, false, false, (NOT p0)]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-03
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B01-LTLCardinality-03 TRUE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLCardinality-03 finished in 31453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(G(p1))))))'
Support contains 2 out of 631 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 739/739 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 623 transition count 731
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 623 transition count 731
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 618 transition count 726
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 618 transition count 726
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 613 transition count 721
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 613 transition count 721
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 608 transition count 716
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 608 transition count 716
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 604 transition count 712
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 604 transition count 712
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 600 transition count 708
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 600 transition count 708
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 596 transition count 704
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 596 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 596 transition count 703
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 595 transition count 702
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 595 transition count 702
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 594 transition count 701
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 594 transition count 701
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 593 transition count 700
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 593 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 593 transition count 699
Applied a total of 78 rules in 155 ms. Remains 593 /631 variables (removed 38) and now considering 699/739 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12184971686697054848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1522972239206769039.kers'
[2026-05-25 10:26:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12184971686697054848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1522972239206769039.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 699 rows 593 cols 1733 entries
Finished phase 1 with 589 SingleSign rule and 0 generalized
[2026-05-25 10:26:37] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1522972239206769039.kers
Total runtime 5 ms.
[2026-05-25 10:26:37] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-25 10:26:37] [INFO ] Invariant cache hit.
[2026-05-25 10:26:38] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2026-05-25 10:26:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1292 variables, and 4 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/1292 variables, and 8 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 593/631 places, 699/739 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61252 ms. Remains : 593/631 places, 699/739 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(G(p1))))))'
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-04
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B01-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLCardinality-04 finished in 61578 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))||G(p1)))'
Support contains 4 out of 631 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 739/739 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 623 transition count 731
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 623 transition count 731
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 618 transition count 726
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 618 transition count 726
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 613 transition count 721
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 613 transition count 721
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 608 transition count 716
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 608 transition count 716
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 604 transition count 712
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 604 transition count 712
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 600 transition count 708
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 600 transition count 708
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 596 transition count 704
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 596 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 596 transition count 703
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 595 transition count 702
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 595 transition count 702
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 594 transition count 701
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 594 transition count 701
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 593 transition count 700
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 593 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 593 transition count 699
Applied a total of 78 rules in 138 ms. Remains 593 /631 variables (removed 38) and now considering 699/739 (removed 40) transitions.
[2026-05-25 10:27:38] [INFO ] Invariant cache hit.
[2026-05-25 10:27:38] [INFO ] Implicit Places using invariants in 268 ms returned []
[2026-05-25 10:27:38] [INFO ] Invariant cache hit.
[2026-05-25 10:27:39] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 593/631 places, 699/739 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1078 ms. Remains : 593/631 places, 699/739 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))||G(p1)))'
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 6325 steps with 100 reset in 10 ms.
FORMULA MedleyB-PT-B01-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLCardinality-08 finished in 1306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 631 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 631/631 places, 739/739 transitions.
Graph (trivial) has 621 edges and 631 vertex of which 48 / 631 are part of one of the 9 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 428 transitions
Trivial Post-agglo rules discarded 428 transitions
Performed 428 trivial Post agglomeration. Transition count delta: 428
Iterating post reduction 0 with 428 rules applied. Total rules applied 429 place count 591 transition count 265
Reduce places removed 428 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 437 rules applied. Total rules applied 866 place count 163 transition count 256
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 873 place count 159 transition count 253
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 876 place count 156 transition count 253
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 876 place count 156 transition count 221
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 940 place count 124 transition count 221
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 946 place count 118 transition count 215
Iterating global reduction 4 with 6 rules applied. Total rules applied 952 place count 118 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 952 place count 118 transition count 214
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 954 place count 117 transition count 214
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 955 place count 116 transition count 213
Iterating global reduction 4 with 1 rules applied. Total rules applied 956 place count 116 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 957 place count 116 transition count 212
Performed 24 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 1005 place count 92 transition count 186
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1023 place count 74 transition count 133
Iterating global reduction 5 with 18 rules applied. Total rules applied 1041 place count 74 transition count 133
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1048 place count 74 transition count 126
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1057 place count 65 transition count 114
Iterating global reduction 6 with 9 rules applied. Total rules applied 1066 place count 65 transition count 114
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1075 place count 56 transition count 102
Iterating global reduction 6 with 9 rules applied. Total rules applied 1084 place count 56 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1087 place count 56 transition count 99
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1101 place count 49 transition count 108
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1102 place count 48 transition count 102
Iterating global reduction 7 with 1 rules applied. Total rules applied 1103 place count 48 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1104 place count 48 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1107 place count 48 transition count 98
Applied a total of 1107 rules in 81 ms. Remains 48 /631 variables (removed 583) and now considering 98/739 (removed 641) transitions.
[2026-05-25 10:27:39] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11928677579510266310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5157065647873984270.kers'
[2026-05-25 10:27:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11928677579510266310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5157065647873984270.kers]
Normalized transition count is 93 out of 94 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 93 rows 47 cols 302 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-25 10:27:39] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5157065647873984270.kers
Total runtime 1 ms.
[2026-05-25 10:27:40] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-25 10:27:40] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
[2026-05-25 10:27:40] [INFO ] Invariant cache hit.
[2026-05-25 10:27:40] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 10:27:40] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2026-05-25 10:27:40] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2026-05-25 10:27:40] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
[2026-05-25 10:27:40] [INFO ] Invariant cache hit.
[2026-05-25 10:27:40] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 93/141 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 1/142 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 73 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 93/141 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 89/161 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 1/142 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/142 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 163 constraints, problems are : Problem set: 0 solved, 89 unsolved in 7851 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13095ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 13095ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/631 places, 98/739 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13397 ms. Remains : 48/631 places, 98/739 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 127 ms.
Stuttering criterion allowed to conclude after 211 steps with 29 reset in 1 ms.
FORMULA MedleyB-PT-B01-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLCardinality-10 finished in 13719 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 631 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 631/631 places, 739/739 transitions.
Graph (trivial) has 625 edges and 631 vertex of which 48 / 631 are part of one of the 9 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 433 transitions
Trivial Post-agglo rules discarded 433 transitions
Performed 433 trivial Post agglomeration. Transition count delta: 433
Iterating post reduction 0 with 433 rules applied. Total rules applied 434 place count 591 transition count 260
Reduce places removed 433 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 442 rules applied. Total rules applied 876 place count 158 transition count 251
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 882 place count 154 transition count 249
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 884 place count 152 transition count 249
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 884 place count 152 transition count 217
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 948 place count 120 transition count 217
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 955 place count 113 transition count 210
Iterating global reduction 4 with 7 rules applied. Total rules applied 962 place count 113 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 962 place count 113 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 964 place count 112 transition count 209
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 965 place count 111 transition count 208
Iterating global reduction 4 with 1 rules applied. Total rules applied 966 place count 111 transition count 208
Performed 23 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1012 place count 88 transition count 183
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1031 place count 69 transition count 129
Iterating global reduction 4 with 19 rules applied. Total rules applied 1050 place count 69 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1058 place count 69 transition count 121
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1067 place count 60 transition count 109
Iterating global reduction 5 with 9 rules applied. Total rules applied 1076 place count 60 transition count 109
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1085 place count 51 transition count 97
Iterating global reduction 5 with 9 rules applied. Total rules applied 1094 place count 51 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1097 place count 51 transition count 94
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1111 place count 44 transition count 103
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1112 place count 43 transition count 97
Iterating global reduction 6 with 1 rules applied. Total rules applied 1113 place count 43 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1114 place count 43 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1117 place count 43 transition count 93
Applied a total of 1117 rules in 30 ms. Remains 43 /631 variables (removed 588) and now considering 93/739 (removed 646) transitions.
[2026-05-25 10:27:53] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11385190698004222785.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16866921784799388168.kers'
[2026-05-25 10:27:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11385190698004222785.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16866921784799388168.kers]
Normalized transition count is 88 out of 89 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 88 rows 42 cols 292 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 10:27:53] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16866921784799388168.kers
Total runtime 2 ms.
[2026-05-25 10:27:53] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 10:27:53] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2026-05-25 10:27:53] [INFO ] Invariant cache hit.
[2026-05-25 10:27:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 10:27:53] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2026-05-25 10:27:53] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2026-05-25 10:27:53] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2026-05-25 10:27:53] [INFO ] Invariant cache hit.
[2026-05-25 10:27:53] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 88/131 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 69 constraints, problems are : Problem set: 0 solved, 84 unsolved in 6224 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 88/131 variables, 43/53 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 84/152 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 1/132 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 154 constraints, problems are : Problem set: 0 solved, 84 unsolved in 7935 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14179ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 14180ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/631 places, 93/739 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14411 ms. Remains : 43/631 places, 93/739 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 58 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-14
Product exploration explored 100000 steps with 382 reset in 45 ms.
Product exploration explored 100000 steps with 810 reset in 115 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 70 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 17022 steps (2703 resets) in 119 ms. (141 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 69 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 29 ms :[(NOT p0)]
Knowledge-based reduction took 232 ms.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 93/93 transitions.
Applied a total of 0 rules in 7 ms. Remains 43 /43 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2026-05-25 10:28:08] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2026-05-25 10:28:08] [INFO ] Invariant cache hit.
[2026-05-25 10:28:08] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 10:28:08] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2026-05-25 10:28:08] [INFO ] Invariant cache hit.
[2026-05-25 10:28:08] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 10:28:08] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2026-05-25 10:28:08] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 43/43 places, 93/93 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 82 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 35009 steps (5576 resets) in 142 ms. (244 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 53 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 49 ms :[(NOT p0)]
Knowledge-based reduction took 231 ms.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Product exploration explored 100000 steps with 121 reset in 99 ms.
Product exploration explored 100000 steps with 56 reset in 122 ms.
Built C files in :
/tmp/ltsmin14736228267409077454
[2026-05-25 10:28:09] [INFO ] Computing symmetric may disable matrix : 93 transitions.
[2026-05-25 10:28:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:28:09] [INFO ] Computing symmetric may enable matrix : 93 transitions.
[2026-05-25 10:28:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:28:09] [INFO ] Computing Do-Not-Accords matrix : 93 transitions.
[2026-05-25 10:28:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:28:09] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14736228267409077454
Running compilation step : cd /tmp/ltsmin14736228267409077454;'/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 270 ms.
Running link step : cd /tmp/ltsmin14736228267409077454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin14736228267409077454;'/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/stateBased3120338429702820895.hoa' '--buchi-type=spotba'
LTSmin run took 84 ms.
FORMULA MedleyB-PT-B01-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyB-PT-B01-LTLCardinality-14 finished in 16212 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)&&X(!p1)) U p2)))'
Support contains 5 out of 631 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 631/631 places, 739/739 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 626 transition count 734
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 626 transition count 734
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 623 transition count 731
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 623 transition count 731
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 620 transition count 728
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 620 transition count 728
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 617 transition count 725
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 617 transition count 725
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 615 transition count 723
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 615 transition count 723
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 613 transition count 721
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 613 transition count 721
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 611 transition count 719
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 611 transition count 719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 611 transition count 718
Applied a total of 41 rules in 153 ms. Remains 611 /631 variables (removed 20) and now considering 718/739 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17209168020866507299.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17813536998141769508.kers'
[2026-05-25 10:28:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17209168020866507299.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17813536998141769508.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 718 rows 611 cols 1775 entries
Finished phase 1 with 607 SingleSign rule and 0 generalized
[2026-05-25 10:28:09] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-17813536998141769508.kers
Total runtime 10 ms.
[2026-05-25 10:28:10] [INFO ] Implicit Places using invariants in 321 ms returned []
[2026-05-25 10:28:10] [INFO ] Invariant cache hit.
[2026-05-25 10:28:10] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
Running 717 sub problems to find dead transitions.
[2026-05-25 10:28:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 717 unsolved
SMT process timed out in 30130ms, After SMT, problems are : Problem set: 0 solved, 717 unsolved
Search for dead transitions found 0 dead transitions in 30132ms
Starting structural reductions in LTL mode, iteration 1 : 611/631 places, 718/739 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31273 ms. Remains : 611/631 places, 718/739 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)&&X(!p1)) U p2)))'
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (NOT p2), p1, p0, true]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B01-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLCardinality-15 finished in 31599 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) U X(X(X(G(p1)))))))'
Spot run failed in 41 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:28:41] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11503319597176023431
[2026-05-25 10:28:41] [INFO ] Computing symmetric may disable matrix : 739 transitions.
[2026-05-25 10:28:41] [INFO ] Applying decomposition
[2026-05-25 10:28:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:28:41] [INFO ] Computing symmetric may enable matrix : 739 transitions.
[2026-05-25 10:28:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:28:41] [INFO ] Flatten gal took : 21 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/graph11021111620494241824.txt' '-o' '/tmp/graph11021111620494241824.bin' '-w' '/tmp/graph11021111620494241824.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11021111620494241824.bin' '-l' '-1' '-v' '-w' '/tmp/graph11021111620494241824.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:28:41] [INFO ] Decomposing Gal with order
[2026-05-25 10:28:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:28:41] [INFO ] Removed a total of 383 redundant transitions.
[2026-05-25 10:28:41] [INFO ] Computing Do-Not-Accords matrix : 739 transitions.
[2026-05-25 10:28:41] [INFO ] Flatten gal took : 51 ms
[2026-05-25 10:28:41] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:28:41] [INFO ] Built C files in 186ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11503319597176023431
Running compilation step : cd /tmp/ltsmin11503319597176023431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 10:28:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2026-05-25 10:28:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality11263673884196717603.gal : 7 ms
[2026-05-25 10:28:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality3528695396669808081.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/LTLCardinality11263673884196717603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3528695396669808081.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 1 LTL properties
Checking formula 0 : !((X((G("((i27.u225.p872==0)||(i28.u239.p915==1))"))U(X(X(X(G("((i17.u148.p564==0)||(i22.i1.i0.u192.p707==1))"))))))))
Formula 0 simplified : X(F!"((i27.u225.p872==0)||(i28.u239.p915==1))" R XXXF!"((i17.u148.p564==0)||(i22.i1.i0.u192.p707==1))")
Reverse transition relation is NOT exact ! Due to transitions t75, t85, t164, t218, t296, t351, t405, t407, t492, t577, t580, t600, t608, t611, t614, t615,...539
Computing Next relation with stutter on 6986 deadlock states
Compilation finished in 1882 ms.
Running link step : cd /tmp/ltsmin11503319597176023431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11503319597176023431;'/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(([]((LTLAPp0==true)) U X(X(X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
153 unique states visited
136 strongly connected components in search stack
154 transitions explored
151 items max in DFS search stack
1741 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,17.4859,440224,1,0,788239,794,7601,2.27888e+06,277,4692,1527732
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyB-PT-B01-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 461592 ms.

BK_STOP 1779704942221

--------------------
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="MedleyB-PT-B01"
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 MedleyB-PT-B01, 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-177969020000283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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