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-177969019900171.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is MedleyA-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 107K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-10-LTLCardinality-00
FORMULA_NAME MedleyA-PT-10-LTLCardinality-01
FORMULA_NAME MedleyA-PT-10-LTLCardinality-02
FORMULA_NAME MedleyA-PT-10-LTLCardinality-03
FORMULA_NAME MedleyA-PT-10-LTLCardinality-04
FORMULA_NAME MedleyA-PT-10-LTLCardinality-05
FORMULA_NAME MedleyA-PT-10-LTLCardinality-06
FORMULA_NAME MedleyA-PT-10-LTLCardinality-07
FORMULA_NAME MedleyA-PT-10-LTLCardinality-08
FORMULA_NAME MedleyA-PT-10-LTLCardinality-09
FORMULA_NAME MedleyA-PT-10-LTLCardinality-10
FORMULA_NAME MedleyA-PT-10-LTLCardinality-11
FORMULA_NAME MedleyA-PT-10-LTLCardinality-12
FORMULA_NAME MedleyA-PT-10-LTLCardinality-13
FORMULA_NAME MedleyA-PT-10-LTLCardinality-14
FORMULA_NAME MedleyA-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779699650546

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 09:00:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:00:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:00:52] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2026-05-25 09:00:52] [INFO ] Transformed 149 places.
[2026-05-25 09:00:52] [INFO ] Transformed 340 transitions.
[2026-05-25 09:00:52] [INFO ] Found NUPN structural information;
[2026-05-25 09:00:52] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 340/340 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 146 transition count 340
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 37 place count 112 transition count 301
Iterating global reduction 1 with 34 rules applied. Total rules applied 71 place count 112 transition count 301
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 74 place count 112 transition count 298
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 81 place count 105 transition count 288
Iterating global reduction 2 with 7 rules applied. Total rules applied 88 place count 105 transition count 288
Applied a total of 88 rules in 52 ms. Remains 105 /149 variables (removed 44) and now considering 288/340 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6679310032998148253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17998894766026588636.kers'
[2026-05-25 09:00:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6679310032998148253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17998894766026588636.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 105 cols 1587 entries
Finished phase 1 with 91 SingleSign rule and 4 generalized
[2026-05-25 09:00:52] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17998894766026588636.kers
Total runtime 2 ms.
[2026-05-25 09:00:53] [INFO ] Implicit Places using invariants in 548 ms returned []
[2026-05-25 09:00:53] [INFO ] Invariant cache hit.
[2026-05-25 09:00:53] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2026-05-25 09:00:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/105 variables, 6/10 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 7/17 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/19 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 288/393 variables, 105/124 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 1/125 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 3/128 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/128 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/393 variables, 1/129 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 0/129 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 12 (OVERLAPS) 0/393 variables, 0/129 constraints. Problems are: Problem set: 64 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 129 constraints, problems are : Problem set: 64 solved, 223 unsolved in 29872 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 64 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 6/10 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 10/20 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 288/393 variables, 105/125 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 223/348 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/350 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 3/353 constraints. Problems are: Problem set: 64 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/393 variables, and 354 constraints, problems are : Problem set: 64 solved, 223 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 223/287 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/4 constraints]
After SMT, in 60392ms problems are : Problem set: 64 solved, 223 unsolved
Search for dead transitions found 64 dead transitions in 60419ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 105/149 places, 224/340 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61412 ms. Remains : 105/149 places, 224/340 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 224/224 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8968033055171246583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-782020444965651921.kers'
[2026-05-25 09:01:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8968033055171246583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-782020444965651921.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 105 cols 1075 entries
Finished phase 1 with 91 SingleSign rule and 4 generalized
[2026-05-25 09:01:53] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-782020444965651921.kers
Total runtime 1 ms.
[2026-05-25 09:01:53] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 09:01:53] [INFO ] Invariant cache hit.
[2026-05-25 09:01:54] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-25 09:01:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/329 variables, 105/120 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 12 (OVERLAPS) 0/329 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 132 constraints, problems are : Problem set: 0 solved, 223 unsolved in 25086 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/329 variables, 105/130 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 223/353 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 359 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 55208ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 55209ms
Finished structural reductions in LTL mode , in 1 iterations and 55511 ms. Remains : 105/105 places, 224/224 transitions.
Support contains 25 out of 105 places after structural reductions.
[2026-05-25 09:02:49] [INFO ] Flatten gal took : 57 ms
[2026-05-25 09:02:49] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:02:49] [INFO ] Input system was already deterministic with 224 transitions.
RANDOM walk for 40000 steps (1738 resets) in 1597 ms. (25 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40004 steps (430 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (443 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (424 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (420 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (443 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
[2026-05-25 09:02:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 72/83 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/88 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 217/305 variables, 88/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 21/326 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 3/329 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/329 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 115 constraints, problems are : Problem set: 0 solved, 5 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 72/83 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 217/305 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 21/326 variables, 15/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 3/329 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/329 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/329 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 127 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2897 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3120ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 3267 steps, including 50 resets, run visited all 1 properties in 7 ms. (steps per millisecond=466 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 271 ms.
FORMULA MedleyA-PT-10-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 13 stable transitions
Graph (complete) has 416 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 224/224 transitions.
Graph (complete) has 416 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 104 transition count 210
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 91 transition count 208
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 29 place count 91 transition count 206
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 89 transition count 206
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 41 place count 81 transition count 192
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 81 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 49 place count 81 transition count 190
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 79 transition count 190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 76 transition count 177
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 76 transition count 177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 74 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 74 transition count 173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 72 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 72 transition count 167
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 105 place count 52 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 52 transition count 146
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 49 transition count 141
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 49 transition count 141
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 126 place count 43 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 136 place count 43 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 42 transition count 159
Applied a total of 138 rules in 42 ms. Remains 42 /105 variables (removed 63) and now considering 159/224 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2818868258852151126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15087987168973395241.kers'
[2026-05-25 09:02:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2818868258852151126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15087987168973395241.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 159 rows 42 cols 750 entries
Finished phase 1 with 32 SingleSign rule and 2 generalized
[2026-05-25 09:02:53] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15087987168973395241.kers
Total runtime 1 ms.
[2026-05-25 09:02:54] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 09:02:54] [INFO ] Invariant cache hit.
[2026-05-25 09:02:54] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-25 09:02:54] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2026-05-25 09:02:54] [INFO ] Redundant transitions in 3 ms returned []
Running 155 sub problems to find dead transitions.
[2026-05-25 09:02:54] [INFO ] Invariant cache hit.
[2026-05-25 09:02:54] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 159/201 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 90/140 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 140 constraints, problems are : Problem set: 0 solved, 155 unsolved in 5202 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 159/201 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 90/140 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 155/295 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 295 constraints, problems are : Problem set: 0 solved, 155 unsolved in 10237 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15535ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 15536ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/105 places, 159/224 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15768 ms. Remains : 42/105 places, 159/224 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 300 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-02
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-02 finished in 16159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 224/224 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 96 transition count 209
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 96 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 96 transition count 208
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 92 transition count 192
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 92 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 91 transition count 190
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 91 transition count 190
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 90 transition count 187
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 90 transition count 187
Applied a total of 31 rules in 9 ms. Remains 90 /105 variables (removed 15) and now considering 187/224 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-678220486299619925.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1244994878801309922.kers'
[2026-05-25 09:03:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-678220486299619925.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1244994878801309922.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 90 cols 949 entries
Finished phase 1 with 76 SingleSign rule and 4 generalized
[2026-05-25 09:03:10] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1244994878801309922.kers
Total runtime 1 ms.
[2026-05-25 09:03:10] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 09:03:10] [INFO ] Invariant cache hit.
[2026-05-25 09:03:10] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2026-05-25 09:03:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/277 variables, 90/103 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (OVERLAPS) 0/277 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 108 constraints, problems are : Problem set: 0 solved, 186 unsolved in 15304 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/277 variables, 90/106 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 186/292 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/277 variables, and 298 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45399ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 45400ms
Starting structural reductions in LTL mode, iteration 1 : 90/105 places, 187/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45608 ms. Remains : 90/105 places, 187/224 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2756 steps with 122 reset in 38 ms.
FORMULA MedleyA-PT-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-04 finished in 45914 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 U p1))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 224/224 transitions.
Graph (complete) has 416 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 103 transition count 211
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 92 transition count 209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 92 transition count 207
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 90 transition count 207
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 35 place count 84 transition count 198
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 84 transition count 198
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 41 place count 84 transition count 197
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 83 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 81 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 81 transition count 187
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 79 transition count 183
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 79 transition count 183
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 77 transition count 177
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 77 transition count 177
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 87 place count 60 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 60 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 91 place count 58 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 58 transition count 158
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 111 place count 49 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 3 with 46 rules applied. Total rules applied 157 place count 49 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 48 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 47 transition count 176
Applied a total of 160 rules in 76 ms. Remains 47 /105 variables (removed 58) and now considering 176/224 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3560082273470807151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10625745986165629030.kers'
[2026-05-25 09:03:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3560082273470807151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10625745986165629030.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 47 cols 812 entries
Finished phase 1 with 37 SingleSign rule and 2 generalized
[2026-05-25 09:03:56] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10625745986165629030.kers
Total runtime 2 ms.
[2026-05-25 09:03:56] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 09:03:56] [INFO ] Invariant cache hit.
[2026-05-25 09:03:56] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-25 09:03:56] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2026-05-25 09:03:56] [INFO ] Redundant transitions in 9 ms returned []
Running 172 sub problems to find dead transitions.
[2026-05-25 09:03:56] [INFO ] Invariant cache hit.
[2026-05-25 09:03:56] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 2/46 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 176/222 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 70/126 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (OVERLAPS) 1/223 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/223 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 127 constraints, problems are : Problem set: 0 solved, 172 unsolved in 10290 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 2/46 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 176/222 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 70/126 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 172/298 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 1/223 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 223/223 variables, and 299 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40415ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 40416ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/105 places, 176/224 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40785 ms. Remains : 47/105 places, 176/224 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 U p1))))'
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-05
Product exploration explored 100000 steps with 10081 reset in 330 ms.
Product exploration explored 100000 steps with 10043 reset in 239 ms.
Computed a total of 12 stabilizing places and 100 stable transitions
Computed a total of 12 stabilizing places and 100 stable transitions
Detected a total of 12/47 stabilizing places and 100/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 145 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (4018 resets) in 782 ms. (51 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (976 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
[2026-05-25 09:04:37] [INFO ] Invariant cache hit.
[2026-05-25 09:04:37] [INFO ] State equation strengthened by 70 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/37 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 163/200 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 46/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/222 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 24/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/223 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/223 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 30/223 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 4/6 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/47 constraints, ReadFeed: 0/70 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 12 factoid took 240 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 1087 ms.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 47 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 176/176 transitions.
Applied a total of 0 rules in 24 ms. Remains 47 /47 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2026-05-25 09:04:38] [INFO ] Invariant cache hit.
[2026-05-25 09:04:38] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 09:04:38] [INFO ] Invariant cache hit.
[2026-05-25 09:04:38] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-25 09:04:39] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2026-05-25 09:04:39] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 47/47 places, 176/176 transitions.
Computed a total of 12 stabilizing places and 100 stable transitions
Computed a total of 12 stabilizing places and 100 stable transitions
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (4021 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32282 steps (741 resets) in 101 ms. (316 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 275 ms.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10062 reset in 169 ms.
Product exploration explored 100000 steps with 10088 reset in 160 ms.
Built C files in :
/tmp/ltsmin1374307598897456055
[2026-05-25 09:04:39] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2026-05-25 09:04:39] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:04:39] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2026-05-25 09:04:39] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:04:39] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2026-05-25 09:04:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:04:39] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1374307598897456055
Running compilation step : cd /tmp/ltsmin1374307598897456055;'/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 658 ms.
Running link step : cd /tmp/ltsmin1374307598897456055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 92 ms.
Running LTSmin : cd /tmp/ltsmin1374307598897456055;'/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/stateBased14459765247612565217.hoa' '--buchi-type=spotba'
LTSmin run took 5530 ms.
FORMULA MedleyA-PT-10-LTLCardinality-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-10-LTLCardinality-05 finished in 50265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 224/224 transitions.
Graph (complete) has 416 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 103 transition count 211
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 92 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 91 transition count 208
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 27 place count 91 transition count 205
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 33 place count 88 transition count 205
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 40 place count 81 transition count 193
Iterating global reduction 3 with 7 rules applied. Total rules applied 47 place count 81 transition count 193
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 47 place count 81 transition count 191
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 79 transition count 191
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 53 place count 77 transition count 183
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 77 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 76 transition count 181
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 76 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 75 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 75 transition count 178
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 91 place count 58 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 94 place count 58 transition count 160
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 56 transition count 156
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 56 transition count 156
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 112 place count 49 transition count 202
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 4 with 44 rules applied. Total rules applied 156 place count 49 transition count 158
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 162 place count 46 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 46 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 45 transition count 186
Applied a total of 165 rules in 88 ms. Remains 45 /105 variables (removed 60) and now considering 186/224 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6015158751784809641.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15716060598136250350.kers'
[2026-05-25 09:04:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6015158751784809641.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15716060598136250350.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 45 cols 885 entries
Finished phase 1 with 35 SingleSign rule and 2 generalized
[2026-05-25 09:04:46] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15716060598136250350.kers
Total runtime 2 ms.
[2026-05-25 09:04:46] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 09:04:46] [INFO ] Invariant cache hit.
[2026-05-25 09:04:46] [INFO ] State equation strengthened by 98 read => feed constraints.
[2026-05-25 09:04:46] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2026-05-25 09:04:46] [INFO ] Redundant transitions in 2 ms returned []
Running 181 sub problems to find dead transitions.
[2026-05-25 09:04:46] [INFO ] Invariant cache hit.
[2026-05-25 09:04:46] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 186/230 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 98/150 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 1/231 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/231 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 151 constraints, problems are : Problem set: 0 solved, 181 unsolved in 9216 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 186/230 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 98/150 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 181/331 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 1/231 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 332 constraints, problems are : Problem set: 0 solved, 181 unsolved in 19933 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29250ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 29251ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/105 places, 186/224 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29544 ms. Remains : 45/105 places, 186/224 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-07
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-07 finished in 29631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 224/224 transitions.
Graph (complete) has 416 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 103 transition count 211
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 92 transition count 209
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 25 place count 92 transition count 206
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 31 place count 89 transition count 206
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 38 place count 82 transition count 194
Iterating global reduction 2 with 7 rules applied. Total rules applied 45 place count 82 transition count 194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 45 place count 82 transition count 192
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 80 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 78 transition count 184
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 78 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 77 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 77 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 76 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 76 transition count 179
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 91 place count 58 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 58 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 97 place count 55 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 55 transition count 155
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 116 place count 47 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 146 place count 47 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 150 place count 45 transition count 189
Applied a total of 150 rules in 26 ms. Remains 45 /105 variables (removed 60) and now considering 189/224 (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-15091744288624304177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12387260247827479521.kers'
[2026-05-25 09:05:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15091744288624304177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12387260247827479521.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 45 cols 892 entries
Finished phase 1 with 35 SingleSign rule and 2 generalized
[2026-05-25 09:05:15] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12387260247827479521.kers
Total runtime 1 ms.
[2026-05-25 09:05:15] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 09:05:15] [INFO ] Invariant cache hit.
[2026-05-25 09:05:16] [INFO ] State equation strengthened by 106 read => feed constraints.
[2026-05-25 09:05:16] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2026-05-25 09:05:16] [INFO ] Redundant transitions in 2 ms returned []
Running 183 sub problems to find dead transitions.
[2026-05-25 09:05:16] [INFO ] Invariant cache hit.
[2026-05-25 09:05:16] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 189/233 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 106/158 constraints. Problems are: Problem set: 0 solved, 183 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 1/234 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 159 constraints, problems are : Problem set: 0 solved, 183 unsolved in 9546 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 189/233 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 106/158 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 183/341 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 1/234 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 342 constraints, problems are : Problem set: 0 solved, 183 unsolved in 20715 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30368ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 30368ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/105 places, 189/224 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30574 ms. Remains : 45/105 places, 189/224 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-11
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-11 finished in 30722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 224/224 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 96 transition count 210
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 96 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 96 transition count 209
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 92 transition count 193
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 92 transition count 193
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 90 transition count 189
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 90 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 88 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 88 transition count 183
Applied a total of 35 rules in 21 ms. Remains 88 /105 variables (removed 17) and now considering 183/224 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11151095043506862315.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18437521093496713825.kers'
[2026-05-25 09:05:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11151095043506862315.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18437521093496713825.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 88 cols 937 entries
Finished phase 1 with 74 SingleSign rule and 4 generalized
[2026-05-25 09:05:46] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18437521093496713825.kers
Total runtime 1 ms.
[2026-05-25 09:05:46] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-25 09:05:46] [INFO ] Invariant cache hit.
[2026-05-25 09:05:46] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2026-05-25 09:05:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/271 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 103 constraints, problems are : Problem set: 0 solved, 182 unsolved in 12366 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/271 variables, 88/101 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 182/283 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 182 unsolved
SMT process timed out in 42484ms, After SMT, problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 42485ms
Starting structural reductions in LTL mode, iteration 1 : 88/105 places, 183/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42775 ms. Remains : 88/105 places, 183/224 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 348 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 38 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 45 ms.
FORMULA MedleyA-PT-10-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-10-LTLCardinality-13 finished in 43253 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((p0&&(p0 U p1)))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 224/224 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 96 transition count 209
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 96 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 96 transition count 208
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 92 transition count 192
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 92 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 90 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 90 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 88 transition count 182
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 88 transition count 182
Applied a total of 35 rules in 8 ms. Remains 88 /105 variables (removed 17) and now considering 182/224 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14618133256018902732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10998872660625457730.kers'
[2026-05-25 09:06:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14618133256018902732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10998872660625457730.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 88 cols 935 entries
Finished phase 1 with 74 SingleSign rule and 4 generalized
[2026-05-25 09:06:29] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10998872660625457730.kers
Total runtime 1 ms.
[2026-05-25 09:06:29] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 09:06:29] [INFO ] Invariant cache hit.
[2026-05-25 09:06:30] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2026-05-25 09:06:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/270 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 105 constraints, problems are : Problem set: 0 solved, 181 unsolved in 15074 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 181/284 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 0/270 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 290 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45150ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 45150ms
Starting structural reductions in LTL mode, iteration 1 : 88/105 places, 182/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45323 ms. Remains : 88/105 places, 182/224 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(((p0 U p1)&&p0))))'
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 106 ms.
Product exploration explored 100000 steps with 33333 reset in 94 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Graph (complete) has 347 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Computed a total of 10 stabilizing places and 10 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 12 ms. Proved property starting from automaton with 5 states, 7 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 40 ms.
FORMULA MedleyA-PT-10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-10-LTLCardinality-14 finished in 45879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p1)))&&F(p2)&&p0)))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 224/224 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 97 transition count 210
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 97 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 97 transition count 209
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 93 transition count 193
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 93 transition count 193
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 91 transition count 189
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 91 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 89 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 89 transition count 183
Applied a total of 33 rules in 3 ms. Remains 89 /105 variables (removed 16) and now considering 183/224 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13971752471397727471.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1695981063994796395.kers'
[2026-05-25 09:07:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13971752471397727471.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1695981063994796395.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 89 cols 937 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-05-25 09:07:15] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1695981063994796395.kers
Total runtime 1 ms.
[2026-05-25 09:07:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 09:07:15] [INFO ] Invariant cache hit.
[2026-05-25 09:07:15] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2026-05-25 09:07:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/272 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 0/272 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 105 constraints, problems are : Problem set: 0 solved, 182 unsolved in 13000 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/272 variables, 89/103 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 182/285 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 272/272 variables, and 289 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43083ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 43096ms
Starting structural reductions in LTL mode, iteration 1 : 89/105 places, 183/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43321 ms. Remains : 89/105 places, 183/224 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p1)))&&F(p2)&&p0)))'
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-15 finished in 43638 ms.
All properties solved by simple procedures.
Total runtime 427409 ms.

BK_STOP 1779700079416

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-10, 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-177969019900171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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