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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.3K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 130K 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-20-LTLCardinality-00
FORMULA_NAME MedleyA-PT-20-LTLCardinality-01
FORMULA_NAME MedleyA-PT-20-LTLCardinality-02
FORMULA_NAME MedleyA-PT-20-LTLCardinality-03
FORMULA_NAME MedleyA-PT-20-LTLCardinality-04
FORMULA_NAME MedleyA-PT-20-LTLCardinality-05
FORMULA_NAME MedleyA-PT-20-LTLCardinality-06
FORMULA_NAME MedleyA-PT-20-LTLCardinality-07
FORMULA_NAME MedleyA-PT-20-LTLCardinality-08
FORMULA_NAME MedleyA-PT-20-LTLCardinality-09
FORMULA_NAME MedleyA-PT-20-LTLCardinality-10
FORMULA_NAME MedleyA-PT-20-LTLCardinality-11
FORMULA_NAME MedleyA-PT-20-LTLCardinality-12
FORMULA_NAME MedleyA-PT-20-LTLCardinality-13
FORMULA_NAME MedleyA-PT-20-LTLCardinality-14
FORMULA_NAME MedleyA-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779701643445

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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 09:34:04] [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:34:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:34:05] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2026-05-25 09:34:05] [INFO ] Transformed 273 places.
[2026-05-25 09:34:05] [INFO ] Transformed 518 transitions.
[2026-05-25 09:34:05] [INFO ] Found NUPN structural information;
[2026-05-25 09:34:05] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-20-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 518/518 transitions.
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 89 place count 184 transition count 429
Iterating global reduction 0 with 89 rules applied. Total rules applied 178 place count 184 transition count 429
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 182 place count 184 transition count 425
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 214 place count 152 transition count 335
Iterating global reduction 1 with 32 rules applied. Total rules applied 246 place count 152 transition count 335
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 250 place count 152 transition count 331
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 257 place count 145 transition count 317
Iterating global reduction 2 with 7 rules applied. Total rules applied 264 place count 145 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 265 place count 145 transition count 316
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 268 place count 142 transition count 307
Iterating global reduction 3 with 3 rules applied. Total rules applied 271 place count 142 transition count 307
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 142 transition count 304
Applied a total of 274 rules in 63 ms. Remains 142 /273 variables (removed 131) and now considering 304/518 (removed 214) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1700920679618154793.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4125278480920688126.kers'
[2026-05-25 09:34:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1700920679618154793.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4125278480920688126.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 304 rows 142 cols 1067 entries
Finished phase 1 with 126 SingleSign rule and 5 generalized
[2026-05-25 09:34:05] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4125278480920688126.kers
Total runtime 4 ms.
[2026-05-25 09:34:05] [INFO ] Implicit Places using invariants in 429 ms returned []
[2026-05-25 09:34:05] [INFO ] Invariant cache hit.
[2026-05-25 09:34:06] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2026-05-25 09:34:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 304/446 variables, 142/183 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 303 unsolved
SMT process timed out in 30271ms, After SMT, problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 30292ms
Starting structural reductions in LTL mode, iteration 1 : 142/273 places, 304/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31199 ms. Remains : 142/273 places, 304/518 transitions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 304/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2026-05-25 09:34:36] [INFO ] Invariant cache hit.
[2026-05-25 09:34:36] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-25 09:34:36] [INFO ] Invariant cache hit.
[2026-05-25 09:34:36] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 142/142 places, 304/304 transitions.
Support contains 30 out of 142 places after structural reductions.
[2026-05-25 09:34:37] [INFO ] Flatten gal took : 58 ms
[2026-05-25 09:34:37] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:34:37] [INFO ] Input system was already deterministic with 304 transitions.
RANDOM walk for 40000 steps (35 resets) in 746 ms. (53 steps per ms) remains 1/20 properties
BEST_FIRST walk for 40003 steps (43 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
[2026-05-25 09:34:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 85/131 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/142 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 304/446 variables, 142/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/446 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 85/131 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/142 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 304/446 variables, 142/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/446 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 35 ms.
FORMULA MedleyA-PT-20-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 17 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(X(p1)))||p0))))'
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 304/304 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 126 transition count 278
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 126 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 126 transition count 276
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 119 transition count 257
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 119 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 119 transition count 255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 118 transition count 253
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 118 transition count 253
Applied a total of 52 rules in 18 ms. Remains 118 /142 variables (removed 24) and now considering 253/304 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14032735024427363614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8479269728165516401.kers'
[2026-05-25 09:34:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14032735024427363614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8479269728165516401.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 253 rows 118 cols 875 entries
Finished phase 1 with 102 SingleSign rule and 5 generalized
[2026-05-25 09:34:38] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8479269728165516401.kers
Total runtime 2 ms.
[2026-05-25 09:34:38] [INFO ] Implicit Places using invariants in 152 ms returned []
[2026-05-25 09:34:38] [INFO ] Invariant cache hit.
[2026-05-25 09:34:38] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-25 09:34:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 253/371 variables, 118/143 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 146 constraints, problems are : Problem set: 0 solved, 252 unsolved in 22166 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 253/371 variables, 118/143 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 252/395 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 8/403 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 411 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 52259ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 52261ms
Starting structural reductions in LTL mode, iteration 1 : 118/142 places, 253/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52564 ms. Remains : 118/142 places, 253/304 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((X(X(X(p1)))||p0))))'
Stuttering acceptance computed with spot in 388 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Computed a total of 10 stabilizing places and 15 stable transitions
Computed a total of 10 stabilizing places and 15 stable transitions
Knowledge based reduction with 3 factoid took 79 ms. Proved property starting from automaton with 5 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 86 ms.
FORMULA MedleyA-PT-20-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-20-LTLCardinality-00 finished in 53483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(X((F(p1)&&F(p2))))))))))'
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 304/304 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 127 transition count 277
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 127 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 127 transition count 275
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 121 transition count 259
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 121 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 121 transition count 257
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 120 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 120 transition count 255
Applied a total of 48 rules in 9 ms. Remains 120 /142 variables (removed 22) and now considering 255/304 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10422098298697357481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13676830668298920311.kers'
[2026-05-25 09:35:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10422098298697357481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13676830668298920311.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 255 rows 120 cols 879 entries
Finished phase 1 with 104 SingleSign rule and 5 generalized
[2026-05-25 09:35:31] [INFO ] Computed 11 invariants in 6 ms
Computed 11 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-13676830668298920311.kers
Total runtime 7 ms.
[2026-05-25 09:35:31] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 09:35:31] [INFO ] Invariant cache hit.
[2026-05-25 09:35:31] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2026-05-25 09:35:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 255/375 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 11 (OVERLAPS) 0/375 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 151 constraints, problems are : Problem set: 0 solved, 254 unsolved in 26512 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 255/375 variables, 120/158 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 254/412 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 7/422 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 425 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 56575ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 56576ms
Starting structural reductions in LTL mode, iteration 1 : 120/142 places, 255/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56846 ms. Remains : 120/142 places, 255/304 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(X((F(p1)&&F(p2))))))))))'
Stuttering acceptance computed with spot in 486 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-01
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-01 finished in 57451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 304/304 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 126 transition count 278
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 126 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 126 transition count 276
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 120 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 120 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 120 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 119 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 119 transition count 256
Applied a total of 50 rules in 6 ms. Remains 119 /142 variables (removed 23) and now considering 256/304 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11451199041677379941.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6371486633768700970.kers'
[2026-05-25 09:36:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11451199041677379941.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6371486633768700970.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 119 cols 887 entries
Finished phase 1 with 103 SingleSign rule and 5 generalized
[2026-05-25 09:36:29] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6371486633768700970.kers
Total runtime 4 ms.
[2026-05-25 09:36:29] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 09:36:29] [INFO ] Invariant cache hit.
[2026-05-25 09:36:29] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-25 09:36:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 256/375 variables, 119/144 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/375 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 152 constraints, problems are : Problem set: 0 solved, 255 unsolved in 19724 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/375 variables, 119/154 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 255/409 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 419 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 49777ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 49778ms
Starting structural reductions in LTL mode, iteration 1 : 119/142 places, 256/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50025 ms. Remains : 119/142 places, 256/304 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||p1))))'
Stuttering acceptance computed with spot in 210 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-02 finished in 50265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 304/304 transitions.
Graph (trivial) has 113 edges and 142 vertex of which 22 / 142 are part of one of the 3 SCC in 6 ms
Free SCC test removed 19 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 270
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 121 transition count 269
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 121 transition count 262
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 114 transition count 262
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 31 place count 101 transition count 239
Iterating global reduction 2 with 13 rules applied. Total rules applied 44 place count 101 transition count 239
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 101 transition count 235
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 100 transition count 234
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 50 place count 100 transition count 231
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 56 place count 97 transition count 231
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 57 place count 96 transition count 228
Iterating global reduction 4 with 1 rules applied. Total rules applied 58 place count 96 transition count 228
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 82 place count 84 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 84 place count 84 transition count 214
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 90 place count 78 transition count 196
Iterating global reduction 5 with 6 rules applied. Total rules applied 96 place count 78 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 100 place count 78 transition count 192
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 112 place count 72 transition count 204
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 114 place count 70 transition count 202
Applied a total of 114 rules in 98 ms. Remains 70 /142 variables (removed 72) and now considering 202/304 (removed 102) transitions.
[2026-05-25 09:37:19] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14898360569987818684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7748955831413488664.kers'
[2026-05-25 09:37:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14898360569987818684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7748955831413488664.kers]
Normalized transition count is 191 out of 192 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 191 rows 69 cols 706 entries
Finished phase 1 with 54 SingleSign rule and 5 generalized
[2026-05-25 09:37:19] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7748955831413488664.kers
Total runtime 1 ms.
[2026-05-25 09:37:19] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 09:37:19] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
[2026-05-25 09:37:19] [INFO ] Invariant cache hit.
[2026-05-25 09:37:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:37:19] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2026-05-25 09:37:19] [INFO ] Redundant transitions in 4 ms returned []
Running 177 sub problems to find dead transitions.
[2026-05-25 09:37:19] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
[2026-05-25 09:37:19] [INFO ] Invariant cache hit.
[2026-05-25 09:37:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 191/261 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/261 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 0/261 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/262 variables, and 85 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10882 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 3/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 191/261 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 177/262 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (OVERLAPS) 0/261 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/262 variables, and 265 constraints, problems are : Problem set: 0 solved, 177 unsolved in 15495 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 26408ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 26408ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/142 places, 202/304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26759 ms. Remains : 70/142 places, 202/304 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||G(p1)))))'
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-05 finished in 26874 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(X(p0)) U p1) U X((p1 U p2))))'
Support contains 5 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 304/304 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 127 transition count 279
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 127 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 127 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 122 transition count 264
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 122 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 122 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 121 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 121 transition count 261
Applied a total of 44 rules in 6 ms. Remains 121 /142 variables (removed 21) and now considering 261/304 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1463042111522602291.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9307243220680002401.kers'
[2026-05-25 09:37:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1463042111522602291.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9307243220680002401.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 121 cols 909 entries
Finished phase 1 with 105 SingleSign rule and 5 generalized
[2026-05-25 09:37:46] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9307243220680002401.kers
Total runtime 1 ms.
[2026-05-25 09:37:46] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-25 09:37:46] [INFO ] Invariant cache hit.
[2026-05-25 09:37:46] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-25 09:37:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/382 variables, 121/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/382 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 154 constraints, problems are : Problem set: 0 solved, 260 unsolved in 22894 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/382 variables, 121/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 260/411 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 6/417 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/382 variables, and 423 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 52970ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 52971ms
Starting structural reductions in LTL mode, iteration 1 : 121/142 places, 261/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53201 ms. Remains : 121/142 places, 261/304 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(X(p0)) U p1) U X((p1 U p2))))'
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p0), (OR (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Computed a total of 10 stabilizing places and 15 stable transitions
Computed a total of 10 stabilizing places and 15 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 21 ms. Proved property starting from automaton with 6 states, 11 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA MedleyA-PT-20-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-20-LTLCardinality-08 finished in 53699 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((p0 U X(p0))))||G(p1))))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 304/304 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 126 transition count 276
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 126 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 126 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 119 transition count 255
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 119 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 119 transition count 253
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 118 transition count 251
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 118 transition count 251
Applied a total of 52 rules in 10 ms. Remains 118 /142 variables (removed 24) and now considering 251/304 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3881462033438360455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12456109716639593796.kers'
[2026-05-25 09:38:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3881462033438360455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12456109716639593796.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 251 rows 118 cols 865 entries
Finished phase 1 with 102 SingleSign rule and 5 generalized
[2026-05-25 09:38:39] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-12456109716639593796.kers
Total runtime 13 ms.
[2026-05-25 09:38:39] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 09:38:39] [INFO ] Invariant cache hit.
[2026-05-25 09:38:40] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2026-05-25 09:38:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 251/369 variables, 118/148 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 11 (OVERLAPS) 0/369 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 152 constraints, problems are : Problem set: 0 solved, 250 unsolved in 23078 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 251/369 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 250/399 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 3/404 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 410 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 53141ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 53142ms
Starting structural reductions in LTL mode, iteration 1 : 118/142 places, 251/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53379 ms. Remains : 118/142 places, 251/304 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0 U X(p0))))||G(p1))))'
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-09
Product exploration explored 100000 steps with 11 reset in 153 ms.
Product exploration explored 100000 steps with 17 reset in 169 ms.
Computed a total of 11 stabilizing places and 16 stable transitions
Computed a total of 11 stabilizing places and 16 stable transitions
Knowledge based reduction with 9 factoid took 75 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (20 resets) in 312 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2079 steps (6 resets) in 7 ms. (259 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 59 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 435 ms.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 251/251 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 251/251 (removed 0) transitions.
[2026-05-25 09:39:34] [INFO ] Invariant cache hit.
[2026-05-25 09:39:34] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-25 09:39:34] [INFO ] Invariant cache hit.
[2026-05-25 09:39:34] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 118/118 places, 251/251 transitions.
Computed a total of 11 stabilizing places and 16 stable transitions
Computed a total of 11 stabilizing places and 16 stable transitions
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 13771 steps (15 resets) in 32 ms. (417 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 331 ms.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 129 ms.
Product exploration explored 100000 steps with 5 reset in 146 ms.
Spot run failed in 135 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14903680768563632527
[2026-05-25 09:39:36] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14903680768563632527
Running compilation step : cd /tmp/ltsmin14903680768563632527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 525 ms.
Running link step : cd /tmp/ltsmin14903680768563632527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 92 ms.
Running LTSmin : cd /tmp/ltsmin14903680768563632527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4406274776289866262.hoa' '--buchi-type=spotba'
LTSmin run took 110 ms.
FORMULA MedleyA-PT-20-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-20-LTLCardinality-09 finished in 56927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(!p0)) U p1)))'
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 304/304 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 127 transition count 277
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 127 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 127 transition count 275
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 122 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 122 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 122 transition count 261
Applied a total of 43 rules in 7 ms. Remains 122 /142 variables (removed 20) and now considering 261/304 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14662956815288033204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10695991404911484302.kers'
[2026-05-25 09:39:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14662956815288033204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10695991404911484302.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 122 cols 909 entries
Finished phase 1 with 106 SingleSign rule and 5 generalized
[2026-05-25 09:39:36] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10695991404911484302.kers
Total runtime 4 ms.
[2026-05-25 09:39:36] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-25 09:39:36] [INFO ] Invariant cache hit.
[2026-05-25 09:39:37] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-25 09:39:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/383 variables, 122/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/383 variables, and 159 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/383 variables, 122/158 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 260/418 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 431 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 122/142 places, 261/304 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60528 ms. Remains : 122/142 places, 261/304 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 p1)))'
Stuttering acceptance computed with spot in 155 ms :[p0, (NOT p1), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Computed a total of 11 stabilizing places and 16 stable transitions
Computed a total of 11 stabilizing places and 16 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 25 ms. Proved property starting from automaton with 5 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA MedleyA-PT-20-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-20-LTLCardinality-10 finished in 60945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 304/304 transitions.
Graph (trivial) has 111 edges and 142 vertex of which 20 / 142 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 275
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 123 transition count 274
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 123 transition count 267
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 116 transition count 267
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 31 place count 103 transition count 246
Iterating global reduction 2 with 13 rules applied. Total rules applied 44 place count 103 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 103 transition count 242
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 102 transition count 241
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 50 place count 102 transition count 238
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 56 place count 99 transition count 238
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 57 place count 98 transition count 235
Iterating global reduction 4 with 1 rules applied. Total rules applied 58 place count 98 transition count 235
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 86 place count 84 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 84 transition count 219
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 95 place count 77 transition count 198
Iterating global reduction 5 with 7 rules applied. Total rules applied 102 place count 77 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 106 place count 77 transition count 194
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 116 place count 72 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 117 place count 72 transition count 202
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 118 place count 72 transition count 202
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 119 place count 72 transition count 201
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 121 place count 70 transition count 199
Applied a total of 121 rules in 76 ms. Remains 70 /142 variables (removed 72) and now considering 199/304 (removed 105) transitions.
[2026-05-25 09:40:37] [INFO ] Flow matrix only has 189 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17257148021349359627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1253588202635203610.kers'
[2026-05-25 09:40:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17257148021349359627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1253588202635203610.kers]
Normalized transition count is 188 out of 189 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 188 rows 69 cols 698 entries
Finished phase 1 with 54 SingleSign rule and 5 generalized
[2026-05-25 09:40:37] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1253588202635203610.kers
Total runtime 1 ms.
[2026-05-25 09:40:37] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 09:40:37] [INFO ] Flow matrix only has 189 transitions (discarded 10 similar events)
[2026-05-25 09:40:37] [INFO ] Invariant cache hit.
[2026-05-25 09:40:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:40:37] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2026-05-25 09:40:37] [INFO ] Redundant transitions in 10 ms returned []
Running 173 sub problems to find dead transitions.
[2026-05-25 09:40:37] [INFO ] Flow matrix only has 189 transitions (discarded 10 similar events)
[2026-05-25 09:40:37] [INFO ] Invariant cache hit.
[2026-05-25 09:40:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 188/258 variables, 70/82 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/259 variables, and 85 constraints, problems are : Problem set: 0 solved, 173 unsolved in 10025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 188/258 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 173/257 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 12 (OVERLAPS) 0/258 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/259 variables, and 260 constraints, problems are : Problem set: 0 solved, 173 unsolved in 14003 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 24070ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 24071ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/142 places, 199/304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24306 ms. Remains : 70/142 places, 199/304 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-13
Stuttering criterion allowed to conclude after 102 steps with 9 reset in 2 ms.
FORMULA MedleyA-PT-20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-13 finished in 24419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 304/304 transitions.
Graph (trivial) has 111 edges and 142 vertex of which 21 / 142 are part of one of the 3 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 273
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 122 transition count 272
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 122 transition count 265
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 115 transition count 265
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 31 place count 102 transition count 244
Iterating global reduction 2 with 13 rules applied. Total rules applied 44 place count 102 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 47 place count 102 transition count 241
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 49 place count 101 transition count 240
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 49 place count 101 transition count 237
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 55 place count 98 transition count 237
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 56 place count 97 transition count 234
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 97 transition count 234
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 85 place count 83 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 87 place count 83 transition count 218
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 94 place count 76 transition count 197
Iterating global reduction 5 with 7 rules applied. Total rules applied 101 place count 76 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 105 place count 76 transition count 193
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 117 place count 70 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 118 place count 70 transition count 204
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 120 place count 68 transition count 202
Applied a total of 120 rules in 57 ms. Remains 68 /142 variables (removed 74) and now considering 202/304 (removed 102) transitions.
[2026-05-25 09:41:02] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15675424941510989501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6199874003060442812.kers'
[2026-05-25 09:41:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15675424941510989501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6199874003060442812.kers]
Normalized transition count is 191 out of 192 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 191 rows 67 cols 716 entries
Finished phase 1 with 52 SingleSign rule and 5 generalized
[2026-05-25 09:41:02] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6199874003060442812.kers
Total runtime 1 ms.
[2026-05-25 09:41:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 09:41:02] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
[2026-05-25 09:41:02] [INFO ] Invariant cache hit.
[2026-05-25 09:41:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:41:02] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2026-05-25 09:41:02] [INFO ] Redundant transitions in 2 ms returned []
Running 175 sub problems to find dead transitions.
[2026-05-25 09:41:02] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
[2026-05-25 09:41:02] [INFO ] Invariant cache hit.
[2026-05-25 09:41:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 3/68 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 191/259 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/259 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/260 variables, and 83 constraints, problems are : Problem set: 0 solved, 175 unsolved in 8773 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 3/68 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 191/259 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 175/258 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/259 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/260 variables, and 261 constraints, problems are : Problem set: 0 solved, 175 unsolved in 17706 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 26501ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 26501ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/142 places, 202/304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26754 ms. Remains : 68/142 places, 202/304 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-14
Product exploration explored 100000 steps with 6 reset in 128 ms.
Product exploration explored 100000 steps with 1 reset in 112 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 125 steps (7 resets) in 6 ms. (17 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 398 ms.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 202/202 transitions.
Applied a total of 0 rules in 10 ms. Remains 68 /68 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-25 09:41:29] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
[2026-05-25 09:41:29] [INFO ] Invariant cache hit.
[2026-05-25 09:41:29] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 09:41:29] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
[2026-05-25 09:41:29] [INFO ] Invariant cache hit.
[2026-05-25 09:41:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:41:29] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2026-05-25 09:41:29] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 68/68 places, 202/202 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 10023 steps (7 resets) in 25 ms. (385 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 254 ms.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-14 finished in 28241 ms.
All properties solved by simple procedures.
Total runtime 445507 ms.

BK_STOP 1779702090411

--------------------
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'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ sed s/.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-20"
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-20, 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-177969020000251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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