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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.9K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 158K 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-18-LTLCardinality-00
FORMULA_NAME MedleyA-PT-18-LTLCardinality-01
FORMULA_NAME MedleyA-PT-18-LTLCardinality-02
FORMULA_NAME MedleyA-PT-18-LTLCardinality-03
FORMULA_NAME MedleyA-PT-18-LTLCardinality-04
FORMULA_NAME MedleyA-PT-18-LTLCardinality-05
FORMULA_NAME MedleyA-PT-18-LTLCardinality-06
FORMULA_NAME MedleyA-PT-18-LTLCardinality-07
FORMULA_NAME MedleyA-PT-18-LTLCardinality-08
FORMULA_NAME MedleyA-PT-18-LTLCardinality-09
FORMULA_NAME MedleyA-PT-18-LTLCardinality-10
FORMULA_NAME MedleyA-PT-18-LTLCardinality-11
FORMULA_NAME MedleyA-PT-18-LTLCardinality-12
FORMULA_NAME MedleyA-PT-18-LTLCardinality-13
FORMULA_NAME MedleyA-PT-18-LTLCardinality-14
FORMULA_NAME MedleyA-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779701018937

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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 09:23:40] [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:23:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:23:40] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2026-05-25 09:23:40] [INFO ] Transformed 252 places.
[2026-05-25 09:23:40] [INFO ] Transformed 543 transitions.
[2026-05-25 09:23:40] [INFO ] Found NUPN structural information;
[2026-05-25 09:23:40] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-18-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 213 transition count 476
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 213 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 212 transition count 475
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 212 transition count 475
Applied a total of 80 rules in 73 ms. Remains 212 /252 variables (removed 40) and now considering 475/541 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7037347027736436015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1893719035122530528.kers'
[2026-05-25 09:23:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7037347027736436015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1893719035122530528.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 475 rows 212 cols 2300 entries
Finished phase 1 with 204 SingleSign rule and 1 generalized
[2026-05-25 09:23:41] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1893719035122530528.kers
Total runtime 3 ms.
[2026-05-25 09:23:41] [INFO ] Implicit Places using invariants in 449 ms returned []
[2026-05-25 09:23:41] [INFO ] Invariant cache hit.
[2026-05-25 09:23:41] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
Running 474 sub problems to find dead transitions.
[2026-05-25 09:23:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 212/687 variables, and 62 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/212 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 55/62 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 212/687 variables, and 70 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/212 constraints, PredecessorRefiner: 0/474 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60400ms problems are : Problem set: 0 solved, 474 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Starting structural reductions in LTL mode, iteration 1 : 212/252 places, 475/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61468 ms. Remains : 212/252 places, 475/541 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 475/475 transitions.
Applied a total of 0 rules in 5 ms. Remains 212 /212 variables (removed 0) and now considering 475/475 (removed 0) transitions.
[2026-05-25 09:24:42] [INFO ] Invariant cache hit.
[2026-05-25 09:24:42] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 09:24:42] [INFO ] Invariant cache hit.
[2026-05-25 09:24:42] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 212/212 places, 475/475 transitions.
Support contains 36 out of 212 places after structural reductions.
[2026-05-25 09:24:43] [INFO ] Flatten gal took : 71 ms
[2026-05-25 09:24:43] [INFO ] Flatten gal took : 34 ms
[2026-05-25 09:24:43] [INFO ] Input system was already deterministic with 475 transitions.
Support contains 32 out of 212 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (1534 resets) in 1973 ms. (20 steps per ms) remains 15/21 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 66 ms. (59 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 77 ms. (51 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (34 resets) in 76 ms. (51 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (32 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (36 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (34 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (44 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
[2026-05-25 09:24:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 180/203 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 9/212 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 475/687 variables, 212/219 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/687 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/687 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 687/687 variables, and 219 constraints, problems are : Problem set: 0 solved, 15 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 180/203 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 9/212 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 475/687 variables, 212/222 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/687 variables, 15/237 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/687 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/687 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/687 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/687 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 687/687 variables, and 247 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5743ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 475/475 transitions.
Graph (trivial) has 184 edges and 212 vertex of which 9 / 212 are part of one of the 2 SCC in 12 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 205 transition count 437
Reduce places removed 29 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 35 rules applied. Total rules applied 65 place count 176 transition count 431
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 71 place count 170 transition count 431
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 71 place count 170 transition count 424
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 163 transition count 424
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 162 transition count 422
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 162 transition count 422
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 159 place count 126 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 163 place count 126 transition count 382
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 165 place count 124 transition count 354
Iterating global reduction 4 with 2 rules applied. Total rules applied 167 place count 124 transition count 354
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 203 place count 106 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 106 transition count 422
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 206 place count 105 transition count 441
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 220 place count 105 transition count 427
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 228 place count 101 transition count 423
Free-agglomeration rule applied 24 times.
Iterating global reduction 5 with 24 rules applied. Total rules applied 252 place count 101 transition count 399
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 45 rules applied. Total rules applied 297 place count 77 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 308 place count 77 transition count 367
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 309 place count 77 transition count 381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 310 place count 76 transition count 381
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 311 place count 75 transition count 380
Applied a total of 311 rules in 217 ms. Remains 75 /212 variables (removed 137) and now considering 380/475 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 75/212 places, 380/475 transitions.
RANDOM walk for 40000 steps (3275 resets) in 1067 ms. (37 steps per ms) remains 0/15 properties
Computed a total of 15 stabilizing places and 15 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(!p0)) U G(!p0))))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 475/475 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 203 transition count 461
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 203 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 202 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 202 transition count 460
Applied a total of 20 rules in 24 ms. Remains 202 /212 variables (removed 10) and now considering 460/475 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5800053843081175559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11547547232989575225.kers'
[2026-05-25 09:24:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5800053843081175559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11547547232989575225.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 460 rows 202 cols 2270 entries
Finished phase 1 with 194 SingleSign rule and 1 generalized
[2026-05-25 09:24:50] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11547547232989575225.kers
Total runtime 6 ms.
[2026-05-25 09:24:51] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-25 09:24:51] [INFO ] Invariant cache hit.
[2026-05-25 09:24:51] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2026-05-25 09:24:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/662 variables, and 58 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 6 (OVERLAPS) 460/662 variables, 202/263 constraints. Problems are: Problem set: 50 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 409/672 constraints. Problems are: Problem set: 50 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/662 variables, and 672 constraints, problems are : Problem set: 50 solved, 409 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 409/459 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60226ms problems are : Problem set: 50 solved, 409 unsolved
Search for dead transitions found 50 dead transitions in 60229ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 202/212 places, 410/475 transitions.
Applied a total of 0 rules in 18 ms. Remains 202 /202 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60804 ms. Remains : 202/212 places, 410/475 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(!p0)) U G(!p0))))'
Stuttering acceptance computed with spot in 433 ms :[true, p0, p0, p0]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLCardinality-00 finished in 61391 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 U (!p0 U p1))) U G(p2))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 475/475 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 203 transition count 461
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 203 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 202 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 202 transition count 460
Applied a total of 20 rules in 11 ms. Remains 202 /212 variables (removed 10) and now considering 460/475 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17455992546791436366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7020576551051365354.kers'
[2026-05-25 09:25:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17455992546791436366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7020576551051365354.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 460 rows 202 cols 2270 entries
Finished phase 1 with 194 SingleSign rule and 1 generalized
[2026-05-25 09:25:52] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7020576551051365354.kers
Total runtime 5 ms.
[2026-05-25 09:25:52] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-25 09:25:52] [INFO ] Invariant cache hit.
[2026-05-25 09:25:52] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2026-05-25 09:25:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 460/662 variables, 202/247 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/662 variables, and 247 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 202/662 variables, and 52 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 0/459 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Starting structural reductions in LTL mode, iteration 1 : 202/212 places, 460/475 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60793 ms. Remains : 202/212 places, 460/475 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 (!p0 U p1))) U G(p2))))'
Stuttering acceptance computed with spot in 357 ms :[p2, p2, p2, (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-03
Stuttering criterion allowed to conclude after 103 steps with 3 reset in 4 ms.
FORMULA MedleyA-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLCardinality-03 finished in 61222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 475/475 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 204 transition count 462
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 204 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 203 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 203 transition count 461
Applied a total of 18 rules in 6 ms. Remains 203 /212 variables (removed 9) and now considering 461/475 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14933321336654186308.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7082021090809650763.kers'
[2026-05-25 09:26:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14933321336654186308.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7082021090809650763.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 461 rows 203 cols 2272 entries
Finished phase 1 with 195 SingleSign rule and 1 generalized
[2026-05-25 09:26:53] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7082021090809650763.kers
Total runtime 7 ms.
[2026-05-25 09:26:53] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-25 09:26:53] [INFO ] Invariant cache hit.
[2026-05-25 09:26:53] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2026-05-25 09:26:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/664 variables, and 52 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 7 (OVERLAPS) 461/664 variables, 203/262 constraints. Problems are: Problem set: 50 solved, 410 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 410/672 constraints. Problems are: Problem set: 50 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/664 variables, and 672 constraints, problems are : Problem set: 50 solved, 410 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 410/460 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60219ms problems are : Problem set: 50 solved, 410 unsolved
Search for dead transitions found 50 dead transitions in 60220ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 203/212 places, 411/475 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60657 ms. Remains : 203/212 places, 411/475 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-04
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLCardinality-04 finished in 60882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((F(p1) U G(p2))||p0))&&X(X(p3))))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 475/475 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 203 transition count 461
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 203 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 202 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 202 transition count 460
Applied a total of 20 rules in 11 ms. Remains 202 /212 variables (removed 10) and now considering 460/475 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5580083017102472858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16403609656331026672.kers'
[2026-05-25 09:27:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5580083017102472858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16403609656331026672.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 460 rows 202 cols 2270 entries
Finished phase 1 with 194 SingleSign rule and 1 generalized
[2026-05-25 09:27:54] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16403609656331026672.kers
Total runtime 6 ms.
[2026-05-25 09:27:54] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-25 09:27:54] [INFO ] Invariant cache hit.
[2026-05-25 09:27:54] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 202/212 places, 460/475 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 202/212 places, 460/475 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((F(p1) U G(p2))||p0))&&X(X(p3))))'
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p3), (NOT p3), true]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 31 steps with 2 reset in 1 ms.
FORMULA MedleyA-PT-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLCardinality-07 finished in 806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 475/475 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 203 transition count 460
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 203 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 202 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 202 transition count 459
Applied a total of 20 rules in 4 ms. Remains 202 /212 variables (removed 10) and now considering 459/475 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5624750336637281805.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2093071266651582942.kers'
[2026-05-25 09:27:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5624750336637281805.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2093071266651582942.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 459 rows 202 cols 2268 entries
Finished phase 1 with 194 SingleSign rule and 1 generalized
[2026-05-25 09:27:54] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2093071266651582942.kers
Total runtime 2 ms.
[2026-05-25 09:27:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:27:55] [INFO ] Invariant cache hit.
[2026-05-25 09:27:55] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2026-05-25 09:27:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/661 variables, and 54 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 47/54 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 8 (OVERLAPS) 459/661 variables, 202/263 constraints. Problems are: Problem set: 50 solved, 408 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 408/671 constraints. Problems are: Problem set: 50 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 661/661 variables, and 671 constraints, problems are : Problem set: 50 solved, 408 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 408/458 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 50 solved, 408 unsolved
Search for dead transitions found 50 dead transitions in 60160ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 202/212 places, 409/475 transitions.
Applied a total of 0 rules in 2 ms. Remains 202 /202 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60516 ms. Remains : 202/212 places, 409/475 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 9 factoid took 75 ms. Proved property starting from automaton with 2 states, 3 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 97 ms.
FORMULA MedleyA-PT-18-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-18-LTLCardinality-08 finished in 61098 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 U (p1||G(p0)))) U X((!p2&&F(!p3))))))'
Support contains 7 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 475/475 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 206 transition count 464
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 206 transition count 464
Applied a total of 12 rules in 3 ms. Remains 206 /212 variables (removed 6) and now considering 464/475 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5966937957754395040.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6232335287782399094.kers'
[2026-05-25 09:28:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5966937957754395040.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6232335287782399094.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 464 rows 206 cols 2278 entries
Finished phase 1 with 198 SingleSign rule and 1 generalized
[2026-05-25 09:28:56] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6232335287782399094.kers
Total runtime 3 ms.
[2026-05-25 09:28:56] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:28:56] [INFO ] Invariant cache hit.
[2026-05-25 09:28:56] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2026-05-25 09:28:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 5 (OVERLAPS) 464/670 variables, 206/247 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/670 variables, and 252 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 6 (OVERLAPS) 464/670 variables, 206/267 constraints. Problems are: Problem set: 50 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/670 variables, 413/680 constraints. Problems are: Problem set: 50 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/670 variables, and 680 constraints, problems are : Problem set: 50 solved, 413 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 413/463 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60206ms problems are : Problem set: 50 solved, 413 unsolved
Search for dead transitions found 50 dead transitions in 60209ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 206/212 places, 414/475 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60605 ms. Remains : 206/212 places, 414/475 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0 U (G(p0)||p1))) U X((!p2&&F(!p3))))))'
Stuttering acceptance computed with spot in 292 ms :[(OR p2 p3), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)), (OR p2 p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p3 (NOT p0)), p3]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-09
Product exploration explored 100000 steps with 3833 reset in 171 ms.
Product exploration explored 100000 steps with 3835 reset in 239 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 18 factoid took 93 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (1534 resets) in 380 ms. (104 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (354 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (460 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (357 resets) in 418 ms. (95 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (354 resets) in 372 ms. (107 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (350 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (353 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (351 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6607719480111251937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8603159530213119880.kers'
[2026-05-25 09:29:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6607719480111251937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8603159530213119880.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 414 rows 206 cols 1778 entries
Finished phase 1 with 198 SingleSign rule and 1 generalized
[2026-05-25 09:29:58] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8603159530213119880.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 161/166 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 40/206 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 414/620 variables, 206/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/620 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 620/620 variables, and 213 constraints, problems are : Problem set: 0 solved, 6 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 161/166 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 40/206 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 414/620 variables, 206/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/620 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/620 variables, 7/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/620 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/620 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 620/620 variables, and 234 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3148 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3501ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2164 ms.
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 414/414 transitions.
Graph (trivial) has 208 edges and 206 vertex of which 9 / 206 are part of one of the 2 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 199 transition count 360
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 95 place count 154 transition count 356
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 152 transition count 356
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 97 place count 152 transition count 349
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 111 place count 145 transition count 349
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 142 transition count 344
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 142 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 117 place count 142 transition count 343
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 119 place count 141 transition count 343
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 183 place count 109 transition count 311
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 189 place count 109 transition count 305
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 195 place count 103 transition count 283
Iterating global reduction 4 with 6 rules applied. Total rules applied 201 place count 103 transition count 283
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 204 place count 100 transition count 273
Iterating global reduction 4 with 3 rules applied. Total rules applied 207 place count 100 transition count 273
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -121
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 249 place count 79 transition count 394
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 260 place count 79 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 284 place count 79 transition count 359
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 290 place count 76 transition count 356
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 5 with 2 rules applied. Total rules applied 292 place count 75 transition count 368
Free-agglomeration rule applied 23 times.
Iterating global reduction 5 with 23 rules applied. Total rules applied 315 place count 75 transition count 345
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 71 rules applied. Total rules applied 386 place count 52 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 6 with 30 rules applied. Total rules applied 416 place count 52 transition count 267
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 420 place count 52 transition count 263
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 424 place count 48 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 7 with 20 rules applied. Total rules applied 444 place count 48 transition count 243
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 7 with 2 rules applied. Total rules applied 446 place count 47 transition count 254
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 448 place count 47 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 450 place count 45 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 456 place count 45 transition count 246
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 8 with 2 rules applied. Total rules applied 458 place count 44 transition count 257
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 461 place count 44 transition count 254
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 463 place count 44 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 465 place count 42 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 466 place count 41 transition count 281
Applied a total of 466 rules in 91 ms. Remains 41 /206 variables (removed 165) and now considering 281/414 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 41/206 places, 281/414 transitions.
RANDOM walk for 9444 steps (832 resets) in 50 ms. (185 steps per ms) remains 0/6 properties
Knowledge based reduction with 18 factoid took 201 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(OR p2 p3), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)), (OR p2 p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p3 (NOT p0)), p3]
[2026-05-25 09:30:04] [INFO ] Invariant cache hit.
Proved EG p2 asserting that LTL formula F !p2 is false.
[2026-05-25 09:30:04] [INFO ] Invariant cache hit.
[2026-05-25 09:30:04] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:30:05] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2026-05-25 09:30:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:30:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:30:05] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2026-05-25 09:30:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2026-05-25 09:30:05] [INFO ] Computed and/alt/rep : 328/1083/328 causal constraints (skipped 85 transitions) in 31 ms.
[2026-05-25 09:30:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2026-05-25 09:30:07] [INFO ] Added : 134 causal constraints over 28 iterations in 1395 ms. Result :sat
Could not prove EG p3
Negative knowledge disproves property using: (F (NOT p2))
Knowledge-based reduction took 9698 ms.
FORMULA MedleyA-PT-18-LTLCardinality-09 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyA-PT-18-LTLCardinality-09 finished in 71063 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 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 475/475 transitions.
Graph (trivial) has 223 edges and 212 vertex of which 13 / 212 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 201 transition count 418
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 97 place count 155 transition count 414
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 153 transition count 414
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 99 place count 153 transition count 408
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 111 place count 147 transition count 408
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 121 place count 137 transition count 390
Iterating global reduction 3 with 10 rules applied. Total rules applied 131 place count 137 transition count 390
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 131 place count 137 transition count 388
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 135 place count 135 transition count 388
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 199 place count 103 transition count 356
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 205 place count 103 transition count 350
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 211 place count 97 transition count 314
Iterating global reduction 4 with 6 rules applied. Total rules applied 217 place count 97 transition count 314
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 221 place count 93 transition count 302
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 93 transition count 302
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 255 place count 78 transition count 366
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 259 place count 78 transition count 362
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 263 place count 76 transition count 392
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 289 place count 76 transition count 366
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 297 place count 72 transition count 362
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 298 place count 71 transition count 361
Applied a total of 298 rules in 61 ms. Remains 71 /212 variables (removed 141) and now considering 361/475 (removed 114) transitions.
[2026-05-25 09:30:07] [INFO ] Flow matrix only has 337 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9429067505105625304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7590356842803538808.kers'
[2026-05-25 09:30:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9429067505105625304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7590356842803538808.kers]
Normalized transition count is 336 out of 337 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 336 rows 71 cols 1584 entries
Finished phase 1 with 63 SingleSign rule and 1 generalized
[2026-05-25 09:30:07] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7590356842803538808.kers
Total runtime 5 ms.
[2026-05-25 09:30:07] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 09:30:07] [INFO ] Flow matrix only has 337 transitions (discarded 24 similar events)
[2026-05-25 09:30:07] [INFO ] Invariant cache hit.
[2026-05-25 09:30:07] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:30:07] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2026-05-25 09:30:07] [INFO ] Redundant transitions in 12 ms returned []
Running 355 sub problems to find dead transitions.
[2026-05-25 09:30:07] [INFO ] Flow matrix only has 337 transitions (discarded 24 similar events)
[2026-05-25 09:30:07] [INFO ] Invariant cache hit.
[2026-05-25 09:30:07] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (OVERLAPS) 1/71 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (OVERLAPS) 336/407 variables, 71/88 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 78/166 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 10 (OVERLAPS) 1/408 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 408/408 variables, and 169 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 71/71 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (OVERLAPS) 1/71 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 6 (OVERLAPS) 336/407 variables, 71/90 constraints. Problems are: Problem set: 42 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 78/168 constraints. Problems are: Problem set: 42 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/408 variables, and 481 constraints, problems are : Problem set: 42 solved, 313 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 71/71 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 313/355 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60314ms problems are : Problem set: 42 solved, 313 unsolved
Search for dead transitions found 42 dead transitions in 60315ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 71/212 places, 319/475 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 329
Applied a total of 2 rules in 11 ms. Remains 70 /71 variables (removed 1) and now considering 329/319 (removed -10) transitions.
[2026-05-25 09:31:08] [INFO ] Flow matrix only has 305 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13293331744325748994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7269280035139140090.kers'
[2026-05-25 09:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13293331744325748994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7269280035139140090.kers]
Normalized transition count is 304 out of 305 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 304 rows 70 cols 1384 entries
Finished phase 1 with 62 SingleSign rule and 1 generalized
[2026-05-25 09:31:08] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7269280035139140090.kers
Total runtime 1 ms.
[2026-05-25 09:31:08] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 09:31:08] [INFO ] Flow matrix only has 305 transitions (discarded 24 similar events)
[2026-05-25 09:31:08] [INFO ] Invariant cache hit.
[2026-05-25 09:31:08] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:31:08] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/212 places, 329/475 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61110 ms. Remains : 70/212 places, 329/475 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 45 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-12
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLCardinality-12 finished in 61180 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)&&X(X(G(p1)))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 475/475 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 203 transition count 461
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 203 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 202 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 202 transition count 460
Applied a total of 20 rules in 6 ms. Remains 202 /212 variables (removed 10) and now considering 460/475 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14542976336544773075.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3691887813642442650.kers'
[2026-05-25 09:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14542976336544773075.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3691887813642442650.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 460 rows 202 cols 2270 entries
Finished phase 1 with 194 SingleSign rule and 1 generalized
[2026-05-25 09:31:08] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3691887813642442650.kers
Total runtime 2 ms.
[2026-05-25 09:31:08] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-25 09:31:08] [INFO ] Invariant cache hit.
[2026-05-25 09:31:08] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 202/212 places, 460/475 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 473 ms. Remains : 202/212 places, 460/475 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)&&X(X(G(p1)))))'
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 48099 steps with 1848 reset in 93 ms.
FORMULA MedleyA-PT-18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLCardinality-13 finished in 749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 475/475 transitions.
Graph (trivial) has 220 edges and 212 vertex of which 13 / 212 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 201 transition count 421
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 91 place count 158 transition count 417
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 95 place count 156 transition count 415
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 97 place count 154 transition count 415
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 97 place count 154 transition count 408
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 111 place count 147 transition count 408
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 121 place count 137 transition count 390
Iterating global reduction 4 with 10 rules applied. Total rules applied 131 place count 137 transition count 390
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 131 place count 137 transition count 388
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 135 place count 135 transition count 388
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 199 place count 103 transition count 356
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 205 place count 103 transition count 350
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 210 place count 98 transition count 316
Iterating global reduction 5 with 5 rules applied. Total rules applied 215 place count 98 transition count 316
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 218 place count 95 transition count 308
Iterating global reduction 5 with 3 rules applied. Total rules applied 221 place count 95 transition count 308
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 251 place count 80 transition count 372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 255 place count 80 transition count 368
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 259 place count 78 transition count 398
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 285 place count 78 transition count 372
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 293 place count 74 transition count 368
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 294 place count 73 transition count 367
Applied a total of 294 rules in 79 ms. Remains 73 /212 variables (removed 139) and now considering 367/475 (removed 108) transitions.
[2026-05-25 09:31:09] [INFO ] Flow matrix only has 343 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16933089075809643311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9678756464601195399.kers'
[2026-05-25 09:31:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16933089075809643311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9678756464601195399.kers]
Normalized transition count is 342 out of 343 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 342 rows 73 cols 1604 entries
Finished phase 1 with 65 SingleSign rule and 1 generalized
[2026-05-25 09:31:09] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9678756464601195399.kers
Total runtime 3 ms.
[2026-05-25 09:31:09] [INFO ] Implicit Places using invariants in 202 ms returned []
[2026-05-25 09:31:09] [INFO ] Flow matrix only has 343 transitions (discarded 24 similar events)
[2026-05-25 09:31:09] [INFO ] Invariant cache hit.
[2026-05-25 09:31:09] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:31:09] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2026-05-25 09:31:09] [INFO ] Redundant transitions in 7 ms returned []
Running 362 sub problems to find dead transitions.
[2026-05-25 09:31:09] [INFO ] Flow matrix only has 343 transitions (discarded 24 similar events)
[2026-05-25 09:31:09] [INFO ] Invariant cache hit.
[2026-05-25 09:31:09] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (OVERLAPS) 342/415 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (OVERLAPS) 1/416 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (OVERLAPS) 0/416 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 170 constraints, problems are : Problem set: 0 solved, 362 unsolved in 29474 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 73/73 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 3 (OVERLAPS) 342/415 variables, 73/91 constraints. Problems are: Problem set: 42 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 78/169 constraints. Problems are: Problem set: 42 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 320/489 constraints. Problems are: Problem set: 42 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/489 constraints. Problems are: Problem set: 42 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 1/416 variables, 1/490 constraints. Problems are: Problem set: 42 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 490 constraints, problems are : Problem set: 42 solved, 320 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 73/73 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 320/362 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59672ms problems are : Problem set: 42 solved, 320 unsolved
Search for dead transitions found 42 dead transitions in 59674ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 73/212 places, 325/475 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 335
Applied a total of 2 rules in 21 ms. Remains 72 /73 variables (removed 1) and now considering 335/325 (removed -10) transitions.
[2026-05-25 09:32:09] [INFO ] Flow matrix only has 311 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9090611953061446062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11888375743440104890.kers'
[2026-05-25 09:32:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9090611953061446062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11888375743440104890.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 72 cols 1404 entries
Finished phase 1 with 64 SingleSign rule and 1 generalized
[2026-05-25 09:32:09] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11888375743440104890.kers
Total runtime 4 ms.
[2026-05-25 09:32:09] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-25 09:32:09] [INFO ] Flow matrix only has 311 transitions (discarded 24 similar events)
[2026-05-25 09:32:09] [INFO ] Invariant cache hit.
[2026-05-25 09:32:09] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:32:09] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/212 places, 335/475 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60644 ms. Remains : 72/212 places, 335/475 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-18-LTLCardinality-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLCardinality-14 finished in 60873 ms.
All properties solved by simple procedures.
Total runtime 509363 ms.

BK_STOP 1779701530006

--------------------
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-18"
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-18, 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-177969020000235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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