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.r194-tall-177969913900195.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 NeoElection-COL-8, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969913900195
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 8.7K Mar 8 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 8 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 8 07:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 8 07:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Mar 16 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 16 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 16 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 8 07:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Mar 8 07:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 8 07:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 8 07:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 120K 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 NeoElection-COL-8-LTLCardinality-00
FORMULA_NAME NeoElection-COL-8-LTLCardinality-01
FORMULA_NAME NeoElection-COL-8-LTLCardinality-02
FORMULA_NAME NeoElection-COL-8-LTLCardinality-03
FORMULA_NAME NeoElection-COL-8-LTLCardinality-04
FORMULA_NAME NeoElection-COL-8-LTLCardinality-05
FORMULA_NAME NeoElection-COL-8-LTLCardinality-06
FORMULA_NAME NeoElection-COL-8-LTLCardinality-07
FORMULA_NAME NeoElection-COL-8-LTLCardinality-08
FORMULA_NAME NeoElection-COL-8-LTLCardinality-09
FORMULA_NAME NeoElection-COL-8-LTLCardinality-10
FORMULA_NAME NeoElection-COL-8-LTLCardinality-11
FORMULA_NAME NeoElection-COL-8-LTLCardinality-12
FORMULA_NAME NeoElection-COL-8-LTLCardinality-13
FORMULA_NAME NeoElection-COL-8-LTLCardinality-14
FORMULA_NAME NeoElection-COL-8-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779731528048

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-8
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202604301425
[2026-05-25 17:52:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 17:52:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:52:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-25 17:52:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-25 17:52:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 604 ms
[2026-05-25 17:52:09] [INFO ] Detected 6 constant HL places corresponding to 5058 PT places.
[2026-05-25 17:52:09] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 10062 PT places and 34578.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2026-05-25 17:52:10] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2026-05-25 17:52:10] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA NeoElection-COL-8-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Remains 11 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-8-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40006 steps (875 resets) in 340 ms. (117 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (125 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2391384649469771828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7283633136402106589.kers'
[2026-05-25 17:52:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2391384649469771828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7283633136402106589.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 6 cols 14 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-25 17:52:10] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7283633136402106589.kers
Total runtime 2 ms.
[2026-05-25 17:52:10] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 5/13 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
[2026-05-25 17:52:10] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2026-05-25 17:52:10] [INFO ] Flatten gal took : 13 ms
FORMULA NeoElection-COL-8-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 17:52:10] [INFO ] Flatten gal took : 1 ms
Domain [M(9), POS(8), M(9)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 8)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2026-05-25 17:52:10] [INFO ] Unfolded HLPN to a Petri net with 10062 places and 19858 transitions 113083 arcs in 236 ms.
[2026-05-25 17:52:10] [INFO ] Unfolded 4 HLPN properties in 2 ms.
Deduced a syphon composed of 9487 places in 43 ms
Reduce places removed 9551 places and 18965 transitions.
Reduce places removed 9 places and 0 transitions.
Support contains 240 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 893/893 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 446 transition count 893
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 104 place count 398 transition count 389
Iterating global reduction 1 with 48 rules applied. Total rules applied 152 place count 398 transition count 389
Applied a total of 152 rules in 35 ms. Remains 398 /502 variables (removed 104) and now considering 389/893 (removed 504) transitions.
[2026-05-25 17:52:10] [INFO ] Flow matrix only has 340 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8951936802614526873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17818209685530794641.kers'
[2026-05-25 17:52:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8951936802614526873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17818209685530794641.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 340 rows 391 cols 1380 entries
Finished phase 1 with 228 SingleSign rule and 91 generalized
[2026-05-25 17:52:10] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17818209685530794641.kers
Total runtime 3 ms.
[2026-05-25 17:52:11] [INFO ] Implicit Places using invariants in 332 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 342 ms to find 64 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 334/502 places, 389/893 transitions.
Applied a total of 0 rules in 4 ms. Remains 334 /334 variables (removed 0) and now considering 389/389 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 387 ms. Remains : 334/502 places, 389/893 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 389/389 transitions.
Applied a total of 0 rules in 4 ms. Remains 334 /334 variables (removed 0) and now considering 389/389 (removed 0) transitions.
[2026-05-25 17:52:11] [INFO ] Flow matrix only has 340 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1177932287766807779.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12419402521232854524.kers'
[2026-05-25 17:52:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1177932287766807779.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12419402521232854524.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 340 rows 327 cols 1184 entries
Finished phase 1 with 319 SingleSign rule and 0 generalized
[2026-05-25 17:52:11] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12419402521232854524.kers
Total runtime 2 ms.
[2026-05-25 17:52:11] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 17:52:11] [INFO ] Flow matrix only has 340 transitions (discarded 49 similar events)
[2026-05-25 17:52:11] [INFO ] Invariant cache hit.
[2026-05-25 17:52:11] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-25 17:52:11] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2026-05-25 17:52:11] [INFO ] Flow matrix only has 340 transitions (discarded 49 similar events)
[2026-05-25 17:52:11] [INFO ] Invariant cache hit.
[2026-05-25 17:52:11] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 8/334 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Problem TDEAD63 is UNSAT
At refinement iteration 4 (OVERLAPS) 340/674 variables, 334/349 constraints. Problems are: Problem set: 1 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 28/377 constraints. Problems are: Problem set: 1 solved, 380 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 20/397 constraints. Problems are: Problem set: 1 solved, 380 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 20/417 constraints. Problems are: Problem set: 1 solved, 380 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 20/437 constraints. Problems are: Problem set: 1 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/674 variables, and 437 constraints, problems are : Problem set: 1 solved, 380 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 334/334 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 380 unsolved
At refinement iteration 3 (OVERLAPS) 8/334 variables, 8/16 constraints. Problems are: Problem set: 1 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 59/75 constraints. Problems are: Problem set: 1 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 380 unsolved
At refinement iteration 6 (OVERLAPS) 340/674 variables, 334/409 constraints. Problems are: Problem set: 1 solved, 380 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 28/437 constraints. Problems are: Problem set: 1 solved, 380 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 380/817 constraints. Problems are: Problem set: 1 solved, 380 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/674 variables, 20/837 constraints. Problems are: Problem set: 1 solved, 380 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 839 constraints, problems are : Problem set: 1 solved, 380 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 334/334 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 380/381 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60221ms problems are : Problem set: 1 solved, 380 unsolved
Search for dead transitions found 1 dead transitions in 60226ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 334/334 places, 388/389 transitions.
Applied a total of 0 rules in 3 ms. Remains 334 /334 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60583 ms. Remains : 334/334 places, 388/389 transitions.
Support contains 240 out of 334 places after structural reductions.
[2026-05-25 17:53:11] [INFO ] Flatten gal took : 60 ms
[2026-05-25 17:53:11] [INFO ] Flatten gal took : 57 ms
[2026-05-25 17:53:12] [INFO ] Input system was already deterministic with 388 transitions.
RANDOM walk for 179 steps (0 resets) in 10 ms. (16 steps per ms) remains 0/3 properties
Computed a total of 334 stabilizing places and 388 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 334 transition count 388
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' '!(X(X(X(X(G(p0))))))'
Support contains 16 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 388/388 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 292 transition count 325
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 292 transition count 325
Applied a total of 84 rules in 10 ms. Remains 292 /334 variables (removed 42) and now considering 325/388 (removed 63) transitions.
[2026-05-25 17:53:12] [INFO ] Flow matrix only has 276 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15342250127137796924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15353418070848312541.kers'
[2026-05-25 17:53:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15342250127137796924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15353418070848312541.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 276 rows 285 cols 971 entries
Finished phase 1 with 276 SingleSign rule and 0 generalized
[2026-05-25 17:53:12] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15353418070848312541.kers
Total runtime 1 ms.
[2026-05-25 17:53:12] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-25 17:53:12] [INFO ] Flow matrix only has 276 transitions (discarded 49 similar events)
[2026-05-25 17:53:12] [INFO ] Invariant cache hit.
[2026-05-25 17:53:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 17:53:12] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 317 sub problems to find dead transitions.
[2026-05-25 17:53:12] [INFO ] Flow matrix only has 276 transitions (discarded 49 similar events)
[2026-05-25 17:53:12] [INFO ] Invariant cache hit.
[2026-05-25 17:53:12] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 8/292 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (OVERLAPS) 276/568 variables, 292/310 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 6/316 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 14/410 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/568 variables, and 413 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 292/292 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (OVERLAPS) 8/292 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 97/115 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (OVERLAPS) 276/568 variables, 292/407 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 6/413 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 317/730 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 3/733 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 3/736 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 736 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 292/292 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 105/105 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 292/334 places, 325/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60576 ms. Remains : 292/334 places, 325/388 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-8-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-8-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-8-LTLCardinality-01 finished in 61046 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 224 out of 334 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 334/334 places, 388/388 transitions.
Reduce places removed 8 places and 8 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 326 transition count 372
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 318 transition count 372
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 310 transition count 364
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 310 transition count 364
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 32 place count 310 transition count 356
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 302 transition count 356
Applied a total of 48 rules in 74 ms. Remains 302 /334 variables (removed 32) and now considering 356/388 (removed 32) transitions.
[2026-05-25 17:54:13] [INFO ] Flow matrix only has 307 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12621044269181061557.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4764532934900893026.kers'
[2026-05-25 17:54:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12621044269181061557.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4764532934900893026.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 307 rows 295 cols 615 entries
Finished phase 1 with 286 SingleSign rule and 0 generalized
[2026-05-25 17:54:13] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4764532934900893026.kers
Total runtime 1 ms.
[2026-05-25 17:54:13] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-25 17:54:13] [INFO ] Flow matrix only has 307 transitions (discarded 49 similar events)
[2026-05-25 17:54:13] [INFO ] Invariant cache hit.
[2026-05-25 17:54:13] [INFO ] State equation strengthened by 251 read => feed constraints.
[2026-05-25 17:54:13] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2026-05-25 17:54:13] [INFO ] Redundant transitions in 18 ms returned []
Running 348 sub problems to find dead transitions.
[2026-05-25 17:54:13] [INFO ] Flow matrix only has 307 transitions (discarded 49 similar events)
[2026-05-25 17:54:13] [INFO ] Invariant cache hit.
[2026-05-25 17:54:13] [INFO ] State equation strengthened by 251 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 8/302 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (OVERLAPS) 307/609 variables, 302/320 constraints. Problems are: Problem set: 0 solved, 348 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/609 variables, 251/571 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/609 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (OVERLAPS) 0/609 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 609/609 variables, and 571 constraints, problems are : Problem set: 0 solved, 348 unsolved in 22981 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 302/302 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (OVERLAPS) 8/302 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 307/609 variables, 302/320 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/609 variables, 251/571 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 348/919 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 10 (OVERLAPS) 0/609 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 609/609 variables, and 919 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 302/302 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53027ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 53028ms
Starting structural reductions in SI_LTL mode, iteration 1 : 302/334 places, 356/388 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53654 ms. Remains : 302/334 places, 356/388 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 52 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-8-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 503 ms.
Product exploration explored 100000 steps with 50000 reset in 478 ms.
Computed a total of 302 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 302 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 52 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 175 ms.
FORMULA NeoElection-COL-8-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-8-LTLCardinality-02 finished in 54897 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 224 out of 334 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 334/334 places, 388/388 transitions.
Reduce places removed 8 places and 8 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 326 transition count 372
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 318 transition count 372
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 310 transition count 364
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 310 transition count 364
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 32 place count 310 transition count 356
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 302 transition count 356
Applied a total of 48 rules in 58 ms. Remains 302 /334 variables (removed 32) and now considering 356/388 (removed 32) transitions.
[2026-05-25 17:55:08] [INFO ] Flow matrix only has 307 transitions (discarded 49 similar events)
[2026-05-25 17:55:08] [INFO ] Invariant cache hit.
[2026-05-25 17:55:08] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 17:55:08] [INFO ] Flow matrix only has 307 transitions (discarded 49 similar events)
[2026-05-25 17:55:08] [INFO ] Invariant cache hit.
[2026-05-25 17:55:08] [INFO ] State equation strengthened by 251 read => feed constraints.
[2026-05-25 17:55:08] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2026-05-25 17:55:08] [INFO ] Redundant transitions in 9 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/334 places, 356/388 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 406 ms. Remains : 302/334 places, 356/388 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 43 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-8-LTLCardinality-05
Stuttering criterion allowed to conclude after 280 steps with 0 reset in 7 ms.
FORMULA NeoElection-COL-8-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-8-LTLCardinality-05 finished in 488 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 8 out of 334 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 334/334 places, 388/388 transitions.
Reduce places removed 8 places and 8 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 326 transition count 372
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 318 transition count 372
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 58 place count 276 transition count 309
Iterating global reduction 0 with 42 rules applied. Total rules applied 100 place count 276 transition count 309
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 212 place count 220 transition count 253
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 220 place count 212 transition count 245
Applied a total of 220 rules in 53 ms. Remains 212 /334 variables (removed 122) and now considering 245/388 (removed 143) transitions.
[2026-05-25 17:55:08] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18267146073719372336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11546951856890220115.kers'
[2026-05-25 17:55:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18267146073719372336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11546951856890220115.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 196 rows 197 cols 559 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-25 17:55:08] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11546951856890220115.kers
Total runtime 1 ms.
[2026-05-25 17:55:08] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-25 17:55:08] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2026-05-25 17:55:08] [INFO ] Invariant cache hit.
[2026-05-25 17:55:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 17:55:09] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2026-05-25 17:55:09] [INFO ] Redundant transitions in 4 ms returned []
Running 189 sub problems to find dead transitions.
[2026-05-25 17:55:09] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2026-05-25 17:55:09] [INFO ] Invariant cache hit.
[2026-05-25 17:55:09] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/206 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 196/402 variables, 206/222 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 6/408 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 234 constraints, problems are : Problem set: 0 solved, 189 unsolved in 12956 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/206 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 196/402 variables, 206/222 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 189/417 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 6/408 variables, 6/423 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 0/408 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 423 constraints, problems are : Problem set: 0 solved, 189 unsolved in 16411 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29405ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 29406ms
Starting structural reductions in SI_LTL mode, iteration 1 : 212/334 places, 245/388 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29806 ms. Remains : 212/334 places, 245/388 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 51 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-8-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 486 ms.
Product exploration explored 100000 steps with 50000 reset in 507 ms.
Computed a total of 212 stabilizing places and 245 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 212 transition count 245
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 17 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 90 ms.
FORMULA NeoElection-COL-8-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-8-LTLCardinality-11 finished in 30971 ms.
All properties solved by simple procedures.
Total runtime 210500 ms.

BK_STOP 1779731740022

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-COL-8"
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 NeoElection-COL-8, 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 r194-tall-177969913900195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-8.tgz
mv NeoElection-COL-8 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 ;