Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074400731.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 HirschbergSinclair-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400731
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 9.7K Mar 7 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 7 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 7 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Mar 15 10:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 10:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 7 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Mar 7 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:48 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 157K 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 HirschbergSinclair-PT-05-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779749703735

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 22:55: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 22:55:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 22:55:05] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2026-05-25 22:55:05] [INFO ] Transformed 124 places.
[2026-05-25 22:55:05] [INFO ] Transformed 111 transitions.
[2026-05-25 22:55:05] [INFO ] Parsed PT model containing 124 places and 111 transitions and 340 arcs in 157 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 3 formulas.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 118 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 118 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 117 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 117 transition count 108
Applied a total of 10 rules in 44 ms. Remains 117 /124 variables (removed 7) and now considering 108/111 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17010828488596080357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5937698992984984797.kers'
[2026-05-25 22:55:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17010828488596080357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5937698992984984797.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 108 rows 117 cols 326 entries
Finished phase 1 with 105 SingleSign rule and 3 generalized
[2026-05-25 22:55:05] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5937698992984984797.kers
Total runtime 2 ms.
[2026-05-25 22:55:05] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-25 22:55:05] [INFO ] Invariant cache hit.
[2026-05-25 22:55:05] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2026-05-25 22:55:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 2/113 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 4/117 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 108/225 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 126 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4801 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 2/113 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 4/117 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 108/225 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 103/229 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 229 constraints, problems are : Problem set: 0 solved, 103 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34871ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 34885ms
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 108/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35457 ms. Remains : 117/124 places, 108/111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2026-05-25 22:55:40] [INFO ] Invariant cache hit.
[2026-05-25 22:55:40] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 22:55:40] [INFO ] Invariant cache hit.
[2026-05-25 22:55:40] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 117/117 places, 108/108 transitions.
Support contains 39 out of 117 places after structural reductions.
[2026-05-25 22:55:41] [INFO ] Flatten gal took : 56 ms
[2026-05-25 22:55:41] [INFO ] Flatten gal took : 11 ms
[2026-05-25 22:55:41] [INFO ] Input system was already deterministic with 108 transitions.
RANDOM walk for 40000 steps (358 resets) in 883 ms. (45 steps per ms) remains 8/29 properties
BEST_FIRST walk for 40003 steps (103 resets) in 301 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (107 resets) in 270 ms. (147 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (84 resets) in 201 ms. (198 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (104 resets) in 228 ms. (174 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (104 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (89 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (100 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (108 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
[2026-05-25 22:55:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 5/12 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 95/107 variables, 7/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3/110 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Real declared 218/225 variables, and 119 constraints, problems are : Problem set: 8 solved, 0 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/117 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 117 stabilizing places and 108 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 117 transition count 108
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-05-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 111 transition count 64
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 72 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 70 transition count 62
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 86 place count 67 transition count 59
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 67 transition count 59
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 3 with 1 rules applied. Total rules applied 90 place count 67 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 66 transition count 58
Applied a total of 91 rules in 22 ms. Remains 66 /117 variables (removed 51) and now considering 58/108 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15924360328277109739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16694778468689059826.kers'
[2026-05-25 22:55:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15924360328277109739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16694778468689059826.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 58 rows 66 cols 132 entries
Finished phase 1 with 55 SingleSign rule and 3 generalized
[2026-05-25 22:55:42] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16694778468689059826.kers
Total runtime 0 ms.
[2026-05-25 22:55:42] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 22:55:42] [INFO ] Invariant cache hit.
[2026-05-25 22:55:42] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2026-05-25 22:55:42] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2026-05-25 22:55:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 2/59 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 52/111 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 3/114 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/124 variables, and 69 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1418 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 61/66 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 2/59 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 52/111 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 40/107 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 3/114 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 9/118 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/114 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/124 variables, and 118 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2740 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 61/66 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4162ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 4162ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/117 places, 58/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4360 ms. Remains : 66/117 places, 58/108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-01
Product exploration explored 100000 steps with 1626 reset in 219 ms.
Product exploration explored 100000 steps with 1629 reset in 147 ms.
Computed a total of 66 stabilizing places and 58 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 58
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 17 ms. Proved property starting from automaton with 3 states, 6 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 53 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-01 finished in 5085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p0))&&(p1||G(p2)))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 109 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 109 transition count 101
Applied a total of 15 rules in 19 ms. Remains 109 /117 variables (removed 8) and now considering 101/108 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9924249908516292550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10125459326296018623.kers'
[2026-05-25 22:55:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9924249908516292550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10125459326296018623.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 101 rows 109 cols 306 entries
Finished phase 1 with 98 SingleSign rule and 3 generalized
[2026-05-25 22:55:47] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10125459326296018623.kers
Total runtime 3 ms.
[2026-05-25 22:55:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 22:55:47] [INFO ] Invariant cache hit.
[2026-05-25 22:55:47] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-25 22:55:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3708 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 27394 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31135ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 31137ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31396 ms. Remains : 109/117 places, 101/108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p0))&&(p1||G(p2)))))'
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-03 finished in 31692 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 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 112 transition count 59
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 68 transition count 59
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 66 transition count 57
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 66 transition count 57
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 1 rules applied. Total rules applied 93 place count 66 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 65 transition count 56
Applied a total of 94 rules in 14 ms. Remains 65 /117 variables (removed 52) and now considering 56/108 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4975608334406592098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2477559999834800611.kers'
[2026-05-25 22:56:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4975608334406592098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2477559999834800611.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 56 rows 65 cols 121 entries
Finished phase 1 with 53 SingleSign rule and 3 generalized
[2026-05-25 22:56:19] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2477559999834800611.kers
Total runtime 0 ms.
[2026-05-25 22:56:19] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 22:56:19] [INFO ] Invariant cache hit.
[2026-05-25 22:56:19] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2026-05-25 22:56:19] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2026-05-25 22:56:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/57 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 2/59 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 52/111 variables, 59/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 2/113 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/121 variables, and 70 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1422 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 61/65 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/57 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 2/59 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 52/111 variables, 59/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 47/115 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 2/113 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/121 variables, and 117 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1968 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 61/65 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3409ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 3410ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/117 places, 56/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3582 ms. Remains : 65/117 places, 56/108 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 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-09
Stuttering criterion allowed to conclude after 69 steps with 2 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-09 finished in 3682 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 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 111 transition count 58
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 66 transition count 58
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 62 transition count 54
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 62 transition count 54
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 1 rules applied. Total rules applied 100 place count 62 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 61 transition count 53
Applied a total of 101 rules in 11 ms. Remains 61 /117 variables (removed 56) and now considering 53/108 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8010586450657516105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17109036255995917706.kers'
[2026-05-25 22:56:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8010586450657516105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17109036255995917706.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 53 rows 61 cols 114 entries
Finished phase 1 with 50 SingleSign rule and 3 generalized
[2026-05-25 22:56:23] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17109036255995917706.kers
Total runtime 0 ms.
[2026-05-25 22:56:23] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 22:56:23] [INFO ] Invariant cache hit.
[2026-05-25 22:56:23] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2026-05-25 22:56:23] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2026-05-25 22:56:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 46/100 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/114 variables, and 62 constraints, problems are : Problem set: 0 solved, 44 unsolved in 870 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 54/61 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 46/100 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 44/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/114 variables, and 106 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1337 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 54/61 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2241ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2242ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/117 places, 53/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2433 ms. Remains : 61/117 places, 53/108 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 34 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-10
Product exploration explored 100000 steps with 1722 reset in 82 ms.
Product exploration explored 100000 steps with 1722 reset in 98 ms.
Computed a total of 61 stabilizing places and 53 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 53
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 10 ms. Proved property starting from automaton with 1 states, 2 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 44 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-10 finished in 2721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U G(p1))&&F(p2)) U (p1 U X(p1))))'
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 113 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 113 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 111 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 111 transition count 103
Applied a total of 11 rules in 9 ms. Remains 111 /117 variables (removed 6) and now considering 103/108 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3993970008991247945.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4779348604698324598.kers'
[2026-05-25 22:56:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3993970008991247945.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4779348604698324598.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 103 rows 111 cols 311 entries
Finished phase 1 with 100 SingleSign rule and 3 generalized
[2026-05-25 22:56:25] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4779348604698324598.kers
Total runtime 0 ms.
[2026-05-25 22:56:25] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 22:56:25] [INFO ] Invariant cache hit.
[2026-05-25 22:56:26] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2026-05-25 22:56:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 103/214 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/214 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 119 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3691 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 103/214 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 98/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 217 constraints, problems are : Problem set: 0 solved, 98 unsolved in 26780 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30494ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 30496ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 103/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30725 ms. Remains : 111/117 places, 103/108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U G(p1))&&F(p2)) U (p1 U X(p1))))'
Stuttering acceptance computed with spot in 439 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Computed a total of 111 stabilizing places and 103 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 111 transition count 103
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 20 factoid took 11 ms. Proved property starting from automaton with 10 states, 22 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 61 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-12 finished in 31506 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)&&G(p1))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 112 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 110 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 110 transition count 102
Applied a total of 13 rules in 11 ms. Remains 110 /117 variables (removed 7) and now considering 102/108 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4417048218347626884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-816308167567517802.kers'
[2026-05-25 22:56:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4417048218347626884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-816308167567517802.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 110 cols 309 entries
Finished phase 1 with 99 SingleSign rule and 3 generalized
[2026-05-25 22:56:57] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-816308167567517802.kers
Total runtime 2 ms.
[2026-05-25 22:56:57] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 22:56:57] [INFO ] Invariant cache hit.
[2026-05-25 22:56:57] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2026-05-25 22:56:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 118 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3611 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 97/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 215 constraints, problems are : Problem set: 0 solved, 97 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33642ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 33643ms
Starting structural reductions in LTL mode, iteration 1 : 110/117 places, 102/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33887 ms. Remains : 110/117 places, 102/108 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)&&G(p1))))'
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-13
Product exploration explored 100000 steps with 900 reset in 109 ms.
Product exploration explored 100000 steps with 901 reset in 120 ms.
Computed a total of 110 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 5 factoid took 244 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 309 steps (0 resets) in 6 ms. (44 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2026-05-25 22:57:32] [INFO ] Invariant cache hit.
[2026-05-25 22:57:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 22:57:32] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2026-05-25 22:57:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 22:57:32] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-25 22:57:32] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 22:57:32] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 7 ms.
[2026-05-25 22:57:32] [INFO ] Added : 28 causal constraints over 6 iterations in 87 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1216 ms.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2026-05-25 22:57:32] [INFO ] Invariant cache hit.
[2026-05-25 22:57:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 22:57:33] [INFO ] Invariant cache hit.
[2026-05-25 22:57:33] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 110/110 places, 102/102 transitions.
Computed a total of 110 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 301 steps (0 resets) in 7 ms. (37 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 317 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2026-05-25 22:57:33] [INFO ] Invariant cache hit.
[2026-05-25 22:57:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 22:57:34] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2026-05-25 22:57:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 22:57:34] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 22:57:34] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-25 22:57:34] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 7 ms.
[2026-05-25 22:57:34] [INFO ] Added : 28 causal constraints over 6 iterations in 78 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1168 ms.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 901 reset in 114 ms.
Product exploration explored 100000 steps with 900 reset in 118 ms.
Spot run failed in 76 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/ltsmin7074899140269903276
[2026-05-25 22:57:34] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7074899140269903276
Running compilation step : cd /tmp/ltsmin7074899140269903276;'/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 684 ms.
Running link step : cd /tmp/ltsmin7074899140269903276;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7074899140269903276;'/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/stateBased6523837358858931262.hoa' '--buchi-type=spotba'
LTSmin run took 385 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-13 finished in 38773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 109 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 109 transition count 101
Applied a total of 15 rules in 10 ms. Remains 109 /117 variables (removed 8) and now considering 101/108 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14053457314228301892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13905485944514019370.kers'
[2026-05-25 22:57:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14053457314228301892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13905485944514019370.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 101 rows 109 cols 306 entries
Finished phase 1 with 98 SingleSign rule and 3 generalized
[2026-05-25 22:57:36] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13905485944514019370.kers
Total runtime 1 ms.
[2026-05-25 22:57:36] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 22:57:36] [INFO ] Invariant cache hit.
[2026-05-25 22:57:36] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-25 22:57:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3494 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 26937 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30468ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 30470ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30715 ms. Remains : 109/117 places, 101/108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-14 finished in 30882 ms.
All properties solved by simple procedures.
Total runtime 182110 ms.

BK_STOP 1779749887353

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HirschbergSinclair-PT-05"
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 HirschbergSinclair-PT-05, 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 r146-tall-177961074400731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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