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-177961074400739.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-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400739
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.7K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Mar 15 10:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 10:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 10:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:49 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 136K 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-10-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779749927897

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 22:58:49] [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:58:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 22:58:49] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2026-05-25 22:58:49] [INFO ] Transformed 260 places.
[2026-05-25 22:58:49] [INFO ] Transformed 236 transitions.
[2026-05-25 22:58:49] [INFO ] Parsed PT model containing 260 places and 236 transitions and 721 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 236/236 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 252 transition count 236
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 246 transition count 230
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 246 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 243 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 243 transition count 227
Applied a total of 26 rules in 59 ms. Remains 243 /260 variables (removed 17) and now considering 227/236 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16030485653166593728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3610630424915816669.kers'
[2026-05-25 22:58:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16030485653166593728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3610630424915816669.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 227 rows 243 cols 691 entries
Finished phase 1 with 214 SingleSign rule and 13 generalized
[2026-05-25 22:58:49] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3610630424915816669.kers
Total runtime 1 ms.
[2026-05-25 22:58:49] [INFO ] Implicit Places using invariants in 367 ms returned []
[2026-05-25 22:58:49] [INFO ] Invariant cache hit.
[2026-05-25 22:58:51] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1739 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-25 22:58:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 11/242 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 1/243 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 227/470 variables, 243/264 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 13 (OVERLAPS) 0/470 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 264 constraints, problems are : Problem set: 0 solved, 217 unsolved in 24590 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 11/242 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 1/243 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 227/470 variables, 243/266 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 217/483 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 485 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54689ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 54705ms
Starting structural reductions in LTL mode, iteration 1 : 243/260 places, 227/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56552 ms. Remains : 243/260 places, 227/236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 227/227 transitions.
Applied a total of 0 rules in 11 ms. Remains 243 /243 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-25 22:59:45] [INFO ] Invariant cache hit.
[2026-05-25 22:59:46] [INFO ] Implicit Places using invariants in 272 ms returned []
[2026-05-25 22:59:46] [INFO ] Invariant cache hit.
[2026-05-25 22:59:47] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1627 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1638 ms. Remains : 243/243 places, 227/227 transitions.
Support contains 50 out of 243 places after structural reductions.
[2026-05-25 22:59:47] [INFO ] Flatten gal took : 71 ms
[2026-05-25 22:59:47] [INFO ] Flatten gal took : 24 ms
[2026-05-25 22:59:47] [INFO ] Input system was already deterministic with 227 transitions.
RANDOM walk for 40000 steps (168 resets) in 1668 ms. (23 steps per ms) remains 9/32 properties
BEST_FIRST walk for 40004 steps (36 resets) in 187 ms. (212 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (34 resets) in 207 ms. (192 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (36 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (35 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (29 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (36 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (36 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (28 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (33 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
[2026-05-25 22:59:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 108/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 3 (OVERLAPS) 105/223 variables, 14/16 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 2/18 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 6 (OVERLAPS) 227/450 variables, 223/241 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/241 constraints. Problems are: Problem set: 7 solved, 2 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 8 (OVERLAPS) 20/470 variables, 20/261 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/261 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/470 variables, 0/261 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 261 constraints, problems are : Problem set: 8 solved, 1 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 109/111 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 110/221 variables, 14/16 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 2/18 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 227/448 variables, 221/239 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 1/240 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/240 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/470 variables, 22/262 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/262 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/470 variables, 0/262 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 262 constraints, problems are : Problem set: 8 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 715ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 227/227 transitions.
Graph (complete) has 473 edges and 243 vertex of which 232 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 232 transition count 122
Reduce places removed 95 places and 0 transitions.
Graph (complete) has 236 edges and 137 vertex of which 73 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.0 ms
Discarding 64 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 96 rules applied. Total rules applied 202 place count 73 transition count 121
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 2 with 62 rules applied. Total rules applied 264 place count 73 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 264 place count 73 transition count 58
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 266 place count 72 transition count 58
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 269 place count 69 transition count 55
Iterating global reduction 3 with 3 rules applied. Total rules applied 272 place count 69 transition count 55
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 275 place count 69 transition count 52
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 101 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Iterating post reduction 4 with 4 rules applied. Total rules applied 279 place count 58 transition count 50
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 284 place count 58 transition count 45
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 285 place count 58 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 286 place count 57 transition count 44
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 295 place count 48 transition count 35
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 7 with 24 rules applied. Total rules applied 319 place count 40 transition count 19
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 335 place count 24 transition count 19
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 335 place count 24 transition count 8
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 23 rules applied. Total rules applied 358 place count 12 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 359 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 359 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 361 place count 10 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 363 place count 9 transition count 6
Applied a total of 363 rules in 39 ms. Remains 9 /243 variables (removed 234) and now considering 6/227 (removed 221) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 9/243 places, 6/227 transitions.
RANDOM walk for 632 steps (88 resets) in 9 ms. (63 steps per ms) remains 0/1 properties
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 243 stabilizing places and 227 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 227
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-10-LTLCardinality-13 FALSE 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' '!(X(F((G(p0)||(p1&&X(!p1))))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 241 transition count 227
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 235 transition count 221
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 235 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 232 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 232 transition count 218
Applied a total of 20 rules in 19 ms. Remains 232 /243 variables (removed 11) and now considering 218/227 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14178299859174371711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14363117052916331908.kers'
[2026-05-25 22:59:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14178299859174371711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14363117052916331908.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 232 cols 658 entries
Finished phase 1 with 214 SingleSign rule and 4 generalized
[2026-05-25 22:59:50] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14363117052916331908.kers
Total runtime 1 ms.
[2026-05-25 22:59:50] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 22:59:50] [INFO ] Invariant cache hit.
[2026-05-25 22:59:51] [INFO ] Implicit Places using invariants and state equation in 1077 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2026-05-25 22:59:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17922 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47970ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47973ms
Starting structural reductions in LTL mode, iteration 1 : 232/243 places, 218/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49175 ms. Remains : 232/243 places, 218/227 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)||(p1&&X(!p1))))))'
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-00
Stuttering criterion allowed to conclude after 230 steps with 0 reset in 7 ms.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-00 finished in 49526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X(p1)))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 241 transition count 227
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 234 transition count 220
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 234 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 231 transition count 217
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 231 transition count 217
Applied a total of 22 rules in 20 ms. Remains 231 /243 variables (removed 12) and now considering 217/227 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16229474856087939664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12678453027783298218.kers'
[2026-05-25 23:00:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16229474856087939664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12678453027783298218.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 231 cols 655 entries
Finished phase 1 with 213 SingleSign rule and 4 generalized
[2026-05-25 23:00:39] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12678453027783298218.kers
Total runtime 1 ms.
[2026-05-25 23:00:39] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 23:00:39] [INFO ] Invariant cache hit.
[2026-05-25 23:00:40] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2026-05-25 23:00:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 10/231 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 217/448 variables, 231/245 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 0/448 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 245 constraints, problems are : Problem set: 0 solved, 207 unsolved in 17846 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 10/231 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 217/448 variables, 231/245 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 207/452 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/448 variables, and 452 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47912ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 47912ms
Starting structural reductions in LTL mode, iteration 1 : 231/243 places, 217/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49074 ms. Remains : 231/243 places, 217/227 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X(p1)))))'
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-02
Product exploration explored 100000 steps with 1098 reset in 263 ms.
Product exploration explored 100000 steps with 1098 reset in 239 ms.
Computed a total of 231 stabilizing places and 217 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 231 transition count 217
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 7 factoid took 70 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 774 steps (0 resets) in 41 ms. (18 steps per ms) remains 0/3 properties
Knowledge based reduction with 7 factoid took 128 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2026-05-25 23:01:30] [INFO ] Invariant cache hit.
[2026-05-25 23:01:30] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 15 ms returned sat
[2026-05-25 23:01:31] [INFO ] [Real]Absence check using state equation in 1247 ms returned sat
[2026-05-25 23:01:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 23:01:31] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 12 ms returned sat
[2026-05-25 23:01:36] [INFO ] [Nat]Absence check using state equation in 4635 ms returned sat
[2026-05-25 23:01:36] [INFO ] Computed and/alt/rep : 100/105/100 causal constraints (skipped 107 transitions) in 15 ms.
[2026-05-25 23:01:39] [INFO ] Added : 89 causal constraints over 18 iterations in 3264 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 10030 ms.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 217/217 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2026-05-25 23:01:39] [INFO ] Invariant cache hit.
[2026-05-25 23:01:39] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-25 23:01:39] [INFO ] Invariant cache hit.
[2026-05-25 23:01:40] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1198 ms. Remains : 231/231 places, 217/217 transitions.
Computed a total of 231 stabilizing places and 217 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 231 transition count 217
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 7 factoid took 59 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 769 steps (0 resets) in 5 ms. (128 steps per ms) remains 0/3 properties
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2026-05-25 23:01:41] [INFO ] Invariant cache hit.
[2026-05-25 23:01:41] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 15 ms returned sat
[2026-05-25 23:01:42] [INFO ] [Real]Absence check using state equation in 1263 ms returned sat
[2026-05-25 23:01:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 23:01:42] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 12 ms returned sat
[2026-05-25 23:01:47] [INFO ] [Nat]Absence check using state equation in 4583 ms returned sat
[2026-05-25 23:01:47] [INFO ] Computed and/alt/rep : 100/105/100 causal constraints (skipped 107 transitions) in 22 ms.
[2026-05-25 23:01:50] [INFO ] Added : 89 causal constraints over 18 iterations in 3205 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 9866 ms.
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1098 reset in 191 ms.
Product exploration explored 100000 steps with 1098 reset in 212 ms.
Spot run failed in 86 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/ltsmin16661369540878009852
[2026-05-25 23:01:51] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16661369540878009852
Running compilation step : cd /tmp/ltsmin16661369540878009852;'/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 488 ms.
Running link step : cd /tmp/ltsmin16661369540878009852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16661369540878009852;'/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/stateBased17493118520721533193.hoa' '--buchi-type=spotba'
LTSmin run took 59 ms.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-02 finished in 72895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 241 transition count 227
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 235 transition count 221
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 235 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 232 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 232 transition count 218
Applied a total of 20 rules in 11 ms. Remains 232 /243 variables (removed 11) and now considering 218/227 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13849284625297455529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16086578777867770094.kers'
[2026-05-25 23:01:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13849284625297455529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16086578777867770094.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 232 cols 657 entries
Finished phase 1 with 214 SingleSign rule and 4 generalized
[2026-05-25 23:01:52] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16086578777867770094.kers
Total runtime 1 ms.
[2026-05-25 23:01:52] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 23:01:52] [INFO ] Invariant cache hit.
[2026-05-25 23:01:53] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2026-05-25 23:01:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17937 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47993ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47994ms
Starting structural reductions in LTL mode, iteration 1 : 232/243 places, 218/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49208 ms. Remains : 232/243 places, 218/227 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 165 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-06 finished in 49397 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 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 227/227 transitions.
Graph (complete) has 473 edges and 243 vertex of which 241 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 10 places and 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 231 transition count 121
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 135 transition count 121
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 200 place count 128 transition count 114
Iterating global reduction 2 with 7 rules applied. Total rules applied 207 place count 128 transition count 114
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 210 place count 128 transition count 111
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 213 place count 125 transition count 111
Applied a total of 213 rules in 26 ms. Remains 125 /243 variables (removed 118) and now considering 111/227 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12191138688382052181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12266307903762473041.kers'
[2026-05-25 23:02:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12191138688382052181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12266307903762473041.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 125 cols 232 entries
Finished phase 1 with 107 SingleSign rule and 4 generalized
[2026-05-25 23:02:41] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12266307903762473041.kers
Total runtime 0 ms.
[2026-05-25 23:02:41] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 23:02:41] [INFO ] Invariant cache hit.
[2026-05-25 23:02:42] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2026-05-25 23:02:42] [INFO ] Redundant transitions in 1 ms returned []
Running 92 sub problems to find dead transitions.
[2026-05-25 23:02:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/202 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/202 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/236 variables, and 122 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3312 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 108/125 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/202 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 92/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/236 variables, and 214 constraints, problems are : Problem set: 0 solved, 92 unsolved in 6968 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 108/125 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10285ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 10292ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/243 places, 111/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10714 ms. Remains : 125/243 places, 111/227 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 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-07
Product exploration explored 100000 steps with 1141 reset in 147 ms.
Product exploration explored 100000 steps with 1140 reset in 172 ms.
Computed a total of 125 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 125 transition count 111
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 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 81 ms.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-07 finished in 11235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(!p1))))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 241 transition count 227
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 234 transition count 220
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 234 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 230 transition count 216
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 230 transition count 216
Applied a total of 24 rules in 13 ms. Remains 230 /243 variables (removed 13) and now considering 216/227 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13561876791401697699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15993227642988995671.kers'
[2026-05-25 23:02:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13561876791401697699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15993227642988995671.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 230 cols 652 entries
Finished phase 1 with 212 SingleSign rule and 4 generalized
[2026-05-25 23:02:53] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15993227642988995671.kers
Total runtime 1 ms.
[2026-05-25 23:02:53] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-25 23:02:53] [INFO ] Invariant cache hit.
[2026-05-25 23:02:54] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2026-05-25 23:02:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 244 constraints, problems are : Problem set: 0 solved, 206 unsolved in 17074 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 206/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47109ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 47113ms
Starting structural reductions in LTL mode, iteration 1 : 230/243 places, 216/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48304 ms. Remains : 230/243 places, 216/227 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-08
Product exploration explored 100000 steps with 523 reset in 222 ms.
Product exploration explored 100000 steps with 523 reset in 274 ms.
Computed a total of 230 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 230 transition count 216
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 7 factoid took 49 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 755 steps (0 resets) in 14 ms. (50 steps per ms) remains 0/4 properties
Knowledge based reduction with 7 factoid took 87 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2026-05-25 23:03:42] [INFO ] Invariant cache hit.
[2026-05-25 23:03:42] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 23 ms returned sat
[2026-05-25 23:03:44] [INFO ] [Real]Absence check using state equation in 2130 ms returned sat
[2026-05-25 23:03:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 23:03:44] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 38 ms returned sat
[2026-05-25 23:03:48] [INFO ] [Nat]Absence check using state equation in 3516 ms returned sat
[2026-05-25 23:03:48] [INFO ] Computed and/alt/rep : 100/104/100 causal constraints (skipped 106 transitions) in 10 ms.
[2026-05-25 23:03:53] [INFO ] Added : 90 causal constraints over 18 iterations in 5239 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 11759 ms.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 230 /230 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2026-05-25 23:03:53] [INFO ] Invariant cache hit.
[2026-05-25 23:03:53] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 23:03:53] [INFO ] Invariant cache hit.
[2026-05-25 23:03:55] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1160 ms. Remains : 230/230 places, 216/216 transitions.
Computed a total of 230 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 230 transition count 216
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 7 factoid took 40 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 764 steps (0 resets) in 7 ms. (95 steps per ms) remains 0/4 properties
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2026-05-25 23:03:55] [INFO ] Invariant cache hit.
[2026-05-25 23:03:55] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 23 ms returned sat
[2026-05-25 23:03:57] [INFO ] [Real]Absence check using state equation in 2120 ms returned sat
[2026-05-25 23:03:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 23:03:57] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 25 ms returned sat
[2026-05-25 23:04:01] [INFO ] [Nat]Absence check using state equation in 3519 ms returned sat
[2026-05-25 23:04:01] [INFO ] Computed and/alt/rep : 100/104/100 causal constraints (skipped 106 transitions) in 10 ms.
[2026-05-25 23:04:06] [INFO ] Added : 90 causal constraints over 18 iterations in 5273 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 11534 ms.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 523 reset in 168 ms.
Product exploration explored 100000 steps with 523 reset in 170 ms.
Spot run failed in 45 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/ltsmin14404147165758339648
[2026-05-25 23:04:07] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14404147165758339648
Running compilation step : cd /tmp/ltsmin14404147165758339648;'/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 320 ms.
Running link step : cd /tmp/ltsmin14404147165758339648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14404147165758339648;'/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/stateBased10493404432287437059.hoa' '--buchi-type=spotba'
LTSmin run took 33 ms.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-08 finished in 74525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 227/227 transitions.
Graph (complete) has 473 edges and 243 vertex of which 241 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 9 places and 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 232 transition count 135
Reduce places removed 83 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 149 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 169 place count 148 transition count 134
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 176 place count 141 transition count 127
Iterating global reduction 3 with 7 rules applied. Total rules applied 183 place count 141 transition count 127
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 186 place count 141 transition count 124
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 189 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 137 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 137 transition count 123
Applied a total of 191 rules in 27 ms. Remains 137 /243 variables (removed 106) and now considering 123/227 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17713516162547037216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3617483307220712899.kers'
[2026-05-25 23:04:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17713516162547037216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3617483307220712899.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 137 cols 280 entries
Finished phase 1 with 119 SingleSign rule and 4 generalized
[2026-05-25 23:04:07] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3617483307220712899.kers
Total runtime 1 ms.
[2026-05-25 23:04:07] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 23:04:07] [INFO ] Invariant cache hit.
[2026-05-25 23:04:08] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2026-05-25 23:04:08] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2026-05-25 23:04:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/228 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/228 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/260 variables, and 135 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4690 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 121/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/228 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 106/241 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/260 variables, and 241 constraints, problems are : Problem set: 0 solved, 106 unsolved in 18556 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 121/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23253ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 23254ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/243 places, 123/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23722 ms. Remains : 137/243 places, 123/227 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-10
Product exploration explored 100000 steps with 5378 reset in 180 ms.
Product exploration explored 100000 steps with 5329 reset in 194 ms.
Computed a total of 137 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 137 transition count 123
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 136 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 325 steps (0 resets) in 5 ms. (54 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p0)]
[2026-05-25 23:04:32] [INFO ] Invariant cache hit.
[2026-05-25 23:04:32] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 6 ms returned sat
[2026-05-25 23:04:32] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-25 23:04:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 23:04:32] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-25 23:04:32] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-25 23:04:32] [INFO ] Computed and/alt/rep : 95/99/95 causal constraints (skipped 11 transitions) in 5 ms.
[2026-05-25 23:04:32] [INFO ] Added : 53 causal constraints over 11 iterations in 101 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 878 ms.
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p0)]
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 123/123 transitions.
Applied a total of 0 rules in 11 ms. Remains 137 /137 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2026-05-25 23:04:32] [INFO ] Invariant cache hit.
[2026-05-25 23:04:32] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 23:04:32] [INFO ] Invariant cache hit.
[2026-05-25 23:04:33] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2026-05-25 23:04:33] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 479 ms. Remains : 137/137 places, 123/123 transitions.
Computed a total of 137 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 137 transition count 123
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 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 325 steps (0 resets) in 5 ms. (54 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p0)]
[2026-05-25 23:04:33] [INFO ] Invariant cache hit.
[2026-05-25 23:04:33] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-25 23:04:33] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-25 23:04:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 23:04:33] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-25 23:04:33] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2026-05-25 23:04:33] [INFO ] Computed and/alt/rep : 95/99/95 causal constraints (skipped 11 transitions) in 6 ms.
[2026-05-25 23:04:34] [INFO ] Added : 53 causal constraints over 11 iterations in 105 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 873 ms.
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 5329 reset in 187 ms.
Product exploration explored 100000 steps with 5288 reset in 188 ms.
Built C files in :
/tmp/ltsmin6268130040416530287
[2026-05-25 23:04:34] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2026-05-25 23:04:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:04:34] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2026-05-25 23:04:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:04:34] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2026-05-25 23:04:34] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:04:34] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6268130040416530287
Running compilation step : cd /tmp/ltsmin6268130040416530287;'/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 246 ms.
Running link step : cd /tmp/ltsmin6268130040416530287;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6268130040416530287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16415307041880209348.hoa' '--buchi-type=spotba'
LTSmin run took 5890 ms.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-10 finished in 33202 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(p1)&&p0))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 241 transition count 227
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 235 transition count 221
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 235 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 232 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 232 transition count 218
Applied a total of 20 rules in 16 ms. Remains 232 /243 variables (removed 11) and now considering 218/227 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5430774367305298140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2158272961231824104.kers'
[2026-05-25 23:04:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5430774367305298140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2158272961231824104.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 232 cols 657 entries
Finished phase 1 with 214 SingleSign rule and 4 generalized
[2026-05-25 23:04:40] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2158272961231824104.kers
Total runtime 2 ms.
[2026-05-25 23:04:41] [INFO ] Implicit Places using invariants in 687 ms returned []
[2026-05-25 23:04:41] [INFO ] Invariant cache hit.
[2026-05-25 23:04:42] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1718 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2026-05-25 23:04:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17574 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47629ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47630ms
Starting structural reductions in LTL mode, iteration 1 : 232/243 places, 218/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49365 ms. Remains : 232/243 places, 218/227 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(p1)&&p0))))'
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-12 finished in 49539 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(F(p0)) U (G(p1) U (p2||X(p3))))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 227/227 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 237 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 237 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 234 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 234 transition count 218
Applied a total of 18 rules in 17 ms. Remains 234 /243 variables (removed 9) and now considering 218/227 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11032720870504541535.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15782826680172224976.kers'
[2026-05-25 23:05:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11032720870504541535.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15782826680172224976.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 234 cols 667 entries
Finished phase 1 with 205 SingleSign rule and 13 generalized
[2026-05-25 23:05:30] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-15782826680172224976.kers
Total runtime 12 ms.
[2026-05-25 23:05:30] [INFO ] Implicit Places using invariants in 357 ms returned []
[2026-05-25 23:05:30] [INFO ] Invariant cache hit.
[2026-05-25 23:05:31] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2026-05-25 23:05:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 11/233 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 1/234 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (OVERLAPS) 218/452 variables, 234/254 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 11 (OVERLAPS) 0/452 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 254 constraints, problems are : Problem set: 0 solved, 208 unsolved in 19952 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 11/233 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 1/234 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 11 (OVERLAPS) 218/452 variables, 234/257 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 208/465 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 469 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50004ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 50004ms
Starting structural reductions in LTL mode, iteration 1 : 234/243 places, 218/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51566 ms. Remains : 234/243 places, 218/227 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(F(p0)) U (G(p1) U (p2||X(p3))))))'
Stuttering acceptance computed with spot in 384 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Computed a total of 234 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 234 transition count 218
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 17 ms. Proved property starting from automaton with 8 states, 18 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 89 ms.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-14 finished in 52406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(X(G(p1))||F(p2)))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 241 transition count 227
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 235 transition count 221
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 235 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 232 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 232 transition count 218
Applied a total of 20 rules in 14 ms. Remains 232 /243 variables (removed 11) and now considering 218/227 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9051094832318161439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11038859482925922331.kers'
[2026-05-25 23:06:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9051094832318161439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11038859482925922331.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 232 cols 657 entries
Finished phase 1 with 214 SingleSign rule and 4 generalized
[2026-05-25 23:06:22] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11038859482925922331.kers
Total runtime 4 ms.
[2026-05-25 23:06:22] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 23:06:22] [INFO ] Invariant cache hit.
[2026-05-25 23:06:23] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2026-05-25 23:06:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17966 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48008ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 48009ms
Starting structural reductions in LTL mode, iteration 1 : 232/243 places, 218/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49024 ms. Remains : 232/243 places, 218/227 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(X(G(p1))||F(p2)))))'
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 140 ms.
Product exploration explored 100000 steps with 33333 reset in 152 ms.
Computed a total of 232 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 232 transition count 218
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 10 factoid took 19 ms. Proved property starting from automaton with 6 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 81 ms.
FORMULA HirschbergSinclair-PT-10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLCardinality-15 finished in 49652 ms.
All properties solved by simple procedures.
Total runtime 503347 ms.

BK_STOP 1779750432767

--------------------
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-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074400739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-10.tgz
mv HirschbergSinclair-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;