Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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 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 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K 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 120K 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-8-LTLCardinality-00
FORMULA_NAME NeoElection-COL-8-LTLCardinality-01
FORMULA_NAME NeoElection-COL-8-LTLCardinality-02
FORMULA_NAME NeoElection-COL-8-LTLCardinality-03
FORMULA_NAME NeoElection-COL-8-LTLCardinality-04
FORMULA_NAME NeoElection-COL-8-LTLCardinality-05
FORMULA_NAME NeoElection-COL-8-LTLCardinality-06
FORMULA_NAME NeoElection-COL-8-LTLCardinality-07
FORMULA_NAME NeoElection-COL-8-LTLCardinality-08
FORMULA_NAME NeoElection-COL-8-LTLCardinality-09
FORMULA_NAME NeoElection-COL-8-LTLCardinality-10
FORMULA_NAME NeoElection-COL-8-LTLCardinality-11
FORMULA_NAME NeoElection-COL-8-LTLCardinality-12
FORMULA_NAME NeoElection-COL-8-LTLCardinality-13
FORMULA_NAME NeoElection-COL-8-LTLCardinality-14
FORMULA_NAME NeoElection-COL-8-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748803086132

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-8
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-01 18:38:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 18:38:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 18:38:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-01 18:38:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 18:38:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 601 ms
[2025-06-01 18:38:08] [INFO ] Detected 6 constant HL places corresponding to 5058 PT places.
[2025-06-01 18:38:08] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 10062 PT places and 34578.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2025-06-01 18:38:08] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2025-06-01 18:38:08] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA NeoElection-COL-8-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-14 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 13 properties that can be checked using skeleton over-approximation.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-8-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40009 steps (848 resets) in 278 ms. (143 steps per ms) remains 1/7 properties
BEST_FIRST walk for 1044 steps (0 resets) in 8 ms. (116 steps per ms) remains 0/1 properties
[2025-06-01 18:38:08] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2025-06-01 18:38:08] [INFO ] Flatten gal took : 12 ms
[2025-06-01 18:38:08] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA NeoElection-COL-8-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 18:38:08] [INFO ] Flatten gal took : 2 ms
Domain [M(9), POS(8), M(9)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 8)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-01 18:38:08] [INFO ] Unfolded HLPN to a Petri net with 10062 places and 19858 transitions 113083 arcs in 229 ms.
[2025-06-01 18:38:08] [INFO ] Unfolded 3 HLPN properties in 1 ms.
Deduced a syphon composed of 9487 places in 47 ms
Reduce places removed 9551 places and 18965 transitions.
Reduce places removed 9 places and 0 transitions.
Support contains 24 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 893/893 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 446 transition count 893
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 154 place count 348 transition count 318
Iterating global reduction 1 with 98 rules applied. Total rules applied 252 place count 348 transition count 318
Applied a total of 252 rules in 54 ms. Remains 348 /502 variables (removed 154) and now considering 318/893 (removed 575) transitions.
[2025-06-01 18:38:08] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
// Phase 1: matrix 269 rows 348 cols
[2025-06-01 18:38:08] [INFO ] Computed 79 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:38:09] [INFO ] Implicit Places using invariants in 469 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 497 ms to find 64 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 284/502 places, 318/893 transitions.
Applied a total of 0 rules in 9 ms. Remains 284 /284 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 569 ms. Remains : 284/502 places, 318/893 transitions.
Support contains 24 out of 284 places after structural reductions.
[2025-06-01 18:38:09] [INFO ] Flatten gal took : 39 ms
[2025-06-01 18:38:09] [INFO ] Flatten gal took : 33 ms
[2025-06-01 18:38:09] [INFO ] Input system was already deterministic with 318 transitions.
RANDOM walk for 2972 steps (0 resets) in 129 ms. (22 steps per ms) remains 0/4 properties
Computed a total of 284 stabilizing places and 318 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 284 transition count 318
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' '!(F(G(p0)))'
Support contains 8 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 318/318 transitions.
Reduce places removed 8 places and 8 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 276 transition count 302
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 268 transition count 302
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 112 place count 220 transition count 254
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 212 transition count 246
Applied a total of 120 rules in 50 ms. Remains 212 /284 variables (removed 72) and now considering 246/318 (removed 72) transitions.
[2025-06-01 18:38:09] [INFO ] Flow matrix only has 197 transitions (discarded 49 similar events)
// Phase 1: matrix 197 rows 212 cols
[2025-06-01 18:38:09] [INFO ] Computed 15 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:38:09] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-01 18:38:09] [INFO ] Flow matrix only has 197 transitions (discarded 49 similar events)
[2025-06-01 18:38:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:38:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 18:38:10] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:38:10] [INFO ] Redundant transitions in 9 ms returned []
Running 238 sub problems to find dead transitions.
[2025-06-01 18:38:10] [INFO ] Flow matrix only has 197 transitions (discarded 49 similar events)
[2025-06-01 18:38:10] [INFO ] Invariant cache hit.
[2025-06-01 18:38:10] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Problem TDEAD13 is UNSAT
At refinement iteration 4 (OVERLAPS) 197/409 variables, 212/227 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 7/234 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/409 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 234 constraints, problems are : Problem set: 1 solved, 237 unsolved in 11591 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 212/212 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 197/409 variables, 212/227 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 7/234 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 237/471 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/471 constraints. Problems are: Problem set: 1 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/409 variables, 0/471 constraints. Problems are: Problem set: 1 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 471 constraints, problems are : Problem set: 1 solved, 237 unsolved in 14398 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 212/212 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 237/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26112ms problems are : Problem set: 1 solved, 237 unsolved
Search for dead transitions found 1 dead transitions in 26123ms
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 : 212/284 places, 245/318 transitions.
Applied a total of 0 rules in 9 ms. Remains 212 /212 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:38:36] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 26573 ms. Remains : 212/284 places, 245/318 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-8-LTLCardinality-01
Product exploration explored 100000 steps with 218 reset in 594 ms.
Product exploration explored 100000 steps with 218 reset in 466 ms.
Computed a total of 212 stabilizing places and 245 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 212 transition count 245
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 1766 steps (0 resets) in 30 ms. (56 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2025-06-01 18:38:38] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
// Phase 1: matrix 196 rows 212 cols
[2025-06-01 18:38:38] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:38:38] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 18:38:38] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2025-06-01 18:38:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:38:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2025-06-01 18:38:38] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2025-06-01 18:38:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 18:38:38] [INFO ] [Nat]Added 6 Read/Feed constraints in 28 ms returned sat
[2025-06-01 18:38:38] [INFO ] Computed and/alt/rep : 237/487/188 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-01 18:38:39] [INFO ] Added : 168 causal constraints over 34 iterations in 1312 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 245/245 transitions.
Applied a total of 0 rules in 11 ms. Remains 212 /212 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2025-06-01 18:38:39] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2025-06-01 18:38:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:38:40] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-01 18:38:40] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2025-06-01 18:38:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:38:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 18:38:40] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:38:40] [INFO ] Redundant transitions in 2 ms returned []
Running 237 sub problems to find dead transitions.
[2025-06-01 18:38:40] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2025-06-01 18:38:40] [INFO ] Invariant cache hit.
[2025-06-01 18:38:40] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 196/408 variables, 212/228 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 234 constraints, problems are : Problem set: 0 solved, 237 unsolved in 11417 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 196/408 variables, 212/228 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 237/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 471 constraints, problems are : Problem set: 0 solved, 237 unsolved in 14368 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25861ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 25865ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26167 ms. Remains : 212/212 places, 245/245 transitions.
Computed a total of 212 stabilizing places and 245 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 212 transition count 245
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 1698 steps (0 resets) in 21 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2025-06-01 18:39:06] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2025-06-01 18:39:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:39:06] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 18:39:06] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-06-01 18:39:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:39:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 18:39:07] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-06-01 18:39:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 18:39:07] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2025-06-01 18:39:07] [INFO ] Computed and/alt/rep : 237/487/188 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 18:39:07] [INFO ] Added : 164 causal constraints over 33 iterations in 831 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 218 reset in 423 ms.
Product exploration explored 100000 steps with 218 reset in 464 ms.
Built C files in :
/tmp/ltsmin11412879819819574738
[2025-06-01 18:39:08] [INFO ] Computing symmetric may disable matrix : 245 transitions.
[2025-06-01 18:39:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:39:08] [INFO ] Computing symmetric may enable matrix : 245 transitions.
[2025-06-01 18:39:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:39:08] [INFO ] Computing Do-Not-Accords matrix : 245 transitions.
[2025-06-01 18:39:08] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:39:08] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11412879819819574738
Running compilation step : cd /tmp/ltsmin11412879819819574738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 628 ms.
Running link step : cd /tmp/ltsmin11412879819819574738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin11412879819819574738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17711712555468316851.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 245/245 transitions.
Applied a total of 0 rules in 15 ms. Remains 212 /212 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2025-06-01 18:39:24] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2025-06-01 18:39:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:39:24] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-01 18:39:24] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2025-06-01 18:39:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:39:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 18:39:24] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:39:24] [INFO ] Redundant transitions in 1 ms returned []
Running 237 sub problems to find dead transitions.
[2025-06-01 18:39:24] [INFO ] Flow matrix only has 196 transitions (discarded 49 similar events)
[2025-06-01 18:39:24] [INFO ] Invariant cache hit.
[2025-06-01 18:39:24] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 196/408 variables, 212/228 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/408 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 234 constraints, problems are : Problem set: 0 solved, 237 unsolved in 11511 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 196/408 variables, 212/228 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 237/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/408 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 471 constraints, problems are : Problem set: 0 solved, 237 unsolved in 14125 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 212/212 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25689ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 25690ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26024 ms. Remains : 212/212 places, 245/245 transitions.
Built C files in :
/tmp/ltsmin17056146085650134677
[2025-06-01 18:39:50] [INFO ] Computing symmetric may disable matrix : 245 transitions.
[2025-06-01 18:39:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:39:50] [INFO ] Computing symmetric may enable matrix : 245 transitions.
[2025-06-01 18:39:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:39:50] [INFO ] Computing Do-Not-Accords matrix : 245 transitions.
[2025-06-01 18:39:50] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:39:50] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17056146085650134677
Running compilation step : cd /tmp/ltsmin17056146085650134677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 539 ms.
Running link step : cd /tmp/ltsmin17056146085650134677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17056146085650134677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12031802124536898464.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 18:40:05] [INFO ] Flatten gal took : 18 ms
[2025-06-01 18:40:05] [INFO ] Flatten gal took : 17 ms
[2025-06-01 18:40:05] [INFO ] Time to serialize gal into /tmp/LTL6487566327301353050.gal : 4 ms
[2025-06-01 18:40:05] [INFO ] Time to serialize properties into /tmp/LTL5004867588664329835.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6487566327301353050.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5641738916855904748.hoa' '-atoms' '/tmp/LTL5004867588664329835.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5004867588664329835.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5641738916855904748.hoa
Detected timeout of ITS tools.
[2025-06-01 18:40:20] [INFO ] Flatten gal took : 15 ms
[2025-06-01 18:40:20] [INFO ] Flatten gal took : 14 ms
[2025-06-01 18:40:20] [INFO ] Time to serialize gal into /tmp/LTL17909885025267529317.gal : 3 ms
[2025-06-01 18:40:20] [INFO ] Time to serialize properties into /tmp/LTL13554451731934647897.ltl : 2 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17909885025267529317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13554451731934647897.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((((P_poll__handlingMessage_1+P_poll__handlingMessage_2)+(P_poll__handlingMessage_3+P_poll__handlingMessage_4))+((P_poll__hand...260
Formula 0 simplified : GF!"((((P_poll__handlingMessage_1+P_poll__handlingMessage_2)+(P_poll__handlingMessage_3+P_poll__handlingMessage_4))+((P_poll__handli...254
Detected timeout of ITS tools.
[2025-06-01 18:40:35] [INFO ] Flatten gal took : 15 ms
[2025-06-01 18:40:35] [INFO ] Applying decomposition
[2025-06-01 18:40:35] [INFO ] Flatten gal took : 13 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/graph11352460660717376073.txt' '-o' '/tmp/graph11352460660717376073.bin' '-w' '/tmp/graph11352460660717376073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11352460660717376073.bin' '-l' '-1' '-v' '-w' '/tmp/graph11352460660717376073.weights' '-q' '0' '-e' '0.001'
[2025-06-01 18:40:35] [INFO ] Decomposing Gal with order
[2025-06-01 18:40:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 18:40:35] [INFO ] Removed a total of 513 redundant transitions.
[2025-06-01 18:40:35] [INFO ] Flatten gal took : 56 ms
[2025-06-01 18:40:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 268 labels/synchronizations in 18 ms.
[2025-06-01 18:40:35] [INFO ] Time to serialize gal into /tmp/LTL15145648497308923784.gal : 5 ms
[2025-06-01 18:40:35] [INFO ] Time to serialize properties into /tmp/LTL2299307921076283613.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15145648497308923784.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2299307921076283613.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((gu57.P_poll__handlingMessage_1+gu57.P_poll__handlingMessage_2)+(gu57.P_poll__handlingMessage_3+gu57.P_poll__handlingMessag...300
Formula 0 simplified : GF!"((((gu57.P_poll__handlingMessage_1+gu57.P_poll__handlingMessage_2)+(gu57.P_poll__handlingMessage_3+gu57.P_poll__handlingMessage_...294
Detected timeout of ITS tools.
Treatment of property NeoElection-COL-8-LTLCardinality-01 finished in 161184 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' '!(X((G(p0)||F(p1))))'
Support contains 8 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 318/318 transitions.
Applied a total of 0 rules in 4 ms. Remains 284 /284 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2025-06-01 18:40:50] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
// Phase 1: matrix 269 rows 284 cols
[2025-06-01 18:40:50] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:40:50] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-01 18:40:50] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
[2025-06-01 18:40:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:40:51] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 18:40:51] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2025-06-01 18:40:51] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
[2025-06-01 18:40:51] [INFO ] Invariant cache hit.
[2025-06-01 18:40:51] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 8/284 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Problem TDEAD21 is UNSAT
At refinement iteration 4 (OVERLAPS) 269/553 variables, 284/299 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 7/306 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:59] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:59] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:59] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:59] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:00] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:00] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:00] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:00] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:00] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:00] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:00] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:00] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:00] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:00] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:00] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:02] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:02] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:03] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:03] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:03] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 20/326 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:05] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:05] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:05] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:05] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:05] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:05] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:06] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:06] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:06] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:06] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:06] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:06] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:06] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:06] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:06] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:06] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:07] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:07] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:07] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:07] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 20/346 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:09] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:09] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:09] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:09] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:09] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:09] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:09] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:09] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:10] [INFO ] Deduced a trap composed of 10 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 18:41:10] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:10] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:10] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:10] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:10] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:10] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:10] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:11] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:11] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:11] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:11] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/366 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:11] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:11] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:11] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:11] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:12] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:12] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:12] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:12] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:12] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:12] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:12] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:12] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:12] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:12] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:12] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:12] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:13] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:13] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:13] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:13] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 20/386 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/386 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:19] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:19] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:19] [INFO ] Deduced a trap composed of 12 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 18:41:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 390 constraints, problems are : Problem set: 1 solved, 309 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 284/284 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 8/284 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 84/99 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 269/553 variables, 284/383 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 7/390 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 309/699 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/699 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:41:50] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 700 constraints, problems are : Problem set: 1 solved, 309 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 284/284 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 309/310 constraints, Known Traps: 85/85 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 1 solved, 309 unsolved
Search for dead transitions found 1 dead transitions in 60101ms
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 : 284/284 places, 317/318 transitions.
Applied a total of 0 rules in 3 ms. Remains 284 /284 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60508 ms. Remains : 284/284 places, 317/318 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeoElection-COL-8-LTLCardinality-04
Product exploration explored 100000 steps with 2333 reset in 270 ms.
Product exploration explored 100000 steps with 2331 reset in 253 ms.
Computed a total of 284 stabilizing places and 317 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 284 transition count 317
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 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (52 resets) in 382 ms. (104 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
[2025-06-01 18:41:52] [INFO ] Flow matrix only has 268 transitions (discarded 49 similar events)
// Phase 1: matrix 268 rows 284 cols
[2025-06-01 18:41:52] [INFO ] Computed 16 invariants in 2 ms
[2025-06-01 18:41:52] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/88 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/93 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/94 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 268/362 variables, 94/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 6/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 190/552 variables, 190/300 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 6/306 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/552 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 306 constraints, problems are : Problem set: 1 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 284/284 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
After SMT solving in domain Int declared 8/552 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/284 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (G (NOT p1))), (F (G p0)), (G (OR (NOT p0) (NOT p1))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 16 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-8-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-8-LTLCardinality-04 finished in 62123 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((p0&&G(F(!p1)))) U X(p1)))'
Support contains 16 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 318/318 transitions.
Applied a total of 0 rules in 5 ms. Remains 284 /284 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2025-06-01 18:41:52] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
// Phase 1: matrix 269 rows 284 cols
[2025-06-01 18:41:52] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:41:53] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-01 18:41:53] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
[2025-06-01 18:41:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:41:53] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 18:41:53] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2025-06-01 18:41:53] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
[2025-06-01 18:41:53] [INFO ] Invariant cache hit.
[2025-06-01 18:41:53] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 8/284 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Problem TDEAD21 is UNSAT
At refinement iteration 4 (OVERLAPS) 269/553 variables, 284/299 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 7/306 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:01] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:01] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:01] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:01] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:02] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:02] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:02] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:02] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:02] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:02] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:02] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:02] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:02] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:02] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:02] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:04] [INFO ] Deduced a trap composed of 7 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 18:42:04] [INFO ] Deduced a trap composed of 7 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 18:42:04] [INFO ] Deduced a trap composed of 7 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 18:42:04] [INFO ] Deduced a trap composed of 7 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 18:42:04] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 20/326 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:07] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:07] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:07] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:07] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:07] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:07] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:07] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:07] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:08] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:08] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:08] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:08] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:08] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:08] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:08] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:08] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:08] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:08] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:09] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:09] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 20/346 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:11] [INFO ] Deduced a trap composed of 7 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 18:42:11] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:11] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:11] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:11] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:11] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:11] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:11] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:11] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:11] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:11] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:11] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:12] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:12] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:12] [INFO ] Deduced a trap composed of 12 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 18:42:12] [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 18:42:12] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:12] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:13] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:13] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/366 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:13] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:13] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:13] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:13] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:13] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:13] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:13] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:13] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:14] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:14] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:14] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:14] [INFO ] Deduced a trap composed of 10 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 18:42:14] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:14] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:14] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:14] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:14] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:14] [INFO ] Deduced a trap composed of 12 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 18:42:14] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:14] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 20/386 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/386 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:21] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:21] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:21] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:21] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 390 constraints, problems are : Problem set: 1 solved, 309 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 284/284 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 8/284 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 84/99 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 269/553 variables, 284/383 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 7/390 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 309/699 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/699 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:42:53] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 700 constraints, problems are : Problem set: 1 solved, 309 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 284/284 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 309/310 constraints, Known Traps: 85/85 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 1 solved, 309 unsolved
Search for dead transitions found 1 dead transitions in 60096ms
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 : 284/284 places, 317/318 transitions.
Applied a total of 0 rules in 4 ms. Remains 284 /284 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60479 ms. Remains : 284/284 places, 317/318 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), p1, p1, (NOT p0)]
Running random walk in product with property : NeoElection-COL-8-LTLCardinality-15
Product exploration explored 100000 steps with 2251 reset in 272 ms.
Product exploration explored 100000 steps with 2432 reset in 280 ms.
Computed a total of 284 stabilizing places and 317 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 284 transition count 317
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 (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 179 steps (0 resets) in 5 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
[2025-06-01 18:42:54] [INFO ] Flow matrix only has 268 transitions (discarded 49 similar events)
// Phase 1: matrix 268 rows 284 cols
[2025-06-01 18:42:54] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:42:55] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-01 18:42:55] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2025-06-01 18:42:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:42:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-01 18:42:55] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2025-06-01 18:42:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 18:42:55] [INFO ] [Nat]Added 6 Read/Feed constraints in 8 ms returned sat
[2025-06-01 18:42:55] [INFO ] Computed and/alt/rep : 301/656/252 causal constraints (skipped 8 transitions) in 15 ms.
[2025-06-01 18:42:56] [INFO ] Added : 128 causal constraints over 26 iterations in 714 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 8 out of 284 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 317/317 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 284 transition count 309
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 276 transition count 309
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 112 place count 228 transition count 261
Applied a total of 112 rules in 28 ms. Remains 228 /284 variables (removed 56) and now considering 261/317 (removed 56) transitions.
[2025-06-01 18:42:56] [INFO ] Flow matrix only has 212 transitions (discarded 49 similar events)
// Phase 1: matrix 212 rows 228 cols
[2025-06-01 18:42:56] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:42:56] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-01 18:42:56] [INFO ] Flow matrix only has 212 transitions (discarded 49 similar events)
[2025-06-01 18:42:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:42:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 18:42:56] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:42:56] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2025-06-01 18:42:56] [INFO ] Flow matrix only has 212 transitions (discarded 49 similar events)
[2025-06-01 18:42:56] [INFO ] Invariant cache hit.
[2025-06-01 18:42:56] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 8/228 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 212/440 variables, 228/244 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 6/250 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 250 constraints, problems are : Problem set: 0 solved, 253 unsolved in 13498 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 228/228 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 8/228 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 212/440 variables, 228/244 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 6/250 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 253/503 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:18] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:18] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:18] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:18] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:18] [INFO ] Deduced a trap composed of 5 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 18:43:18] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:18] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:18] [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 18:43:18] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:18] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:19] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:19] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:19] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:19] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:19] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:19] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:19] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:19] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:19] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:43:20] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 20/523 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 523 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 228/228 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43568ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 43570ms
Starting structural reductions in SI_LTL mode, iteration 1 : 228/284 places, 261/317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43915 ms. Remains : 228/284 places, 261/317 transitions.
Computed a total of 228 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 228 transition count 261
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 : [(NOT p1), (X (NOT p1)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 17 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
[2025-06-01 18:43:40] [INFO ] Flow matrix only has 212 transitions (discarded 49 similar events)
[2025-06-01 18:43:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:43:41] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-01 18:43:41] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2025-06-01 18:43:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:43:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 18:43:41] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2025-06-01 18:43:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 18:43:41] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2025-06-01 18:43:41] [INFO ] Computed and/alt/rep : 245/600/196 causal constraints (skipped 8 transitions) in 11 ms.
[2025-06-01 18:43:41] [INFO ] Added : 77 causal constraints over 16 iterations in 343 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 19082 reset in 240 ms.
Product exploration explored 100000 steps with 19158 reset in 234 ms.
Built C files in :
/tmp/ltsmin10461297462352841327
[2025-06-01 18:43:42] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2025-06-01 18:43:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:43:42] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2025-06-01 18:43:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:43:42] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2025-06-01 18:43:42] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:43:42] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10461297462352841327
Running compilation step : cd /tmp/ltsmin10461297462352841327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 563 ms.
Running link step : cd /tmp/ltsmin10461297462352841327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10461297462352841327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12069018477313757703.hoa' '--buchi-type=spotba'
LTSmin run took 555 ms.
FORMULA NeoElection-COL-8-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-8-LTLCardinality-15 finished in 110712 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)))'
[2025-06-01 18:43:43] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18175873453171845182
[2025-06-01 18:43:43] [INFO ] Computing symmetric may disable matrix : 318 transitions.
[2025-06-01 18:43:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:43:43] [INFO ] Applying decomposition
[2025-06-01 18:43:43] [INFO ] Computing symmetric may enable matrix : 318 transitions.
[2025-06-01 18:43:43] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:43:43] [INFO ] Flatten gal took : 16 ms
[2025-06-01 18:43:43] [INFO ] Computing Do-Not-Accords matrix : 318 transitions.
[2025-06-01 18:43:43] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:43:43] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18175873453171845182
Running compilation step : cd /tmp/ltsmin18175873453171845182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph2169778779448283179.txt' '-o' '/tmp/graph2169778779448283179.bin' '-w' '/tmp/graph2169778779448283179.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2169778779448283179.bin' '-l' '-1' '-v' '-w' '/tmp/graph2169778779448283179.weights' '-q' '0' '-e' '0.001'
[2025-06-01 18:43:43] [INFO ] Decomposing Gal with order
[2025-06-01 18:43:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 18:43:44] [INFO ] Removed a total of 524 redundant transitions.
[2025-06-01 18:43:44] [INFO ] Flatten gal took : 63 ms
[2025-06-01 18:43:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 366 labels/synchronizations in 32 ms.
[2025-06-01 18:43:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality5536912041143929200.gal : 7 ms
[2025-06-01 18:43:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality5961547959048954596.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5536912041143929200.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5961547959048954596.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G("((((gu34.P_poll__handlingMessage_1+gu34.P_poll__handlingMessage_2)+(gu34.P_poll__handlingMessage_3+gu34.P_poll__handlingMessag...300
Formula 0 simplified : GF!"((((gu34.P_poll__handlingMessage_1+gu34.P_poll__handlingMessage_2)+(gu34.P_poll__handlingMessage_3+gu34.P_poll__handlingMessage_...294
Compilation finished in 696 ms.
Running link step : cd /tmp/ltsmin18175873453171845182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18175873453171845182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-01 19:05:37] [INFO ] Applying decomposition
[2025-06-01 19:05:37] [INFO ] Flatten gal took : 55 ms
[2025-06-01 19:05:37] [INFO ] Decomposing Gal with order
[2025-06-01 19:05:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 19:05:37] [INFO ] Removed a total of 468 redundant transitions.
[2025-06-01 19:05:37] [INFO ] Flatten gal took : 83 ms
[2025-06-01 19:05:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2025-06-01 19:05:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality5817902525380700790.gal : 3 ms
[2025-06-01 19:05:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality13713591588553612213.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5817902525380700790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13713591588553612213.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G("((((gM1.P_poll__handlingMessage_1+gM2.P_poll__handlingMessage_2)+(gM3.P_poll__handlingMessage_3+gM4.P_poll__handlingMessage_4)...292
Formula 0 simplified : GF!"((((gM1.P_poll__handlingMessage_1+gM2.P_poll__handlingMessage_2)+(gM3.P_poll__handlingMessage_3+gM4.P_poll__handlingMessage_4))+...286
Detected timeout of ITS tools.
[2025-06-01 19:27:31] [INFO ] Flatten gal took : 47 ms
[2025-06-01 19:27:31] [INFO ] Input system was already deterministic with 318 transitions.
[2025-06-01 19:27:31] [INFO ] Transformed 284 places.
[2025-06-01 19:27:31] [INFO ] Transformed 318 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-01 19:27:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality2500253226373387706.gal : 2 ms
[2025-06-01 19:27:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality14730380058754899973.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2500253226373387706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14730380058754899973.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((((P_poll__handlingMessage_1+P_poll__handlingMessage_2)+(P_poll__handlingMessage_3+P_poll__handlingMessage_4))+((P_poll__hand...260
Formula 0 simplified : GF!"((((P_poll__handlingMessage_1+P_poll__handlingMessage_2)+(P_poll__handlingMessage_3+P_poll__handlingMessage_4))+((P_poll__handli...254

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-COL-8"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-8, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876811900091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-8.tgz
mv NeoElection-COL-8 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;