Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 75K 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-3-LTLFireability-00
FORMULA_NAME NeoElection-COL-3-LTLFireability-01
FORMULA_NAME NeoElection-COL-3-LTLFireability-02
FORMULA_NAME NeoElection-COL-3-LTLFireability-03
FORMULA_NAME NeoElection-COL-3-LTLFireability-04
FORMULA_NAME NeoElection-COL-3-LTLFireability-05
FORMULA_NAME NeoElection-COL-3-LTLFireability-06
FORMULA_NAME NeoElection-COL-3-LTLFireability-07
FORMULA_NAME NeoElection-COL-3-LTLFireability-08
FORMULA_NAME NeoElection-COL-3-LTLFireability-09
FORMULA_NAME NeoElection-COL-3-LTLFireability-10
FORMULA_NAME NeoElection-COL-3-LTLFireability-11
FORMULA_NAME NeoElection-COL-3-LTLFireability-12
FORMULA_NAME NeoElection-COL-3-LTLFireability-13
FORMULA_NAME NeoElection-COL-3-LTLFireability-14
FORMULA_NAME NeoElection-COL-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748795901311

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-01 16:38:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 16:38:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 16:38:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-01 16:38:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 16:38:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 617 ms
[2025-06-01 16:38:23] [INFO ] Detected 6 constant HL places corresponding to 448 PT places.
[2025-06-01 16:38:23] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 972 PT places and 1808.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2025-06-01 16:38:23] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2025-06-01 16:38:23] [INFO ] Skeletonized 10 HLPN properties in 0 ms. Removed 6 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-COL-3-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-12 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.3 ms
Remains 7 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-3-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 135 steps (6 resets) in 11 ms. (11 steps per ms) remains 0/3 properties
[2025-06-01 16:38:23] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-01 16:38:23] [INFO ] Flatten gal took : 13 ms
FORMULA NeoElection-COL-3-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 16:38:23] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Domain [M(4), POS(3), M(4)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 3)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-01 16:38:23] [INFO ] Unfolded HLPN to a Petri net with 972 places and 848 transitions 4688 arcs in 52 ms.
[2025-06-01 16:38:23] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 901 places and 790 transitions.
Reduce places removed 4 places and 0 transitions.
FORMULA NeoElection-COL-3-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 58/58 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 58
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 59 transition count 55
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 59 transition count 55
Applied a total of 10 rules in 10 ms. Remains 59 /67 variables (removed 8) and now considering 55/58 (removed 3) transitions.
[2025-06-01 16:38:23] [INFO ] Flow matrix only has 51 transitions (discarded 4 similar events)
// Phase 1: matrix 51 rows 59 cols
[2025-06-01 16:38:23] [INFO ] Computed 14 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:23] [INFO ] Implicit Places using invariants in 149 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 183 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/67 places, 55/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 58/67 places, 55/58 transitions.
Support contains 44 out of 58 places after structural reductions.
[2025-06-01 16:38:23] [INFO ] Flatten gal took : 10 ms
[2025-06-01 16:38:23] [INFO ] Flatten gal took : 11 ms
[2025-06-01 16:38:24] [INFO ] Input system was already deterministic with 55 transitions.
RANDOM walk for 146 steps (0 resets) in 18 ms. (7 steps per ms) remains 0/6 properties
Computed a total of 58 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 55
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 52 transition count 43
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 52 transition count 43
Applied a total of 12 rules in 3 ms. Remains 52 /58 variables (removed 6) and now considering 43/55 (removed 12) transitions.
[2025-06-01 16:38:24] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 52 cols
[2025-06-01 16:38:24] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:24] [INFO ] Implicit Places using invariants in 72 ms returned [7, 8, 9, 10, 11, 12, 13, 14]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 73 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/58 places, 43/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 44/58 places, 43/55 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLFireability-01
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-3-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-3-LTLFireability-01 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 16 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Reduce places removed 3 places and 3 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 52 transition count 51
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 51 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 48 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 47 transition count 47
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 46 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 45 transition count 46
Applied a total of 14 rules in 23 ms. Remains 45 /58 variables (removed 13) and now considering 46/55 (removed 9) transitions.
[2025-06-01 16:38:24] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 45 cols
[2025-06-01 16:38:24] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:24] [INFO ] Implicit Places using invariants in 53 ms returned [5, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/58 places, 46/55 transitions.
Applied a total of 0 rules in 13 ms. Remains 43 /43 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 43/58 places, 46/55 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLFireability-03
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-3-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-3-LTLFireability-03 finished in 232 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))'
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Reduce places removed 3 places and 3 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 52
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 52 transition count 49
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 49 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 46 transition count 46
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 46 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 15 place count 46 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 45 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 44 transition count 44
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 43 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 42 transition count 43
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 109 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 40 transition count 42
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 22 place count 40 transition count 38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 36 transition count 38
Applied a total of 30 rules in 24 ms. Remains 36 /58 variables (removed 22) and now considering 38/55 (removed 17) transitions.
[2025-06-01 16:38:24] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
// Phase 1: matrix 34 rows 36 cols
[2025-06-01 16:38:24] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:24] [INFO ] Implicit Places using invariants in 33 ms returned [5, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/58 places, 38/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 34/58 places, 38/55 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLFireability-04
Product exploration explored 100000 steps with 6728 reset in 313 ms.
Product exploration explored 100000 steps with 6736 reset in 262 ms.
Computed a total of 34 stabilizing places and 38 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 34 transition count 38
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 (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 64 steps (0 resets) in 8 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2025-06-01 16:38:25] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
// Phase 1: matrix 34 rows 34 cols
[2025-06-01 16:38:25] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:38:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 16:38:25] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-01 16:38:25] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 16:38:25] [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 16:38:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 16:38:25] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-01 16:38:26] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-01 16:38:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 16:38:26] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-01 16:38:26] [INFO ] Computed and/alt/rep : 34/106/30 causal constraints (skipped 2 transitions) in 13 ms.
[2025-06-01 16:38:26] [INFO ] Added : 15 causal constraints over 3 iterations in 61 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 13 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2025-06-01 16:38:26] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
[2025-06-01 16:38:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:26] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-01 16:38:26] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
[2025-06-01 16:38:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 16:38:26] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:38:26] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2025-06-01 16:38:26] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
[2025-06-01 16:38:26] [INFO ] Invariant cache hit.
[2025-06-01 16:38:26] [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/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 2/34 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
At refinement iteration 5 (OVERLAPS) 34/68 variables, 34/40 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 6/46 constraints. Problems are: Problem set: 2 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:26] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:26] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:26] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 4/50 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/68 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 50 constraints, problems are : Problem set: 2 solved, 34 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 34 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 2/34 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 4/10 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 34/68 variables, 34/44 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 6/50 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 34/84 constraints. Problems are: Problem set: 2 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:27] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 1/85 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/68 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 85 constraints, problems are : Problem set: 2 solved, 34 unsolved in 922 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 34/36 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1880ms problems are : Problem set: 2 solved, 34 unsolved
Search for dead transitions found 2 dead transitions in 1884ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 34/34 places, 36/38 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:38:28] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 2006 ms. Remains : 34/34 places, 36/38 transitions.
Computed a total of 34 stabilizing places and 36 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 34 transition count 36
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 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 68 steps (0 resets) in 6 ms. (9 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 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2025-06-01 16:38:28] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
// Phase 1: matrix 32 rows 34 cols
[2025-06-01 16:38:28] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:38:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 16:38:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-01 16:38:28] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 16:38:28] [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 16:38:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 16:38:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-01 16:38:28] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 16:38:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 16:38:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-01 16:38:28] [INFO ] Computed and/alt/rep : 32/96/28 causal constraints (skipped 2 transitions) in 2 ms.
[2025-06-01 16:38:28] [INFO ] Added : 16 causal constraints over 4 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6750 reset in 264 ms.
Product exploration explored 100000 steps with 6749 reset in 207 ms.
Built C files in :
/tmp/ltsmin2000176349714413350
[2025-06-01 16:38:29] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2025-06-01 16:38:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:38:29] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2025-06-01 16:38:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:38:29] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2025-06-01 16:38:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:38:29] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2000176349714413350
Running compilation step : cd /tmp/ltsmin2000176349714413350;'/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 274 ms.
Running link step : cd /tmp/ltsmin2000176349714413350;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin2000176349714413350;'/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/stateBased13211433299505263133.hoa' '--buchi-type=spotba'
LTSmin run took 142 ms.
FORMULA NeoElection-COL-3-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-3-LTLFireability-04 finished in 4949 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(F(p0)))'
Support contains 12 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 52 transition count 43
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 52 transition count 43
Applied a total of 12 rules in 4 ms. Remains 52 /58 variables (removed 6) and now considering 43/55 (removed 12) transitions.
[2025-06-01 16:38:29] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 52 cols
[2025-06-01 16:38:29] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:29] [INFO ] Implicit Places using invariants in 42 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/58 places, 43/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 50/58 places, 43/55 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLFireability-05
Product exploration explored 100000 steps with 8281 reset in 171 ms.
Product exploration explored 100000 steps with 8290 reset in 108 ms.
Computed a total of 50 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 43
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-3-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-3-LTLFireability-05 finished in 466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 20 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Reduce places removed 3 places and 3 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 52
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 52 transition count 49
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 49 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 46 transition count 46
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 46 transition count 46
Applied a total of 15 rules in 10 ms. Remains 46 /58 variables (removed 12) and now considering 46/55 (removed 9) transitions.
[2025-06-01 16:38:30] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 46 cols
[2025-06-01 16:38:30] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:30] [INFO ] Implicit Places using invariants in 39 ms returned [5, 8, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/58 places, 46/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53 ms. Remains : 43/58 places, 46/55 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NeoElection-COL-3-LTLFireability-07
Product exploration explored 100000 steps with 3569 reset in 234 ms.
Product exploration explored 100000 steps with 3546 reset in 287 ms.
Computed a total of 43 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 46
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) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 108 steps (0 resets) in 7 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 7 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-3-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-3-LTLFireability-07 finished in 1096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 12 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 58 transition count 52
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 55 transition count 52
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 12 place count 49 transition count 40
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 49 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 18 place count 49 transition count 37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 46 transition count 37
Applied a total of 24 rules in 10 ms. Remains 46 /58 variables (removed 12) and now considering 37/55 (removed 18) transitions.
[2025-06-01 16:38:31] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 46 cols
[2025-06-01 16:38:31] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:31] [INFO ] Implicit Places using invariants in 41 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/58 places, 37/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54 ms. Remains : 44/58 places, 37/55 transitions.
Stuttering acceptance computed with spot in 37 ms :[p0]
Running random walk in product with property : NeoElection-COL-3-LTLFireability-09
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-3-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-3-LTLFireability-09 finished in 115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Reduce places removed 3 places and 3 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 52
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 52 transition count 49
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 49 transition count 49
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 43 transition count 37
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 43 transition count 37
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 40 transition count 34
Ensure Unique test removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 37 transition count 34
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 34 transition count 31
Applied a total of 30 rules in 13 ms. Remains 34 /58 variables (removed 24) and now considering 31/55 (removed 24) transitions.
[2025-06-01 16:38:31] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 34 cols
[2025-06-01 16:38:31] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:31] [INFO ] Implicit Places using invariants in 40 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/58 places, 31/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55 ms. Remains : 32/58 places, 31/55 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLFireability-11
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-3-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-3-LTLFireability-11 finished in 107 ms.
All properties solved by simple procedures.
Total runtime 8883 ms.

BK_STOP 1748795911960

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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