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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 11K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Mar 15 10:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:50 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 321K 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-25-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779753833870

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-25
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-26 00:03:55] [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-26 00:03:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 00:03:55] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2026-05-26 00:03:55] [INFO ] Transformed 600 places.
[2026-05-26 00:03:55] [INFO ] Transformed 545 transitions.
[2026-05-26 00:03:55] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 545/545 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 576 transition count 545
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 44 place count 556 transition count 525
Iterating global reduction 1 with 20 rules applied. Total rules applied 64 place count 556 transition count 525
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 79 place count 541 transition count 510
Iterating global reduction 1 with 15 rules applied. Total rules applied 94 place count 541 transition count 510
Applied a total of 94 rules in 155 ms. Remains 541 /600 variables (removed 59) and now considering 510/545 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6348128958423991262.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9055811327585566363.kers'
[2026-05-26 00:03:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6348128958423991262.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9055811327585566363.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 510 rows 541 cols 1531 entries
Finished phase 1 with 505 SingleSign rule and 5 generalized
[2026-05-26 00:03:55] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9055811327585566363.kers
Total runtime 3 ms.
[2026-05-26 00:03:56] [INFO ] Implicit Places using invariants in 555 ms returned []
[2026-05-26 00:03:56] [INFO ] Invariant cache hit.
[2026-05-26 00:04:03] [INFO ] Implicit Places using invariants and state equation in 7377 ms returned []
Implicit Place search using SMT with State Equation took 7964 ms to find 0 implicit places.
Running 485 sub problems to find dead transitions.
[2026-05-26 00:04:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 2 (OVERLAPS) 2/517 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 4 (OVERLAPS) 24/541 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 485 unsolved
SMT process timed out in 30196ms, After SMT, problems are : Problem set: 0 solved, 485 unsolved
Search for dead transitions found 0 dead transitions in 30219ms
Starting structural reductions in LTL mode, iteration 1 : 541/600 places, 510/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38390 ms. Remains : 541/600 places, 510/545 transitions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 510/510 transitions.
Applied a total of 0 rules in 15 ms. Remains 541 /541 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2026-05-26 00:04:33] [INFO ] Invariant cache hit.
[2026-05-26 00:04:34] [INFO ] Implicit Places using invariants in 331 ms returned []
[2026-05-26 00:04:34] [INFO ] Invariant cache hit.
[2026-05-26 00:04:41] [INFO ] Implicit Places using invariants and state equation in 7159 ms returned []
Implicit Place search using SMT with State Equation took 7496 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 7514 ms. Remains : 541/541 places, 510/510 transitions.
Support contains 48 out of 541 places after structural reductions.
[2026-05-26 00:04:41] [INFO ] Flatten gal took : 62 ms
[2026-05-26 00:04:41] [INFO ] Flatten gal took : 30 ms
[2026-05-26 00:04:41] [INFO ] Input system was already deterministic with 510 transitions.
RANDOM walk for 40000 steps (72 resets) in 2131 ms. (18 steps per ms) remains 13/35 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 13/13 properties
[2026-05-26 00:04:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 421/433 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 3/436 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 50/486 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Real declared 996/1051 variables, and 517 constraints, problems are : Problem set: 13 solved, 0 unsolved in 1461 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 486/541 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1474ms problems are : Problem set: 13 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 13 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 541 stabilizing places and 510 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 541 transition count 510
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 510/510 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 517 transition count 268
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 299 transition count 268
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 444 place count 291 transition count 260
Iterating global reduction 2 with 8 rules applied. Total rules applied 452 place count 291 transition count 260
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 456 place count 291 transition count 256
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 460 place count 287 transition count 256
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 4 with 2 rules applied. Total rules applied 462 place count 286 transition count 255
Applied a total of 462 rules in 57 ms. Remains 286 /541 variables (removed 255) and now considering 255/510 (removed 255) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14588529949131940654.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4087192194511610309.kers'
[2026-05-26 00:04:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14588529949131940654.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4087192194511610309.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 255 rows 286 cols 525 entries
Finished phase 1 with 250 SingleSign rule and 5 generalized
[2026-05-26 00:04:44] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4087192194511610309.kers
Total runtime 1 ms.
[2026-05-26 00:04:44] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-05-26 00:04:44] [INFO ] Invariant cache hit.
[2026-05-26 00:04:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 00:04:48] [INFO ] Implicit Places using invariants and state equation in 3437 ms returned []
Implicit Place search using SMT with State Equation took 3724 ms to find 0 implicit places.
[2026-05-26 00:04:48] [INFO ] Redundant transitions in 11 ms returned []
Running 209 sub problems to find dead transitions.
[2026-05-26 00:04:48] [INFO ] Invariant cache hit.
[2026-05-26 00:04:48] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 2/241 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 3/244 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 213/457 variables, 244/275 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 8/283 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/457 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/541 variables, and 283 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 244/286 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 2/241 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 3/244 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 213/457 variables, 244/275 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 8/283 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 209/492 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/541 variables, and 492 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 244/286 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in SI_LTL mode, iteration 1 : 286/541 places, 255/510 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63854 ms. Remains : 286/541 places, 255/510 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-01
Product exploration explored 100000 steps with 825 reset in 363 ms.
Product exploration explored 100000 steps with 825 reset in 333 ms.
Computed a total of 286 stabilizing places and 255 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 286 transition count 255
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 false by K+ with min(phi)
Knowledge based reduction with 5 factoid took 22 ms. Proved property starting from automaton with 2 states, 5 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 115 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-01 finished in 65004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))&&F(p0)))'
Support contains 3 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 510/510 transitions.
Graph (complete) has 1020 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 217 place count 516 transition count 270
Reduce places removed 216 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 218 rules applied. Total rules applied 435 place count 300 transition count 268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 437 place count 298 transition count 268
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 446 place count 289 transition count 259
Iterating global reduction 3 with 9 rules applied. Total rules applied 455 place count 289 transition count 259
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 459 place count 289 transition count 255
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 463 place count 285 transition count 255
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 465 place count 284 transition count 254
Applied a total of 465 rules in 63 ms. Remains 284 /541 variables (removed 257) and now considering 254/510 (removed 256) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7721362571423058418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10365593085760929991.kers'
[2026-05-26 00:05:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7721362571423058418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10365593085760929991.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 254 rows 284 cols 523 entries
Finished phase 1 with 249 SingleSign rule and 5 generalized
[2026-05-26 00:05:49] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10365593085760929991.kers
Total runtime 1 ms.
[2026-05-26 00:05:49] [INFO ] Implicit Places using invariants in 271 ms returned []
[2026-05-26 00:05:49] [INFO ] Invariant cache hit.
[2026-05-26 00:05:49] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-26 00:05:52] [INFO ] Implicit Places using invariants and state equation in 2890 ms returned []
Implicit Place search using SMT with State Equation took 3163 ms to find 0 implicit places.
[2026-05-26 00:05:52] [INFO ] Redundant transitions in 3 ms returned []
Running 207 sub problems to find dead transitions.
[2026-05-26 00:05:52] [INFO ] Invariant cache hit.
[2026-05-26 00:05:52] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 2/239 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 209/448 variables, 239/269 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 0/448 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/538 variables, and 281 constraints, problems are : Problem set: 0 solved, 207 unsolved in 26137 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 239/284 constraints, ReadFeed: 12/12 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/237 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 2/239 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 209/448 variables, 239/269 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 207/488 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/538 variables, and 488 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 239/284 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56174ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 56175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 284/541 places, 254/510 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59412 ms. Remains : 284/541 places, 254/510 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))&&F(p0)))'
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 682 steps with 5 reset in 4 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-03 finished in 59605 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 X(p1)) U X(p2))&&F(!p1)))'
Support contains 5 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 510/510 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 540 transition count 510
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 531 transition count 501
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 531 transition count 501
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 527 transition count 497
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 527 transition count 497
Applied a total of 27 rules in 56 ms. Remains 527 /541 variables (removed 14) and now considering 497/510 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10600041588777115973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12667613491410126775.kers'
[2026-05-26 00:06:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10600041588777115973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12667613491410126775.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 527 cols 1495 entries
Finished phase 1 with 492 SingleSign rule and 5 generalized
[2026-05-26 00:06:49] [INFO ] Computed 30 invariants in 4 ms
Computed 30 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12667613491410126775.kers
Total runtime 6 ms.
[2026-05-26 00:06:49] [INFO ] Implicit Places using invariants in 183 ms returned []
[2026-05-26 00:06:49] [INFO ] Invariant cache hit.
[2026-05-26 00:06:56] [INFO ] Implicit Places using invariants and state equation in 7662 ms returned []
Implicit Place search using SMT with State Equation took 7847 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2026-05-26 00:06:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 25/527 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 497/1024 variables, 527/557 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 557 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 25/527 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 497/1024 variables, 527/557 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 472/1029 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1029 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 527/541 places, 497/510 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67993 ms. Remains : 527/541 places, 497/510 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 X(p1)) U X(p2))&&F(!p1)))'
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) p1), p1, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-05
Product exploration explored 100000 steps with 1268 reset in 273 ms.
Product exploration explored 100000 steps with 1265 reset in 300 ms.
Computed a total of 527 stabilizing places and 497 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 527 transition count 497
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 17 factoid took 67 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 957 steps (0 resets) in 12 ms. (73 steps per ms) remains 0/1 properties
Knowledge based reduction with 17 factoid took 52 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[p1, p1]
[2026-05-26 00:07:58] [INFO ] Invariant cache hit.
[2026-05-26 00:07:58] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 26 ms returned sat
[2026-05-26 00:08:07] [INFO ] [Real]Absence check using state equation in 8783 ms returned sat
[2026-05-26 00:08:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 00:08:07] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 19 ms returned sat
[2026-05-26 00:08:09] [INFO ] [Nat]Absence check using state equation in 1656 ms returned sat
[2026-05-26 00:08:09] [INFO ] Computed and/alt/rep : 254/483/254 causal constraints (skipped 218 transitions) in 29 ms.
[2026-05-26 00:08:13] [INFO ] Added : 102 causal constraints over 21 iterations in 4071 ms. Result :sat
Could not prove EG p1
Knowledge-based reduction took 15344 ms.
Stuttering acceptance computed with spot in 64 ms :[p1, p1]
Support contains 2 out of 527 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 502 transition count 255
Reduce places removed 217 places and 0 transitions.
Iterating post reduction 1 with 217 rules applied. Total rules applied 434 place count 285 transition count 255
Applied a total of 434 rules in 20 ms. Remains 285 /527 variables (removed 242) and now considering 255/497 (removed 242) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12110949297130804770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14125182639084288657.kers'
[2026-05-26 00:08:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12110949297130804770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14125182639084288657.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 255 rows 285 cols 527 entries
Finished phase 1 with 250 SingleSign rule and 5 generalized
[2026-05-26 00:08:13] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14125182639084288657.kers
Total runtime 1 ms.
[2026-05-26 00:08:13] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-26 00:08:13] [INFO ] Invariant cache hit.
[2026-05-26 00:08:15] [INFO ] Implicit Places using invariants and state equation in 2000 ms returned []
Implicit Place search using SMT with State Equation took 2237 ms to find 0 implicit places.
[2026-05-26 00:08:15] [INFO ] Redundant transitions in 2 ms returned []
Running 206 sub problems to find dead transitions.
[2026-05-26 00:08:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 2/238 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 210/448 variables, 238/268 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 4/452 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/452 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/540 variables, and 271 constraints, problems are : Problem set: 0 solved, 206 unsolved in 23055 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 241/285 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/236 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 2/238 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 210/448 variables, 238/268 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 195/463 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 206 unsolved
SMT process timed out in 53077ms, After SMT, problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 53079ms
Starting structural reductions in SI_LTL mode, iteration 1 : 285/527 places, 255/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55347 ms. Remains : 285/527 places, 255/497 transitions.
Computed a total of 285 stabilizing places and 255 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 255
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 4 factoid took 43 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 487 steps (0 resets) in 8 ms. (54 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 50 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[p1, p1]
[2026-05-26 00:09:08] [INFO ] Invariant cache hit.
[2026-05-26 00:09:09] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 12 ms returned sat
[2026-05-26 00:09:14] [INFO ] [Real]Absence check using state equation in 5589 ms returned sat
[2026-05-26 00:09:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 00:09:14] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 10 ms returned sat
[2026-05-26 00:09:14] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-26 00:09:14] [INFO ] Computed and/alt/rep : 206/212/206 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-26 00:09:15] [INFO ] Added : 50 causal constraints over 10 iterations in 180 ms. Result :sat
Could not prove EG p1
Knowledge-based reduction took 6365 ms.
Stuttering acceptance computed with spot in 68 ms :[p1, p1]
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Product exploration explored 100000 steps with 901 reset in 254 ms.
Product exploration explored 100000 steps with 900 reset in 291 ms.
Built C files in :
/tmp/ltsmin17898960384759754798
[2026-05-26 00:09:15] [INFO ] Computing symmetric may disable matrix : 255 transitions.
[2026-05-26 00:09:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:09:15] [INFO ] Computing symmetric may enable matrix : 255 transitions.
[2026-05-26 00:09:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:09:15] [INFO ] Computing Do-Not-Accords matrix : 255 transitions.
[2026-05-26 00:09:15] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:09:15] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17898960384759754798
Running compilation step : cd /tmp/ltsmin17898960384759754798;'/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 609 ms.
Running link step : cd /tmp/ltsmin17898960384759754798;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin17898960384759754798;'/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/stateBased7238257687604136333.hoa' '--buchi-type=spotba'
LTSmin run took 6760 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-05 finished in 154223 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 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 510/510 transitions.
Graph (complete) has 1020 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 220 place count 515 transition count 266
Reduce places removed 219 places and 0 transitions.
Iterating post reduction 1 with 219 rules applied. Total rules applied 439 place count 296 transition count 266
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 448 place count 287 transition count 257
Iterating global reduction 2 with 9 rules applied. Total rules applied 457 place count 287 transition count 257
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 462 place count 287 transition count 252
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 467 place count 282 transition count 252
Applied a total of 467 rules in 36 ms. Remains 282 /541 variables (removed 259) and now considering 252/510 (removed 258) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17500852303021779875.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10668860619183460448.kers'
[2026-05-26 00:09:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17500852303021779875.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10668860619183460448.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 252 rows 282 cols 515 entries
Finished phase 1 with 247 SingleSign rule and 5 generalized
[2026-05-26 00:09:23] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10668860619183460448.kers
Total runtime 1 ms.
[2026-05-26 00:09:23] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-26 00:09:23] [INFO ] Invariant cache hit.
[2026-05-26 00:09:26] [INFO ] Implicit Places using invariants and state equation in 2516 ms returned []
Implicit Place search using SMT with State Equation took 2730 ms to find 0 implicit places.
[2026-05-26 00:09:26] [INFO ] Redundant transitions in 1 ms returned []
Running 203 sub problems to find dead transitions.
[2026-05-26 00:09:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 2/235 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 206/441 variables, 235/265 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 1/442 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/442 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/534 variables, and 266 constraints, problems are : Problem set: 0 solved, 203 unsolved in 22608 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 236/282 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 2/235 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 206/441 variables, 235/265 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 203/468 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 1/442 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/442 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/534 variables, and 469 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 236/282 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52642ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 52643ms
Starting structural reductions in SI_LTL mode, iteration 1 : 282/541 places, 252/510 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55416 ms. Remains : 282/541 places, 252/510 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 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-07
Product exploration explored 100000 steps with 1981 reset in 361 ms.
Stuttering criterion allowed to conclude after 56226 steps with 1127 reset in 217 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-07 finished in 56099 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(p0))&&G(p1))))'
Support contains 3 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 510/510 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 540 transition count 510
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 531 transition count 501
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 531 transition count 501
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 526 transition count 496
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 526 transition count 496
Applied a total of 29 rules in 39 ms. Remains 526 /541 variables (removed 15) and now considering 496/510 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12790027932143214786.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16403353274144171679.kers'
[2026-05-26 00:10:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12790027932143214786.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16403353274144171679.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 496 rows 526 cols 1493 entries
Finished phase 1 with 491 SingleSign rule and 5 generalized
[2026-05-26 00:10:19] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16403353274144171679.kers
Total runtime 3 ms.
[2026-05-26 00:10:19] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-26 00:10:19] [INFO ] Invariant cache hit.
[2026-05-26 00:10:27] [INFO ] Implicit Places using invariants and state equation in 7898 ms returned []
Implicit Place search using SMT with State Equation took 8080 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2026-05-26 00:10:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 556 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 471/1027 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1027 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 526/541 places, 496/510 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68200 ms. Remains : 526/541 places, 496/510 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(p0))&&G(p1))))'
Stuttering acceptance computed with spot in 204 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-08 finished in 68437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 510/510 transitions.
Graph (complete) has 1020 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 220 place count 515 transition count 266
Reduce places removed 219 places and 0 transitions.
Iterating post reduction 1 with 219 rules applied. Total rules applied 439 place count 296 transition count 266
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 449 place count 286 transition count 256
Iterating global reduction 2 with 10 rules applied. Total rules applied 459 place count 286 transition count 256
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 464 place count 286 transition count 251
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 469 place count 281 transition count 251
Applied a total of 469 rules in 28 ms. Remains 281 /541 variables (removed 260) and now considering 251/510 (removed 259) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18335986743246321375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-888011655453226778.kers'
[2026-05-26 00:11:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18335986743246321375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-888011655453226778.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 251 rows 281 cols 514 entries
Finished phase 1 with 246 SingleSign rule and 5 generalized
[2026-05-26 00:11:27] [INFO ] Computed 30 invariants in 1 ms
Computed 30 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-888011655453226778.kers
Total runtime 2 ms.
[2026-05-26 00:11:28] [INFO ] Implicit Places using invariants in 235 ms returned []
[2026-05-26 00:11:28] [INFO ] Invariant cache hit.
[2026-05-26 00:11:30] [INFO ] Implicit Places using invariants and state equation in 2428 ms returned []
Implicit Place search using SMT with State Equation took 2664 ms to find 0 implicit places.
[2026-05-26 00:11:30] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2026-05-26 00:11:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 2/234 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 204/438 variables, 234/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/532 variables, and 264 constraints, problems are : Problem set: 0 solved, 202 unsolved in 17750 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 234/281 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 2/234 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 204/438 variables, 234/264 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 202/466 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/532 variables, and 466 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 234/281 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47781ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 47781ms
Starting structural reductions in SI_LTL mode, iteration 1 : 281/541 places, 251/510 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50479 ms. Remains : 281/541 places, 251/510 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-10
Product exploration explored 100000 steps with 586 reset in 219 ms.
Product exploration explored 100000 steps with 587 reset in 228 ms.
Computed a total of 281 stabilizing places and 251 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 281 transition count 251
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 4 factoid took 44 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 713 steps (0 resets) in 9 ms. (71 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 62 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2026-05-26 00:12:19] [INFO ] Invariant cache hit.
[2026-05-26 00:12:19] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 11 ms returned sat
[2026-05-26 00:12:20] [INFO ] [Real]Absence check using state equation in 1320 ms returned sat
[2026-05-26 00:12:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 00:12:20] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 10 ms returned sat
[2026-05-26 00:12:21] [INFO ] [Nat]Absence check using state equation in 1044 ms returned sat
[2026-05-26 00:12:21] [INFO ] Computed and/alt/rep : 202/208/202 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-26 00:12:22] [INFO ] Added : 110 causal constraints over 22 iterations in 975 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 3857 ms.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 1 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 251/251 transitions.
Applied a total of 0 rules in 15 ms. Remains 281 /281 variables (removed 0) and now considering 251/251 (removed 0) transitions.
[2026-05-26 00:12:22] [INFO ] Invariant cache hit.
[2026-05-26 00:12:22] [INFO ] Implicit Places using invariants in 234 ms returned []
[2026-05-26 00:12:22] [INFO ] Invariant cache hit.
[2026-05-26 00:12:25] [INFO ] Implicit Places using invariants and state equation in 2545 ms returned []
Implicit Place search using SMT with State Equation took 2780 ms to find 0 implicit places.
[2026-05-26 00:12:25] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2801 ms. Remains : 281/281 places, 251/251 transitions.
Computed a total of 281 stabilizing places and 251 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 281 transition count 251
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 4 factoid took 38 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 725 steps (0 resets) in 9 ms. (72 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 57 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2026-05-26 00:12:25] [INFO ] Invariant cache hit.
[2026-05-26 00:12:25] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 10 ms returned sat
[2026-05-26 00:12:27] [INFO ] [Real]Absence check using state equation in 1256 ms returned sat
[2026-05-26 00:12:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 00:12:27] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 10 ms returned sat
[2026-05-26 00:12:28] [INFO ] [Nat]Absence check using state equation in 1021 ms returned sat
[2026-05-26 00:12:28] [INFO ] Computed and/alt/rep : 202/208/202 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-26 00:12:29] [INFO ] Added : 110 causal constraints over 22 iterations in 925 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 3694 ms.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 589 reset in 214 ms.
Product exploration explored 100000 steps with 588 reset in 224 ms.
Built C files in :
/tmp/ltsmin7715535554969306713
[2026-05-26 00:12:29] [INFO ] Computing symmetric may disable matrix : 251 transitions.
[2026-05-26 00:12:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:12:29] [INFO ] Computing symmetric may enable matrix : 251 transitions.
[2026-05-26 00:12:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:12:29] [INFO ] Computing Do-Not-Accords matrix : 251 transitions.
[2026-05-26 00:12:29] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:12:29] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7715535554969306713
Running compilation step : cd /tmp/ltsmin7715535554969306713;'/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/ltsmin7715535554969306713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7715535554969306713;'/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/stateBased13098211304019733432.hoa' '--buchi-type=spotba'
LTSmin run took 475 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-10 finished in 62943 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)))'
Support contains 4 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 510/510 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 540 transition count 510
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 532 transition count 502
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 532 transition count 502
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 527 transition count 497
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 527 transition count 497
Applied a total of 27 rules in 41 ms. Remains 527 /541 variables (removed 14) and now considering 497/510 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18385974722108674687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3316511273167589044.kers'
[2026-05-26 00:12:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18385974722108674687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3316511273167589044.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 497 rows 527 cols 1496 entries
Finished phase 1 with 492 SingleSign rule and 5 generalized
[2026-05-26 00:12:30] [INFO ] Computed 30 invariants in 7 ms
Computed 30 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-3316511273167589044.kers
Total runtime 8 ms.
[2026-05-26 00:12:30] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-26 00:12:30] [INFO ] Invariant cache hit.
[2026-05-26 00:12:38] [INFO ] Implicit Places using invariants and state equation in 7591 ms returned []
Implicit Place search using SMT with State Equation took 7768 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2026-05-26 00:12:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 25/527 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 497/1024 variables, 527/557 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 557 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 25/527 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 497/1024 variables, 527/557 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 472/1029 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1029 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Starting structural reductions in LTL mode, iteration 1 : 527/541 places, 497/510 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67890 ms. Remains : 527/541 places, 497/510 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)))'
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 277 ms.
Product exploration explored 100000 steps with 33333 reset in 277 ms.
Computed a total of 527 stabilizing places and 497 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 527 transition count 497
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 3 factoid took 9 ms. Proved property starting from automaton with 4 states, 4 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 133 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-11 finished in 68738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 510/510 transitions.
Graph (complete) has 1020 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 212 place count 516 transition count 275
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 423 place count 305 transition count 275
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 433 place count 295 transition count 265
Iterating global reduction 2 with 10 rules applied. Total rules applied 443 place count 295 transition count 265
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 448 place count 295 transition count 260
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 453 place count 290 transition count 260
Applied a total of 453 rules in 31 ms. Remains 290 /541 variables (removed 251) and now considering 260/510 (removed 250) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7288466616285536045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6047874363797065633.kers'
[2026-05-26 00:13:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7288466616285536045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6047874363797065633.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 290 cols 550 entries
Finished phase 1 with 255 SingleSign rule and 5 generalized
[2026-05-26 00:13:39] [INFO ] Computed 30 invariants in 1 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6047874363797065633.kers
Total runtime 2 ms.
[2026-05-26 00:13:39] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-26 00:13:39] [INFO ] Invariant cache hit.
[2026-05-26 00:13:42] [INFO ] Implicit Places using invariants and state equation in 2758 ms returned []
Implicit Place search using SMT with State Equation took 3024 ms to find 0 implicit places.
[2026-05-26 00:13:42] [INFO ] Redundant transitions in 1 ms returned []
Running 214 sub problems to find dead transitions.
[2026-05-26 00:13:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 3/247 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 217/464 variables, 247/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/550 variables, and 277 constraints, problems are : Problem set: 0 solved, 214 unsolved in 20036 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 247/290 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 3/247 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 217/464 variables, 247/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 214/491 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/550 variables, and 491 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 247/290 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50064ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 50065ms
Starting structural reductions in SI_LTL mode, iteration 1 : 290/541 places, 260/510 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53126 ms. Remains : 290/541 places, 260/510 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-13
Stuttering criterion allowed to conclude after 286 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-13 finished in 53185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 510/510 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 540 transition count 510
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 531 transition count 501
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 531 transition count 501
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 527 transition count 497
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 527 transition count 497
Applied a total of 27 rules in 41 ms. Remains 527 /541 variables (removed 14) and now considering 497/510 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3425253584942729116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12280006248051093782.kers'
[2026-05-26 00:14:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3425253584942729116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12280006248051093782.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 527 cols 1495 entries
Finished phase 1 with 492 SingleSign rule and 5 generalized
[2026-05-26 00:14:32] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12280006248051093782.kers
Total runtime 4 ms.
[2026-05-26 00:14:32] [INFO ] Implicit Places using invariants in 179 ms returned []
[2026-05-26 00:14:32] [INFO ] Invariant cache hit.
[2026-05-26 00:14:39] [INFO ] Implicit Places using invariants and state equation in 6911 ms returned []
Implicit Place search using SMT with State Equation took 7092 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2026-05-26 00:14:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 25/527 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 497/1024 variables, 527/557 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 557 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 25/527 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 497/1024 variables, 527/557 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 472/1029 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1029 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 527/541 places, 497/510 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67240 ms. Remains : 527/541 places, 497/510 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(p0)))'
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 339 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-14 finished in 67355 ms.
All properties solved by simple procedures.
Total runtime 705010 ms.

BK_STOP 1779754540410

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

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