Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876811900058.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-4, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876811900058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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 81K 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-4-CTLFireability-2025-00
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-01
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-02
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-03
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-04
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-05
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-06
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-07
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-08
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-09
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-10
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-11
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-12
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-13
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-14
FORMULA_NAME NeoElection-COL-4-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748795927071

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202505121319
[2025-06-01 16:38:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 16:38:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 16:38:48] [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:38:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 16:38:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 607 ms
[2025-06-01 16:38:49] [INFO ] Detected 6 constant HL places corresponding to 870 PT places.
[2025-06-01 16:38:49] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 1830 PT places and 3990.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
[2025-06-01 16:38:49] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2025-06-01 16:38:49] [INFO ] Skeletonized 5 HLPN properties in 1 ms. Removed 11 properties that had guard overlaps.
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 3 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.
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 250 steps (12 resets) in 9 ms. (25 steps per ms) remains 0/1 properties
[2025-06-01 16:38:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-01 16:38:49] [INFO ] Flatten gal took : 14 ms
[2025-06-01 16:38:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NeoElection-COL-4-CTLFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-CTLFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 16:38:49] [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(5), POS(4), M(5)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 4)]] 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:38:49] [INFO ] Unfolded HLPN to a Petri net with 1830 places and 1984 transitions 11141 arcs in 72 ms.
[2025-06-01 16:38:49] [INFO ] Unfolded 14 HLPN properties in 3 ms.
Deduced a syphon composed of 1687 places in 6 ms
Reduce places removed 1703 places and 1857 transitions.
Reduce places removed 5 places and 0 transitions.
FORMULA NeoElection-COL-4-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-CTLFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 110 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 127/127 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 110 transition count 127
Applied a total of 12 rules in 9 ms. Remains 110 /122 variables (removed 12) and now considering 127/127 (removed 0) transitions.
[2025-06-01 16:38:49] [INFO ] Flow matrix only has 118 transitions (discarded 9 similar events)
// Phase 1: matrix 118 rows 110 cols
[2025-06-01 16:38:49] [INFO ] Computed 23 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:49] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-01 16:38:49] [INFO ] Flow matrix only has 118 transitions (discarded 9 similar events)
[2025-06-01 16:38:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 16:38:49] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2025-06-01 16:38:49] [INFO ] Flow matrix only has 118 transitions (discarded 9 similar events)
[2025-06-01 16:38:49] [INFO ] Invariant cache hit.
[2025-06-01 16:38:49] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 4/110 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 6 (OVERLAPS) 118/228 variables, 110/133 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 18/151 constraints. Problems are: Problem set: 3 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:52] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:52] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:52] [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:38:52] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:52] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:52] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:52] [INFO ] Deduced a trap composed of 5 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:38:52] [INFO ] Deduced a trap composed of 5 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:38:53] [INFO ] Deduced a trap composed of 5 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:38:53] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:53] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:53] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:53] [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:38:53] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:53] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:53] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:53] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 17/168 constraints. Problems are: Problem set: 3 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:53] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:53] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 2/170 constraints. Problems are: Problem set: 3 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:54] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 1/171 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:56] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/228 variables, 1/172 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 172 constraints, problems are : Problem set: 3 solved, 120 unsolved in 9841 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 110/110 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 4/7 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 21/28 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/28 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 4/110 variables, 4/32 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 12/44 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 118/228 variables, 110/154 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 18/172 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 120/292 constraints. Problems are: Problem set: 3 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:02] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:02] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 2/294 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/294 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 0/228 variables, 0/294 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 294 constraints, problems are : Problem set: 3 solved, 120 unsolved in 12546 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 110/110 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 120/123 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22471ms problems are : Problem set: 3 solved, 120 unsolved
Search for dead transitions found 3 dead transitions in 22481ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/122 places, 124/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22826 ms. Remains : 110/122 places, 124/127 transitions.
Support contains 110 out of 110 places after structural reductions.
[2025-06-01 16:39:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-01 16:39:12] [INFO ] Flatten gal took : 33 ms
[2025-06-01 16:39:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA NeoElection-COL-4-CTLFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-CTLFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-CTLFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 16:39:12] [INFO ] Flatten gal took : 20 ms
[2025-06-01 16:39:12] [INFO ] Input system was already deterministic with 124 transitions.
Support contains 98 out of 110 places (down from 110) after GAL structural reductions.
FORMULA NeoElection-COL-4-CTLFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 309 steps (0 resets) in 55 ms. (5 steps per ms) remains 0/10 properties
[2025-06-01 16:39:12] [INFO ] Flatten gal took : 13 ms
[2025-06-01 16:39:12] [INFO ] Flatten gal took : 17 ms
[2025-06-01 16:39:12] [INFO ] Input system was already deterministic with 124 transitions.
Computed a total of 110 stabilizing places and 124 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110 transition count 124
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 124/124 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 105 transition count 113
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 105 transition count 113
Applied a total of 10 rules in 5 ms. Remains 105 /110 variables (removed 5) and now considering 113/124 (removed 11) transitions.
[2025-06-01 16:39:12] [INFO ] Flow matrix only has 104 transitions (discarded 9 similar events)
// Phase 1: matrix 104 rows 105 cols
[2025-06-01 16:39:12] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:39:12] [INFO ] Implicit Places using invariants in 56 ms returned [10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 29, 30, 31]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 59 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/110 places, 113/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 92/110 places, 113/124 transitions.
[2025-06-01 16:39:12] [INFO ] Flatten gal took : 9 ms
[2025-06-01 16:39:12] [INFO ] Flatten gal took : 10 ms
[2025-06-01 16:39:12] [INFO ] Input system was already deterministic with 113 transitions.
[2025-06-01 16:39:12] [INFO ] Flatten gal took : 10 ms
[2025-06-01 16:39:12] [INFO ] Flatten gal took : 10 ms
[2025-06-01 16:39:12] [INFO ] Time to serialize gal into /tmp/CTLFireability5396337090180455294.gal : 3 ms
[2025-06-01 16:39:12] [INFO ] Time to serialize properties into /tmp/CTLFireability10788142940139968198.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5396337090180455294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10788142940139968198.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.25291e+11,1.23821,46004,2,13256,5,197593,6,0,471,214617,0


Converting to forward existential form...Done !
original formula: EF(((AX(AX((((P_polling_1>=1)||(P_polling_4>=1))||((P_polling_2>=1)||(P_polling_3>=1))))) * ((((((AX(((((((((P_masterState_20>=1)&&(P_net...5909
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * (!(EX(!(!(EX(!((((P_polling_1>=1)||(P_polling_4>=1))||((P_polling_2>=1)||(P_polling_3...17166
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...401
Detected timeout of ITS tools.
[2025-06-01 16:39:42] [INFO ] Flatten gal took : 10 ms
[2025-06-01 16:39:42] [INFO ] Applying decomposition
[2025-06-01 16:39:42] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15235533447042467769.txt' '-o' '/tmp/graph15235533447042467769.bin' '-w' '/tmp/graph15235533447042467769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15235533447042467769.bin' '-l' '-1' '-v' '-w' '/tmp/graph15235533447042467769.weights' '-q' '0' '-e' '0.001'
[2025-06-01 16:39:42] [INFO ] Decomposing Gal with order
[2025-06-01 16:39:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 16:39:42] [INFO ] Removed a total of 26 redundant transitions.
[2025-06-01 16:39:42] [INFO ] Flatten gal took : 29 ms
[2025-06-01 16:39:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2025-06-01 16:39:42] [INFO ] Time to serialize gal into /tmp/CTLFireability17719249628727192470.gal : 3 ms
[2025-06-01 16:39:42] [INFO ] Time to serialize properties into /tmp/CTLFireability150139892497177173.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17719249628727192470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability150139892497177173.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.25291e+11,0.975836,37500,2133,3202,47115,30912,247,151313,209,92450,0


Converting to forward existential form...Done !
original formula: EF(((AX(AX((((i2.u7.P_polling_1>=1)||(i5.u6.P_polling_4>=1))||((i3.u8.P_polling_2>=1)||(i1.u5.P_polling_3>=1))))) * ((((((AX(((((((((i3.u...7232
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * (!(EX(!(!(EX(!((((i2.u7.P_polling_1>=1)||(i5.u6.P_polling_4>=1))||((i3.u8.P_polling_2...20991
Reverse transition relation is NOT exact ! Due to transitions t45, t48, t79, t82, t85, i1.u5.t2, i1.u5.t5, i1.u5.t7, i1.u5.t10, i1.u5.t95, i2.u7.t0, i2.u7....671
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 124/124 transitions.
Reduce places removed 4 places and 4 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 120
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 102 transition count 116
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 98 transition count 116
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 30 place count 80 transition count 69
Iterating global reduction 1 with 18 rules applied. Total rules applied 48 place count 80 transition count 69
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 76 transition count 65
Ensure Unique test removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 72 transition count 65
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 68 transition count 61
Ensure Unique test removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 64 place count 64 transition count 61
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 60 transition count 57
Applied a total of 68 rules in 34 ms. Remains 60 /110 variables (removed 50) and now considering 57/124 (removed 67) transitions.
[2025-06-01 16:40:13] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 60 cols
[2025-06-01 16:40:13] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:40:13] [INFO ] Implicit Places using invariants in 56 ms returned [6, 7, 8, 9]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 57 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 56/110 places, 57/124 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 57/57 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 95 ms. Remains : 56/110 places, 57/124 transitions.
[2025-06-01 16:40:13] [INFO ] Flatten gal took : 4 ms
[2025-06-01 16:40:13] [INFO ] Flatten gal took : 4 ms
[2025-06-01 16:40:13] [INFO ] Input system was already deterministic with 57 transitions.
RANDOM walk for 48 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
FORMULA NeoElection-COL-4-CTLFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-01 16:40:13] [INFO ] Flatten gal took : 4 ms
[2025-06-01 16:40:13] [INFO ] Flatten gal took : 3 ms
[2025-06-01 16:40:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15262081788110179310.gal : 1 ms
[2025-06-01 16:40:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16478744544567055213.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15262081788110179310.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16478744544567055213.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 124/124 transitions.
Reduce places removed 4 places and 4 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 120
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 102 transition count 116
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 98 transition count 116
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 21 place count 89 transition count 101
Iterating global reduction 1 with 9 rules applied. Total rules applied 30 place count 89 transition count 101
Applied a total of 30 rules in 8 ms. Remains 89 /110 variables (removed 21) and now considering 101/124 (removed 23) transitions.
[2025-06-01 16:40:13] [INFO ] Flow matrix only has 92 transitions (discarded 9 similar events)
// Phase 1: matrix 92 rows 89 cols
[2025-06-01 16:40:13] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:40:13] [INFO ] Implicit Places using invariants in 44 ms returned [7, 9, 12, 14, 17, 19, 21, 22, 23]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 46 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 80/110 places, 101/124 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 58 ms. Remains : 80/110 places, 101/124 transitions.
[2025-06-01 16:40:13] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:40:13] [INFO ] Flatten gal took : 7 ms
[2025-06-01 16:40:13] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-01 16:40:13] [INFO ] Flatten gal took : 8 ms
[2025-06-01 16:40:13] [INFO ] Flatten gal took : 7 ms
[2025-06-01 16:40:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4319157750412958275.gal : 1 ms
[2025-06-01 16:40:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6544666732370243783.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4319157750412958275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6544666732370243783.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.47515e+10,0.383102,21488,2,6390,5,91338,6,0,411,84693,0


Converting to forward existential form...Done !
original formula: EG(((AF(((((((((P_masterState_20<1)||(P_network_390<1))||(P_poll__handlingMessage_2<1))&&(((P_masterState_10<1)||(P_network_210<1))||(P_p...5938
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!(((((((((P_masterState_20<1)||(P_network_390<1))||(P_poll__handlingMessage_2<1))&&(((P_master...5993
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...381
(forward)formula 0,1,11.2928,361132,1,0,529,2.13265e+06,231,195,3450,1.94831e+06,498
FORMULA NeoElection-COL-4-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 124/124 transitions.
Reduce places removed 4 places and 4 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 120
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 102 transition count 116
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 98 transition count 116
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 21 place count 89 transition count 90
Iterating global reduction 1 with 9 rules applied. Total rules applied 30 place count 89 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 30 place count 89 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 88 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 87 transition count 88
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 86 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 85 transition count 87
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 84 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 83 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 82 transition count 86
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 38 place count 82 transition count 83
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 44 place count 79 transition count 83
Applied a total of 44 rules in 24 ms. Remains 79 /110 variables (removed 31) and now considering 83/124 (removed 41) transitions.
[2025-06-01 16:40:24] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 79 cols
[2025-06-01 16:40:24] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:40:24] [INFO ] Implicit Places using invariants in 46 ms returned [6, 8, 10, 13, 15, 18, 20]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 47 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 72/110 places, 83/124 transitions.
Applied a total of 0 rules in 3 ms. Remains 72 /72 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 75 ms. Remains : 72/110 places, 83/124 transitions.
[2025-06-01 16:40:24] [INFO ] Flatten gal took : 5 ms
[2025-06-01 16:40:24] [INFO ] Flatten gal took : 5 ms
[2025-06-01 16:40:24] [INFO ] Input system was already deterministic with 83 transitions.
[2025-06-01 16:40:24] [INFO ] Flatten gal took : 4 ms
[2025-06-01 16:40:24] [INFO ] Flatten gal took : 5 ms
[2025-06-01 16:40:24] [INFO ] Time to serialize gal into /tmp/CTLFireability3480043382252708510.gal : 0 ms
[2025-06-01 16:40:24] [INFO ] Time to serialize properties into /tmp/CTLFireability17577852943014817242.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3480043382252708510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17577852943014817242.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.96642e+09,0.164515,11796,2,2973,5,41666,6,0,359,40590,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((((P_negotiation_52>=1)&&(P_network_495>=1))&&(P_poll__handlingMessage_3>=1))||(((P_negotiation_52>=1)&&(P_network_525>=1))&&(...1480
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((P_negotiation_52>=1)&&(P_network_495>=1))&&(P_poll__handlingMessage_3>=1)...1540
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...320
(forward)formula 0,0,1.40457,59016,1,0,216,358163,187,90,2607,307451,180
FORMULA NeoElection-COL-4-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 124/124 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 110 transition count 120
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 106 transition count 120
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 17 place count 97 transition count 105
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 97 transition count 105
Applied a total of 26 rules in 7 ms. Remains 97 /110 variables (removed 13) and now considering 105/124 (removed 19) transitions.
[2025-06-01 16:40:26] [INFO ] Flow matrix only has 96 transitions (discarded 9 similar events)
// Phase 1: matrix 96 rows 97 cols
[2025-06-01 16:40:26] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:40:26] [INFO ] Implicit Places using invariants in 48 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 96/110 places, 105/124 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 60 ms. Remains : 96/110 places, 105/124 transitions.
[2025-06-01 16:40:26] [INFO ] Flatten gal took : 7 ms
[2025-06-01 16:40:26] [INFO ] Flatten gal took : 7 ms
[2025-06-01 16:40:26] [INFO ] Input system was already deterministic with 105 transitions.
[2025-06-01 16:40:26] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:40:26] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:40:26] [INFO ] Time to serialize gal into /tmp/CTLFireability480939740426895197.gal : 1 ms
[2025-06-01 16:40:26] [INFO ] Time to serialize properties into /tmp/CTLFireability5538029088953096845.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability480939740426895197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5538029088953096845.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.47532e+10,0.617386,28716,2,8976,5,133300,6,0,467,118276,0


Converting to forward existential form...Done !
original formula: EF((EG((((((((((P_masterState_20<1)||(P_network_390<1))||(P_poll__handlingMessage_2<1))&&(((P_masterState_10<1)||(P_network_210<1))||(P_p...5968
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(((((((((P_masterState_20<1)||(P_network_390<1))||(P_poll__handlingMessage_2<1))&&(((P_ma...6047
Hit Full ! (commute/partial/dont) 0/544/105
(forward)formula 0,1,14.1114,443004,1,0,123,2.38406e+06,18,2,2905,2.14357e+06,123
FORMULA NeoElection-COL-4-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 124/124 transitions.
Reduce places removed 4 places and 4 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 120
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 102 transition count 116
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 98 transition count 116
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 21 place count 89 transition count 90
Iterating global reduction 1 with 9 rules applied. Total rules applied 30 place count 89 transition count 90
Applied a total of 30 rules in 8 ms. Remains 89 /110 variables (removed 21) and now considering 90/124 (removed 34) transitions.
[2025-06-01 16:40:40] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
// Phase 1: matrix 81 rows 89 cols
[2025-06-01 16:40:40] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:40:40] [INFO ] Implicit Places using invariants in 63 ms returned [6, 7, 8, 10, 12, 15, 17, 20, 22]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 78 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 80/110 places, 90/124 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 89 ms. Remains : 80/110 places, 90/124 transitions.
[2025-06-01 16:40:40] [INFO ] Flatten gal took : 5 ms
[2025-06-01 16:40:40] [INFO ] Flatten gal took : 5 ms
[2025-06-01 16:40:40] [INFO ] Input system was already deterministic with 90 transitions.
[2025-06-01 16:40:40] [INFO ] Flatten gal took : 5 ms
[2025-06-01 16:40:40] [INFO ] Flatten gal took : 4 ms
[2025-06-01 16:40:40] [INFO ] Time to serialize gal into /tmp/CTLFireability6358197894031024826.gal : 1 ms
[2025-06-01 16:40:40] [INFO ] Time to serialize properties into /tmp/CTLFireability4186545338564126188.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6358197894031024826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4186545338564126188.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.47515e+10,0.262143,15704,2,4932,5,65561,6,0,400,52872,0


Converting to forward existential form...Done !
original formula: AF(((((((((P_negotiation_52<1)||(P_network_495<1))||(P_poll__handlingMessage_3<1))&&(((P_negotiation_52<1)||(P_network_525<1))||(P_poll__...3048
=> equivalent forward existential formula: [FwdG(Init,!(((((((((P_negotiation_52<1)||(P_network_495<1))||(P_poll__handlingMessage_3<1))&&(((P_negotiation_5...3093
Hit Full ! (commute/partial/dont) 0/0/90
(forward)formula 0,1,7.44359,247240,1,0,120,1.44522e+06,19,4,2427,1.13431e+06,119
FORMULA NeoElection-COL-4-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 124/124 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 92 transition count 77
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 92 transition count 77
Applied a total of 36 rules in 3 ms. Remains 92 /110 variables (removed 18) and now considering 77/124 (removed 47) transitions.
[2025-06-01 16:40:48] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
// Phase 1: matrix 68 rows 92 cols
[2025-06-01 16:40:48] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:40:48] [INFO ] Implicit Places using invariants in 124 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 125 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/110 places, 77/124 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 76/110 places, 77/124 transitions.
[2025-06-01 16:40:48] [INFO ] Flatten gal took : 4 ms
[2025-06-01 16:40:48] [INFO ] Flatten gal took : 3 ms
[2025-06-01 16:40:48] [INFO ] Input system was already deterministic with 77 transitions.
[2025-06-01 16:40:48] [INFO ] Flatten gal took : 3 ms
[2025-06-01 16:40:48] [INFO ] Flatten gal took : 3 ms
[2025-06-01 16:40:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8683693893212166162.gal : 1 ms
[2025-06-01 16:40:48] [INFO ] Time to serialize properties into /tmp/CTLFireability11048159016788280131.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8683693893212166162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11048159016788280131.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46438e+10,0.586748,20676,2,6455,5,82930,6,0,371,81554,0


Converting to forward existential form...Done !
original formula: E(E(EX((((P_electionInit_1>=1)||(P_electionInit_2>=1))||((P_electionInit_3>=1)||(P_electionInit_4>=1)))) U (AG(AX(FALSE)) + AX(FALSE))) U...233
=> equivalent forward existential formula: [(FwdU(Init,E(EX((((P_electionInit_1>=1)||(P_electionInit_2>=1))||((P_electionInit_3>=1)||(P_electionInit_4>=1))...303
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t11, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t69, t70, t71,...259
(forward)formula 0,0,3.79302,96864,1,0,187,511628,183,87,2531,546776,181
FORMULA NeoElection-COL-4-CTLFireability-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 16:40:52] [INFO ] Flatten gal took : 12 ms
[2025-06-01 16:40:52] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:40:52] [INFO ] Applying decomposition
[2025-06-01 16:40:52] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11496155139710732350.txt' '-o' '/tmp/graph11496155139710732350.bin' '-w' '/tmp/graph11496155139710732350.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11496155139710732350.bin' '-l' '-1' '-v' '-w' '/tmp/graph11496155139710732350.weights' '-q' '0' '-e' '0.001'
[2025-06-01 16:40:52] [INFO ] Decomposing Gal with order
[2025-06-01 16:40:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 16:40:52] [INFO ] Removed a total of 16 redundant transitions.
[2025-06-01 16:40:52] [INFO ] Flatten gal took : 12 ms
[2025-06-01 16:40:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2025-06-01 16:40:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2402651355766624583.gal : 2 ms
[2025-06-01 16:40:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4612449116268586402.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2402651355766624583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4612449116268586402.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.91912e+11,1.31832,44960,1501,3588,43372,53484,237,159777,235,237377,0


Converting to forward existential form...Done !
original formula: EF(((AX(AX((((i4.u7.P_polling_1>=1)||(i3.u9.P_polling_4>=1))||((i2.u8.P_polling_2>=1)||(i1.u6.P_polling_3>=1))))) * ((((((AX(((((((((i2.u...7230
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * (!(EX(!(!(EX(!((((i4.u7.P_polling_1>=1)||(i3.u9.P_polling_4>=1))||((i2.u8.P_polling_2...20985
Reverse transition relation is NOT exact ! Due to transitions i1.u6.t2, i1.u6.t5, i1.u6.t6, i1.u6.t10, i1.u6.t11, i1.u6.t20, i1.u6.t21, i1.u6.t106, i2.u8.t...771
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-06-01 16:42:43] [INFO ] Applying decomposition
[2025-06-01 16:42:43] [INFO ] Flatten gal took : 8 ms
[2025-06-01 16:42:43] [INFO ] Decomposing Gal with order
[2025-06-01 16:42:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 16:42:43] [INFO ] Removed a total of 245 redundant transitions.
[2025-06-01 16:42:43] [INFO ] Flatten gal took : 24 ms
[2025-06-01 16:42:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 16:42:43] [INFO ] Time to serialize gal into /tmp/CTLFireability2788369755288616814.gal : 2 ms
[2025-06-01 16:42:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3827569994793654116.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2788369755288616814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3827569994793654116.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.91912e+11,1.50504,55452,10623,16,140385,388,325,131334,22,302,0


Converting to forward existential form...Done !
original formula: EF(((AX(AX((((M1.P_polling_1>=1)||(M4.P_polling_4>=1))||((M2.P_polling_2>=1)||(M3.P_polling_3>=1))))) * ((((((AX(((((((((MBOOLM20.P_maste...7574
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * (!(EX(!(!(EX(!((((M1.P_polling_1>=1)||(M4.P_polling_4>=1))||((M2.P_polling_2>=1)||(M3...22059
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...447
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,73.3221,3089040,1,0,8.50754e+06,388,3189,9.62953e+06,93,302,16335967
FORMULA NeoElection-COL-4-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Total runtime 309575 ms.

BK_STOP 1748796237891

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -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-4"
export BK_EXAMINATION="CTLFireability"
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-4, examination is CTLFireability"
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-174876811900058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-4.tgz
mv NeoElection-COL-4 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;