Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876811900068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is NeoElection-COL-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876811900068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 89K May 29 14:32 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-LTLFireability-00
FORMULA_NAME NeoElection-COL-5-LTLFireability-01
FORMULA_NAME NeoElection-COL-5-LTLFireability-02
FORMULA_NAME NeoElection-COL-5-LTLFireability-03
FORMULA_NAME NeoElection-COL-5-LTLFireability-04
FORMULA_NAME NeoElection-COL-5-LTLFireability-05
FORMULA_NAME NeoElection-COL-5-LTLFireability-06
FORMULA_NAME NeoElection-COL-5-LTLFireability-07
FORMULA_NAME NeoElection-COL-5-LTLFireability-08
FORMULA_NAME NeoElection-COL-5-LTLFireability-09
FORMULA_NAME NeoElection-COL-5-LTLFireability-10
FORMULA_NAME NeoElection-COL-5-LTLFireability-11
FORMULA_NAME NeoElection-COL-5-LTLFireability-12
FORMULA_NAME NeoElection-COL-5-LTLFireability-13
FORMULA_NAME NeoElection-COL-5-LTLFireability-14
FORMULA_NAME NeoElection-COL-5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748796217195

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability COL
Running Version 202505121319
[2025-06-01 16:43:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 16:43:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 16:43:38] [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.
[2025-06-01 16:43:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 16:43:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 595 ms
[2025-06-01 16:43:39] [INFO ] Detected 6 constant HL places corresponding to 1500 PT places.
[2025-06-01 16:43:39] [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/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2025-06-01 16:43:39] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 6 ms.
[2025-06-01 16:43:39] [INFO ] Skeletonized 10 HLPN properties in 1 ms. Removed 6 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-5-LTLFireability-04 FALSE 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 8 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-5-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 155 steps (4 resets) in 10 ms. (14 steps per ms) remains 0/4 properties
[2025-06-01 16:43:39] [INFO ] Flatten gal took : 20 ms
[2025-06-01 16:43:39] [INFO ] Flatten gal took : 2 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.
[2025-06-01 16:43:39] [INFO ] Unfolded HLPN to a Petri net with 3090 places and 4024 transitions 22762 arcs in 111 ms.
[2025-06-01 16:43:39] [INFO ] Unfolded 14 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2866 places in 22 ms
Reduce places removed 2891 places and 3788 transitions.
Reduce places removed 6 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-5-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 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 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 47 place count 146 transition count 128
Iterating global reduction 1 with 27 rules applied. Total rules applied 74 place count 146 transition count 128
Applied a total of 74 rules in 19 ms. Remains 146 /193 variables (removed 47) and now considering 128/236 (removed 108) transitions.
[2025-06-01 16:43:39] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
// Phase 1: matrix 112 rows 146 cols
[2025-06-01 16:43:39] [INFO ] Computed 34 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:43:39] [INFO ] Implicit Places using invariants in 221 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 248 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/193 places, 128/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 277 ms. Remains : 121/193 places, 128/236 transitions.
Support contains 68 out of 121 places after structural reductions.
[2025-06-01 16:43:39] [INFO ] Flatten gal took : 18 ms
[2025-06-01 16:43:39] [INFO ] Flatten gal took : 14 ms
[2025-06-01 16:43:39] [INFO ] Input system was already deterministic with 128 transitions.
RANDOM walk for 136 steps (0 resets) in 21 ms. (6 steps per ms) remains 0/5 properties
Computed a total of 121 stabilizing places and 128 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 121 transition count 128
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(F(p1))))&&p0)))'
Support contains 38 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-06-01 16:43:40] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
// Phase 1: matrix 112 rows 121 cols
[2025-06-01 16:43:40] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:43:40] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-01 16:43:40] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
[2025-06-01 16:43:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:43:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 16:43:40] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2025-06-01 16:43:40] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
[2025-06-01 16:43:40] [INFO ] Invariant cache hit.
[2025-06-01 16:43:40] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 5/121 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 112/233 variables, 121/130 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/134 constraints. Problems are: Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:42] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:42] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:42] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:42] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:42] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:43] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:43] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:43] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:43] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:43] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:43] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:43] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:43] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:43] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:43] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:44] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:44] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:44] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:44] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 20/154 constraints. Problems are: Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:44] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:44] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:44] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:44] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:44] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:44] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:45] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:45] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:45] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 10/164 constraints. Problems are: Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:45] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:45] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:45] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:45] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:45] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:45] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 6/170 constraints. Problems are: Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:46] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:46] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:46] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:46] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 4/174 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/233 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 174 constraints, problems are : Problem set: 1 solved, 122 unsolved in 8818 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 5/121 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 39/49 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 112/233 variables, 121/170 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 4/174 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 122/296 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/233 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 296 constraints, problems are : Problem set: 1 solved, 122 unsolved in 7914 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 122/123 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16814ms problems are : Problem set: 1 solved, 122 unsolved
Search for dead transitions found 1 dead transitions in 16830ms
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 : 121/121 places, 127/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 121 /121 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17014 ms. Remains : 121/121 places, 127/128 transitions.
Stuttering acceptance computed with spot in 315 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-01
Product exploration explored 100000 steps with 20000 reset in 241 ms.
Product exploration explored 100000 steps with 20000 reset in 194 ms.
Computed a total of 121 stabilizing places and 127 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 121 transition count 127
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (X p0), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-5-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-5-LTLFireability-01 finished in 17889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 128/128 transitions.
Reduce places removed 5 places and 5 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 116 transition count 118
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 111 transition count 118
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 40 place count 96 transition count 103
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 45 place count 91 transition count 98
Applied a total of 45 rules in 39 ms. Remains 91 /121 variables (removed 30) and now considering 98/128 (removed 30) transitions.
[2025-06-01 16:43:58] [INFO ] Flow matrix only has 82 transitions (discarded 16 similar events)
// Phase 1: matrix 82 rows 91 cols
[2025-06-01 16:43:58] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:43:58] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-01 16:43:58] [INFO ] Flow matrix only has 82 transitions (discarded 16 similar events)
[2025-06-01 16:43:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:43:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-01 16:43:58] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:43:58] [INFO ] Redundant transitions in 2 ms returned []
Running 93 sub problems to find dead transitions.
[2025-06-01 16:43:58] [INFO ] Flow matrix only has 82 transitions (discarded 16 similar events)
[2025-06-01 16:43:58] [INFO ] Invariant cache hit.
[2025-06-01 16:43:58] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 5/91 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:58] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Problem TDEAD69 is UNSAT
At refinement iteration 5 (OVERLAPS) 82/173 variables, 91/101 constraints. Problems are: Problem set: 1 solved, 92 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 72/173 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/173 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 173 constraints, problems are : Problem set: 1 solved, 92 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 91/91 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 5/91 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 82/173 variables, 91/101 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 72/173 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 92/265 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/173 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 265 constraints, problems are : Problem set: 1 solved, 92 unsolved in 2414 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 91/91 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 92/93 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4388ms problems are : Problem set: 1 solved, 92 unsolved
Search for dead transitions found 1 dead transitions in 4389ms
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 SI_LTL mode, iteration 1 : 91/121 places, 97/128 transitions.
Applied a total of 0 rules in 10 ms. Remains 91 /91 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:44:02] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 4674 ms. Remains : 91/121 places, 97/128 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-03
Product exploration explored 100000 steps with 4585 reset in 308 ms.
Product exploration explored 100000 steps with 4602 reset in 353 ms.
Computed a total of 91 stabilizing places and 97 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 91 transition count 97
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-5-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-5-LTLFireability-03 finished in 5501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 128/128 transitions.
Reduce places removed 5 places and 5 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 116 transition count 118
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 111 transition count 118
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 50 place count 91 transition count 98
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 55 place count 86 transition count 93
Applied a total of 55 rules in 20 ms. Remains 86 /121 variables (removed 35) and now considering 93/128 (removed 35) transitions.
[2025-06-01 16:44:03] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2025-06-01 16:44:03] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:44:03] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-01 16:44:03] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
[2025-06-01 16:44:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:44:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 16:44:03] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:44:03] [INFO ] Redundant transitions in 2 ms returned []
Running 73 sub problems to find dead transitions.
[2025-06-01 16:44:03] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
[2025-06-01 16:44:03] [INFO ] Invariant cache hit.
[2025-06-01 16:44:03] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 77/159 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Problem TDEAD64 is UNSAT
At refinement iteration 5 (OVERLAPS) 4/163 variables, 4/99 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 99 constraints, problems are : Problem set: 1 solved, 72 unsolved in 2017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 77/159 variables, 82/91 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 4/95 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 72/167 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 4/163 variables, 4/171 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 171 constraints, problems are : Problem set: 1 solved, 72 unsolved in 2616 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 72/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4650ms problems are : Problem set: 1 solved, 72 unsolved
Search for dead transitions found 1 dead transitions in 4650ms
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 SI_LTL mode, iteration 1 : 86/121 places, 92/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:44:08] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 4850 ms. Remains : 86/121 places, 92/128 transitions.
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-06
Stuttering criterion allowed to conclude after 162 steps with 1 reset in 3 ms.
FORMULA NeoElection-COL-5-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-5-LTLFireability-06 finished in 4931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 25 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 128/128 transitions.
Reduce places removed 5 places and 5 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 116 transition count 118
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 111 transition count 118
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 106 transition count 113
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 106 transition count 113
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 50 place count 91 transition count 98
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 55 place count 86 transition count 93
Applied a total of 55 rules in 15 ms. Remains 86 /121 variables (removed 35) and now considering 93/128 (removed 35) transitions.
[2025-06-01 16:44:08] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2025-06-01 16:44:08] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:44:08] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-01 16:44:08] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
[2025-06-01 16:44:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:44:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 16:44:08] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:44:08] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2025-06-01 16:44:08] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
[2025-06-01 16:44:08] [INFO ] Invariant cache hit.
[2025-06-01 16:44:08] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD7 is UNSAT
At refinement iteration 4 (OVERLAPS) 77/163 variables, 86/95 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 4/99 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 99 constraints, problems are : Problem set: 1 solved, 87 unsolved in 2011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 77/163 variables, 86/95 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 4/99 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 87/186 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 186 constraints, problems are : Problem set: 1 solved, 87 unsolved in 2495 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 87/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4536ms problems are : Problem set: 1 solved, 87 unsolved
Search for dead transitions found 1 dead transitions in 4538ms
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 SI_LTL mode, iteration 1 : 86/121 places, 92/128 transitions.
Applied a total of 0 rules in 9 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:44:13] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 4706 ms. Remains : 86/121 places, 92/128 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-09
Product exploration explored 100000 steps with 602 reset in 397 ms.
Product exploration explored 100000 steps with 602 reset in 384 ms.
Computed a total of 86 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 92
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-5-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-5-LTLFireability-09 finished in 5616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(!p1))&&(F(!p2)||X(!p1))))'
Support contains 35 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-06-01 16:44:14] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
// Phase 1: matrix 112 rows 121 cols
[2025-06-01 16:44:14] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:44:14] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-01 16:44:14] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
[2025-06-01 16:44:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:44:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 16:44:14] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2025-06-01 16:44:14] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
[2025-06-01 16:44:14] [INFO ] Invariant cache hit.
[2025-06-01 16:44:14] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 5/121 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 112/233 variables, 121/130 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/134 constraints. Problems are: Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:15] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:15] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:15] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:15] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 20/154 constraints. Problems are: Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:18] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 10/164 constraints. Problems are: Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:18] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:18] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:18] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:18] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:18] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:18] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 6/170 constraints. Problems are: Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:19] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:19] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:19] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:19] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 4/174 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/233 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 174 constraints, problems are : Problem set: 1 solved, 122 unsolved in 7789 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 5/121 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 39/49 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 112/233 variables, 121/170 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 4/174 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 122/296 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/233 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 296 constraints, problems are : Problem set: 1 solved, 122 unsolved in 7809 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 122/123 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15618ms problems are : Problem set: 1 solved, 122 unsolved
Search for dead transitions found 1 dead transitions in 15618ms
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 : 121/121 places, 127/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15761 ms. Remains : 121/121 places, 127/128 transitions.
Stuttering acceptance computed with spot in 186 ms :[p1, p1, p1, (AND p2 p1), true, p2]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-5-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-5-LTLFireability-13 finished in 15966 ms.
All properties solved by simple procedures.
Total runtime 51620 ms.

BK_STOP 1748796270391

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="LTLFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-5, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876811900068"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;