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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 9.6K Mar 8 07:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 8 07:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 8 07:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 8 07:32 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 5.2K Mar 16 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 16 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 16 08:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 16 08:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Mar 8 07:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 8 07:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 8 07:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 8 07:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:10 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 89K 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-5-LTLCardinality-00
FORMULA_NAME NeoElection-COL-5-LTLCardinality-01
FORMULA_NAME NeoElection-COL-5-LTLCardinality-02
FORMULA_NAME NeoElection-COL-5-LTLCardinality-03
FORMULA_NAME NeoElection-COL-5-LTLCardinality-04
FORMULA_NAME NeoElection-COL-5-LTLCardinality-05
FORMULA_NAME NeoElection-COL-5-LTLCardinality-06
FORMULA_NAME NeoElection-COL-5-LTLCardinality-07
FORMULA_NAME NeoElection-COL-5-LTLCardinality-08
FORMULA_NAME NeoElection-COL-5-LTLCardinality-09
FORMULA_NAME NeoElection-COL-5-LTLCardinality-10
FORMULA_NAME NeoElection-COL-5-LTLCardinality-11
FORMULA_NAME NeoElection-COL-5-LTLCardinality-12
FORMULA_NAME NeoElection-COL-5-LTLCardinality-13
FORMULA_NAME NeoElection-COL-5-LTLCardinality-14
FORMULA_NAME NeoElection-COL-5-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779726606132

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-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202604301425
[2026-05-25 16:30:07] [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 16:30:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 16:30:07] [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 16:30:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-25 16:30:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 598 ms
[2026-05-25 16:30:08] [INFO ] Detected 6 constant HL places corresponding to 1500 PT places.
[2026-05-25 16:30:08] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 3090 PT places and 7716.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2026-05-25 16:30:08] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2026-05-25 16:30:08] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA NeoElection-COL-5-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-13 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.5 ms
Remains 12 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-5-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 320 steps (10 resets) in 18 ms. (16 steps per ms) remains 0/7 properties
[2026-05-25 16:30:08] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2026-05-25 16:30:08] [INFO ] Flatten gal took : 14 ms
[2026-05-25 16:30:08] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA NeoElection-COL-5-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 16:30:08] [INFO ] Flatten gal took : 1 ms
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.
Domain [M(6), POS(5), M(6)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 5)]] contains successor/predecessor on variables of sort POS
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 16:30:08] [INFO ] Unfolded HLPN to a Petri net with 3090 places and 4024 transitions 22762 arcs in 98 ms.
[2026-05-25 16:30:08] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Deduced a syphon composed of 2866 places in 13 ms
Reduce places removed 2891 places and 3788 transitions.
Reduce places removed 6 places and 0 transitions.
Support contains 95 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 236/236 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 173 transition count 236
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 35 place count 158 transition count 146
Iterating global reduction 1 with 15 rules applied. Total rules applied 50 place count 158 transition count 146
Applied a total of 50 rules in 17 ms. Remains 158 /193 variables (removed 35) and now considering 146/236 (removed 90) transitions.
[2026-05-25 16:30:08] [INFO ] Flow matrix only has 130 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6818297436392495629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3112589203610204931.kers'
[2026-05-25 16:30:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6818297436392495629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3112589203610204931.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 130 rows 154 cols 510 entries
Finished phase 1 with 90 SingleSign rule and 34 generalized
[2026-05-25 16:30:08] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3112589203610204931.kers
Total runtime 1 ms.
[2026-05-25 16:30:08] [INFO ] Implicit Places using invariants in 351 ms returned [13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 395 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/193 places, 146/236 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 424 ms. Remains : 133/193 places, 146/236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 146/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2026-05-25 16:30:08] [INFO ] Flow matrix only has 130 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12046245999013950186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16862331182913211739.kers'
[2026-05-25 16:30:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12046245999013950186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16862331182913211739.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 130 rows 129 cols 440 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-25 16:30:08] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-16862331182913211739.kers
Total runtime 8 ms.
[2026-05-25 16:30:08] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 16:30:08] [INFO ] Flow matrix only has 130 transitions (discarded 16 similar events)
[2026-05-25 16:30:08] [INFO ] Invariant cache hit.
[2026-05-25 16:30:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 16:30:09] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2026-05-25 16:30:09] [INFO ] Flow matrix only has 130 transitions (discarded 16 similar events)
[2026-05-25 16:30:09] [INFO ] Invariant cache hit.
[2026-05-25 16:30:09] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 5/133 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Problem TDEAD24 is UNSAT
At refinement iteration 4 (OVERLAPS) 130/263 variables, 133/142 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 10/152 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 20/172 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 8/180 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 6/186 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 1/187 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 2/189 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 0/263 variables, 1/190 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 14 (OVERLAPS) 0/263 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 190 constraints, problems are : Problem set: 1 solved, 140 unsolved in 13235 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 133/133 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 5/133 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 37/47 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 130/263 variables, 133/180 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 10/190 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 140/330 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/330 constraints. Problems are: Problem set: 1 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/263 variables, 0/330 constraints. Problems are: Problem set: 1 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 330 constraints, problems are : Problem set: 1 solved, 140 unsolved in 10802 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 133/133 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 140/141 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24110ms problems are : Problem set: 1 solved, 140 unsolved
Search for dead transitions found 1 dead transitions in 24125ms
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 : 133/133 places, 145/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24397 ms. Remains : 133/133 places, 145/146 transitions.
Support contains 95 out of 133 places after structural reductions.
[2026-05-25 16:30:33] [INFO ] Flatten gal took : 18 ms
[2026-05-25 16:30:33] [INFO ] Flatten gal took : 16 ms
[2026-05-25 16:30:33] [INFO ] Input system was already deterministic with 145 transitions.
RANDOM walk for 40000 steps (144 resets) in 871 ms. (45 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (28 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
[2026-05-25 16:30:33] [INFO ] Flow matrix only has 129 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9205414731815681831.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14724598784457093471.kers'
[2026-05-25 16:30:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9205414731815681831.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14724598784457093471.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 129 rows 129 cols 437 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-25 16:30:33] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14724598784457093471.kers
Total runtime 1 ms.
[2026-05-25 16:30:33] [INFO ] State equation strengthened by 9 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 80/262 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/133 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
Computed a total of 133 stabilizing places and 145 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 133 transition count 145
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(F(p0)))'
Support contains 5 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 145/145 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 121 transition count 127
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 121 transition count 127
Applied a total of 24 rules in 7 ms. Remains 121 /133 variables (removed 12) and now considering 127/145 (removed 18) transitions.
[2026-05-25 16:30:33] [INFO ] Flow matrix only has 111 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9683268610708489286.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2917472664486879340.kers'
[2026-05-25 16:30:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9683268610708489286.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2917472664486879340.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 111 rows 117 cols 377 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-25 16:30:33] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2917472664486879340.kers
Total runtime 0 ms.
[2026-05-25 16:30:33] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 16:30:33] [INFO ] Flow matrix only has 111 transitions (discarded 16 similar events)
[2026-05-25 16:30:33] [INFO ] Invariant cache hit.
[2026-05-25 16:30:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-25 16:30:34] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2026-05-25 16:30:34] [INFO ] Flow matrix only has 111 transitions (discarded 16 similar events)
[2026-05-25 16:30:34] [INFO ] Invariant cache hit.
[2026-05-25 16:30:34] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 5/121 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 111/232 variables, 121/133 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/232 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 167 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6852 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 121/121 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 5/121 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 111/232 variables, 121/164 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 122/289 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/232 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 292 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8770 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 121/121 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15643ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 15644ms
Starting structural reductions in LTL mode, iteration 1 : 121/133 places, 127/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15861 ms. Remains : 121/133 places, 127/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLCardinality-06
Stuttering criterion allowed to conclude after 1703 steps with 12 reset in 18 ms.
FORMULA NeoElection-COL-5-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-5-LTLCardinality-06 finished in 16145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 5 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 145/145 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 121 transition count 127
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 121 transition count 127
Applied a total of 24 rules in 8 ms. Remains 121 /133 variables (removed 12) and now considering 127/145 (removed 18) transitions.
[2026-05-25 16:30:49] [INFO ] Flow matrix only has 111 transitions (discarded 16 similar events)
[2026-05-25 16:30:49] [INFO ] Invariant cache hit.
[2026-05-25 16:30:50] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 16:30:50] [INFO ] Flow matrix only has 111 transitions (discarded 16 similar events)
[2026-05-25 16:30:50] [INFO ] Invariant cache hit.
[2026-05-25 16:30:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-25 16:30:50] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 121/133 places, 127/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 121/133 places, 127/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : NeoElection-COL-5-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-5-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-5-LTLCardinality-09 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 10 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 145/145 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 116 transition count 122
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 116 transition count 122
Applied a total of 34 rules in 6 ms. Remains 116 /133 variables (removed 17) and now considering 122/145 (removed 23) transitions.
[2026-05-25 16:30:50] [INFO ] Flow matrix only has 106 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2188866973056043859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3252284337738508632.kers'
[2026-05-25 16:30:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2188866973056043859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3252284337738508632.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 106 rows 112 cols 367 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-25 16:30:50] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3252284337738508632.kers
Total runtime 1 ms.
[2026-05-25 16:30:50] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 16:30:50] [INFO ] Flow matrix only has 106 transitions (discarded 16 similar events)
[2026-05-25 16:30:50] [INFO ] Invariant cache hit.
[2026-05-25 16:30:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-25 16:30:50] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2026-05-25 16:30:50] [INFO ] Flow matrix only has 106 transitions (discarded 16 similar events)
[2026-05-25 16:30:50] [INFO ] Invariant cache hit.
[2026-05-25 16:30:50] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 106/222 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 154 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5834 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 106/222 variables, 116/151 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 117/271 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 271 constraints, problems are : Problem set: 0 solved, 117 unsolved in 6697 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12553ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 12554ms
Starting structural reductions in LTL mode, iteration 1 : 116/133 places, 122/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12708 ms. Remains : 116/133 places, 122/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NeoElection-COL-5-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-5-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-5-LTLCardinality-14 finished in 12899 ms.
All properties solved by simple procedures.
Total runtime 55828 ms.

BK_STOP 1779726663162

--------------------
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-5"
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-5, 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-177969913900171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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