About the Execution of ITS-Tools for NeoElection-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FF?FFFFTFFFFTFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876811900084.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-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876811900084
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 5.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 108K 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-7-LTLFireability-00
FORMULA_NAME NeoElection-COL-7-LTLFireability-01
FORMULA_NAME NeoElection-COL-7-LTLFireability-02
FORMULA_NAME NeoElection-COL-7-LTLFireability-03
FORMULA_NAME NeoElection-COL-7-LTLFireability-04
FORMULA_NAME NeoElection-COL-7-LTLFireability-05
FORMULA_NAME NeoElection-COL-7-LTLFireability-06
FORMULA_NAME NeoElection-COL-7-LTLFireability-07
FORMULA_NAME NeoElection-COL-7-LTLFireability-08
FORMULA_NAME NeoElection-COL-7-LTLFireability-09
FORMULA_NAME NeoElection-COL-7-LTLFireability-10
FORMULA_NAME NeoElection-COL-7-LTLFireability-11
FORMULA_NAME NeoElection-COL-7-LTLFireability-12
FORMULA_NAME NeoElection-COL-7-LTLFireability-13
FORMULA_NAME NeoElection-COL-7-LTLFireability-14
FORMULA_NAME NeoElection-COL-7-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748799899837
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-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-01 17:45:01] [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 17:45:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 17:45:01] [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 17:45:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 17:45:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 628 ms
[2025-06-01 17:45:01] [INFO ] Detected 6 constant HL places corresponding to 3552 PT places.
[2025-06-01 17:45:01] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 7128 PT places and 22272.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2025-06-01 17:45:01] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 6 ms.
[2025-06-01 17:45:01] [INFO ] Skeletonized 14 HLPN properties in 1 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-COL-7-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-06 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 10 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-7-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 40009 steps (971 resets) in 320 ms. (124 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (112 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
// Phase 1: matrix 7 rows 6 cols
[2025-06-01 17:45:02] [INFO ] Computed 1 invariants in 3 ms
[2025-06-01 17:45:02] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 2/13 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
[2025-06-01 17:45:02] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-01 17:45:02] [INFO ] Flatten gal took : 13 ms
[2025-06-01 17:45:02] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA NeoElection-COL-7-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 17:45:02] [INFO ] Flatten gal took : 2 ms
Domain [M(8), POS(7), M(8)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 7)]] 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 17:45:02] [INFO ] Unfolded HLPN to a Petri net with 7128 places and 12460 transitions 70880 arcs in 264 ms.
[2025-06-01 17:45:02] [INFO ] Unfolded 11 HLPN properties in 7 ms.
Deduced a syphon composed of 6688 places in 35 ms
Reduce places removed 6737 places and 11850 transitions.
Reduce places removed 8 places and 0 transitions.
FORMULA NeoElection-COL-7-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 139 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 610/610 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 341 transition count 610
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 62 place count 321 transition count 515
Iterating global reduction 1 with 20 rules applied. Total rules applied 82 place count 321 transition count 515
Applied a total of 82 rules in 69 ms. Remains 321 /383 variables (removed 62) and now considering 515/610 (removed 95) transitions.
[2025-06-01 17:45:03] [INFO ] Flow matrix only has 479 transitions (discarded 36 similar events)
// Phase 1: matrix 479 rows 321 cols
[2025-06-01 17:45:03] [INFO ] Computed 62 invariants in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:45:03] [INFO ] Implicit Places using invariants in 355 ms returned [19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 92, 93, 94, 95, 96, 97]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 365 ms to find 43 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 278/383 places, 515/610 transitions.
Applied a total of 0 rules in 4 ms. Remains 278 /278 variables (removed 0) and now considering 515/515 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 447 ms. Remains : 278/383 places, 515/610 transitions.
Support contains 139 out of 278 places after structural reductions.
[2025-06-01 17:45:03] [INFO ] Flatten gal took : 65 ms
[2025-06-01 17:45:03] [INFO ] Flatten gal took : 49 ms
[2025-06-01 17:45:03] [INFO ] Input system was already deterministic with 515 transitions.
RANDOM walk for 649 steps (0 resets) in 221 ms. (2 steps per ms) remains 0/5 properties
FORMULA NeoElection-COL-7-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 278 stabilizing places and 515 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 278 transition count 515
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' '!(G(F(p0)))'
Support contains 75 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 515/515 transitions.
Reduce places removed 7 places and 7 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 271 transition count 501
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 264 transition count 501
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 257 transition count 494
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 257 transition count 494
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 28 place count 257 transition count 493
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 256 transition count 493
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 251 transition count 488
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 250 transition count 487
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 767 edges and 249 vertex of which 248 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 0 with 2 rules applied. Total rules applied 43 place count 248 transition count 486
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 43 place count 248 transition count 474
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 67 place count 236 transition count 474
Applied a total of 67 rules in 77 ms. Remains 236 /278 variables (removed 42) and now considering 474/515 (removed 41) transitions.
[2025-06-01 17:45:04] [INFO ] Flow matrix only has 438 transitions (discarded 36 similar events)
// Phase 1: matrix 438 rows 236 cols
[2025-06-01 17:45:04] [INFO ] Computed 18 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:45:04] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-01 17:45:04] [INFO ] Flow matrix only has 438 transitions (discarded 36 similar events)
[2025-06-01 17:45:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:45:04] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-01 17:45:04] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:45:04] [INFO ] Redundant transitions in 29 ms returned []
Running 468 sub problems to find dead transitions.
[2025-06-01 17:45:04] [INFO ] Flow matrix only has 438 transitions (discarded 36 similar events)
[2025-06-01 17:45:04] [INFO ] Invariant cache hit.
[2025-06-01 17:45:04] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (OVERLAPS) 6/236 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 5 (OVERLAPS) 438/674 variables, 236/254 constraints. Problems are: Problem set: 6 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 126/380 constraints. Problems are: Problem set: 6 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 0/380 constraints. Problems are: Problem set: 6 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/674 variables, and 380 constraints, problems are : Problem set: 6 solved, 462 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 462 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 6/12 constraints. Problems are: Problem set: 6 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 6/236 variables, 6/18 constraints. Problems are: Problem set: 6 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/18 constraints. Problems are: Problem set: 6 solved, 462 unsolved
At refinement iteration 5 (OVERLAPS) 438/674 variables, 236/254 constraints. Problems are: Problem set: 6 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 126/380 constraints. Problems are: Problem set: 6 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 462/842 constraints. Problems are: Problem set: 6 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:00] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:00] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:01] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:01] [INFO ] Deduced a trap composed of 4 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 17:46:01] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:01] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:01] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:01] [INFO ] Deduced a trap composed of 7 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 17:46:02] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:03] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:03] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:03] [INFO ] Deduced a trap composed of 5 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 17:46:03] [INFO ] Deduced a trap composed of 8 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 17:46:04] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:04] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:04] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:04] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:04] [INFO ] Deduced a trap composed of 6 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 17:46:04] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:04] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 20/862 constraints. Problems are: Problem set: 6 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 862 constraints, problems are : Problem set: 6 solved, 462 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 462/468 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60496ms problems are : Problem set: 6 solved, 462 unsolved
Search for dead transitions found 6 dead transitions in 60503ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 236/278 places, 468/515 transitions.
Applied a total of 0 rules in 19 ms. Remains 236 /236 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:46:05] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61070 ms. Remains : 236/278 places, 468/515 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-02
Product exploration explored 100000 steps with 1520 reset in 2731 ms.
Product exploration explored 100000 steps with 1508 reset in 2703 ms.
Computed a total of 236 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 236 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 190 steps (0 resets) in 16 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 111 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Support contains 75 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 468/468 transitions.
Applied a total of 0 rules in 19 ms. Remains 236 /236 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2025-06-01 17:46:11] [INFO ] Flow matrix only has 432 transitions (discarded 36 similar events)
// Phase 1: matrix 432 rows 236 cols
[2025-06-01 17:46:11] [INFO ] Computed 19 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:46:11] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-01 17:46:11] [INFO ] Flow matrix only has 432 transitions (discarded 36 similar events)
[2025-06-01 17:46:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:46:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-01 17:46:11] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:46:11] [INFO ] Redundant transitions in 3 ms returned []
Running 462 sub problems to find dead transitions.
[2025-06-01 17:46:11] [INFO ] Flow matrix only has 432 transitions (discarded 36 similar events)
[2025-06-01 17:46:11] [INFO ] Invariant cache hit.
[2025-06-01 17:46:11] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 6/236 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 432/668 variables, 236/255 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 120/375 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:32] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:32] [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 17:46:32] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:32] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:32] [INFO ] Deduced a trap composed of 6 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 17:46:32] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:32] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:32] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:33] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:33] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:33] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:33] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:33] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:33] [INFO ] Deduced a trap composed of 7 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 17:46:33] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:33] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:33] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:33] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:34] [INFO ] Deduced a trap composed of 4 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 17:46:34] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:40] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:40] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:40] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:40] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:40] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:40] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:40] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:41] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:41] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:41] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:41] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:41] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:41] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:41] [INFO ] Deduced a trap composed of 6 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 17:46:41] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:41] [INFO ] Deduced a trap composed of 6 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 17:46:41] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/668 variables, and 412 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 236/236 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 6/236 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 37/56 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (OVERLAPS) 432/668 variables, 236/292 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 120/412 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 462/874 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:08] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:08] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:08] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:08] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:08] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 5/879 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/668 variables, and 879 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 236/236 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60326ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60683 ms. Remains : 236/236 places, 468/468 transitions.
Computed a total of 236 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 236 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 208 steps (0 resets) in 16 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 107 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1482 reset in 2690 ms.
Product exploration explored 100000 steps with 1503 reset in 2672 ms.
Built C files in :
/tmp/ltsmin3967971470868891558
[2025-06-01 17:47:18] [INFO ] Computing symmetric may disable matrix : 468 transitions.
[2025-06-01 17:47:18] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:47:18] [INFO ] Computing symmetric may enable matrix : 468 transitions.
[2025-06-01 17:47:18] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:47:18] [INFO ] Computing Do-Not-Accords matrix : 468 transitions.
[2025-06-01 17:47:18] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:47:18] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3967971470868891558
Running compilation step : cd /tmp/ltsmin3967971470868891558;'/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 1381 ms.
Running link step : cd /tmp/ltsmin3967971470868891558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin3967971470868891558;'/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/stateBased9144128042076594637.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 75 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 468/468 transitions.
Applied a total of 0 rules in 20 ms. Remains 236 /236 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2025-06-01 17:47:33] [INFO ] Flow matrix only has 432 transitions (discarded 36 similar events)
[2025-06-01 17:47:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:47:33] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-01 17:47:33] [INFO ] Flow matrix only has 432 transitions (discarded 36 similar events)
[2025-06-01 17:47:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:47:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-01 17:47:33] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:47:33] [INFO ] Redundant transitions in 2 ms returned []
Running 462 sub problems to find dead transitions.
[2025-06-01 17:47:33] [INFO ] Flow matrix only has 432 transitions (discarded 36 similar events)
[2025-06-01 17:47:33] [INFO ] Invariant cache hit.
[2025-06-01 17:47:33] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 6/236 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 432/668 variables, 236/255 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 120/375 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:54] [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 17:47:54] [INFO ] Deduced a trap composed of 5 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 17:47:54] [INFO ] Deduced a trap composed of 5 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 17:47:54] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:54] [INFO ] Deduced a trap composed of 6 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 17:47:54] [INFO ] Deduced a trap composed of 6 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 17:47:54] [INFO ] Deduced a trap composed of 6 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 17:47:54] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:54] [INFO ] Deduced a trap composed of 7 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 17:47:54] [INFO ] Deduced a trap composed of 7 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 17:47:54] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:55] [INFO ] Deduced a trap composed of 8 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 17:47:55] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:55] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:55] [INFO ] Deduced a trap composed of 5 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 17:47:55] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:55] [INFO ] Deduced a trap composed of 8 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 17:47:55] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:55] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:55] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:01] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:01] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:01] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:02] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:02] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:02] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:02] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:02] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:02] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:02] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:03] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:03] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:03] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:03] [INFO ] Deduced a trap composed of 6 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 17:48:03] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:03] [INFO ] Deduced a trap composed of 6 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 17:48:03] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 17/412 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/668 variables, and 412 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 236/236 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 6/236 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 37/56 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (OVERLAPS) 432/668 variables, 236/292 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 120/412 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 462/874 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:30] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:30] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:30] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:30] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:30] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 5/879 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/668 variables, and 879 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 236/236 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60675 ms. Remains : 236/236 places, 468/468 transitions.
Built C files in :
/tmp/ltsmin1110084819598934053
[2025-06-01 17:48:33] [INFO ] Computing symmetric may disable matrix : 468 transitions.
[2025-06-01 17:48:33] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:48:33] [INFO ] Computing symmetric may enable matrix : 468 transitions.
[2025-06-01 17:48:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:48:33] [INFO ] Computing Do-Not-Accords matrix : 468 transitions.
[2025-06-01 17:48:33] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:48:34] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1110084819598934053
Running compilation step : cd /tmp/ltsmin1110084819598934053;'/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 1330 ms.
Running link step : cd /tmp/ltsmin1110084819598934053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1110084819598934053;'/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/stateBased3821859965148764691.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 17:48:49] [INFO ] Flatten gal took : 34 ms
[2025-06-01 17:48:49] [INFO ] Flatten gal took : 32 ms
[2025-06-01 17:48:49] [INFO ] Time to serialize gal into /tmp/LTL14729235604394153142.gal : 5 ms
[2025-06-01 17:48:49] [INFO ] Time to serialize properties into /tmp/LTL7874187072022550760.prop : 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/LTL14729235604394153142.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10390371530559354283.hoa' '-atoms' '/tmp/LTL7874187072022550760.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...319
Loading property file /tmp/LTL7874187072022550760.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10390371530559354283.hoa
Detected timeout of ITS tools.
[2025-06-01 17:49:04] [INFO ] Flatten gal took : 50 ms
[2025-06-01 17:49:04] [INFO ] Flatten gal took : 31 ms
[2025-06-01 17:49:04] [INFO ] Time to serialize gal into /tmp/LTL17244028321127779801.gal : 5 ms
[2025-06-01 17:49:04] [INFO ] Time to serialize properties into /tmp/LTL4217191557600644297.ltl : 6 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/LTL17244028321127779801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4217191557600644297.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 : !((G(F("(((((((((((P_masterState_32<1)||(P_negotiation_70<1))||((P_network_1032<1)||(P_poll__handlingMessage_2<1)))&&(((P_masterState_...25968
Formula 0 simplified : FG!"(((((((((((P_masterState_32<1)||(P_negotiation_70<1))||((P_network_1032<1)||(P_poll__handlingMessage_2<1)))&&(((P_masterState_72...25962
Detected timeout of ITS tools.
[2025-06-01 17:49:19] [INFO ] Flatten gal took : 29 ms
[2025-06-01 17:49:19] [INFO ] Applying decomposition
[2025-06-01 17:49:19] [INFO ] Flatten gal took : 28 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/graph10424645127806527121.txt' '-o' '/tmp/graph10424645127806527121.bin' '-w' '/tmp/graph10424645127806527121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10424645127806527121.bin' '-l' '-1' '-v' '-w' '/tmp/graph10424645127806527121.weights' '-q' '0' '-e' '0.001'
[2025-06-01 17:49:19] [INFO ] Decomposing Gal with order
[2025-06-01 17:49:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 17:49:19] [INFO ] Removed a total of 26 redundant transitions.
[2025-06-01 17:49:19] [INFO ] Flatten gal took : 65 ms
[2025-06-01 17:49:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2025-06-01 17:49:19] [INFO ] Time to serialize gal into /tmp/LTL7904027224710661187.gal : 6 ms
[2025-06-01 17:49:19] [INFO ] Time to serialize properties into /tmp/LTL4635351151410150231.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7904027224710661187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4635351151410150231.ltl' '-c' '-stutter-deadlock'
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...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((((u3.P_masterState_32<1)||(u3.P_negotiation_70<1))||((u3.P_network_1032<1)||(u3.P_poll__handlingMessage_2<1)))&&(((u1...28992
Formula 0 simplified : FG!"(((((((((((u3.P_masterState_32<1)||(u3.P_negotiation_70<1))||((u3.P_network_1032<1)||(u3.P_poll__handlingMessage_2<1)))&&(((u1.P...28986
Detected timeout of ITS tools.
Treatment of property NeoElection-COL-7-LTLFireability-02 finished in 270879 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 7 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 515/515 transitions.
Reduce places removed 7 places and 7 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 271 transition count 501
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 264 transition count 501
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 59 place count 219 transition count 236
Iterating global reduction 0 with 45 rules applied. Total rules applied 104 place count 219 transition count 236
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 188 place count 177 transition count 194
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 195 place count 170 transition count 187
Applied a total of 195 rules in 51 ms. Remains 170 /278 variables (removed 108) and now considering 187/515 (removed 328) transitions.
[2025-06-01 17:49:34] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
// Phase 1: matrix 151 rows 170 cols
[2025-06-01 17:49:34] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:49:34] [INFO ] Implicit Places using invariants in 108 ms returned [12, 13, 14, 15, 16, 17]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 109 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/278 places, 187/515 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 164/278 places, 187/515 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-10
Stuttering criterion allowed to conclude after 336 steps with 0 reset in 4 ms.
FORMULA NeoElection-COL-7-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLFireability-10 finished in 222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G((p1||X(X(X(p0)))))) U X(!p1)))'
Support contains 56 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 515/515 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 226 transition count 243
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 226 transition count 243
Applied a total of 104 rules in 8 ms. Remains 226 /278 variables (removed 52) and now considering 243/515 (removed 272) transitions.
[2025-06-01 17:49:35] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
// Phase 1: matrix 207 rows 226 cols
[2025-06-01 17:49:35] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:49:35] [INFO ] Implicit Places using invariants in 93 ms returned [19, 20, 21, 22, 23, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 94 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 220/278 places, 243/515 transitions.
Applied a total of 0 rules in 2 ms. Remains 220 /220 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 220/278 places, 243/515 transitions.
Stuttering acceptance computed with spot in 477 ms :[p1, (AND p1 (NOT p0)), false, p1, false, (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-13
Entered a terminal (fully accepting) state of product in 60 steps with 0 reset in 4 ms.
FORMULA NeoElection-COL-7-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLFireability-13 finished in 615 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 14 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 515/515 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 278 transition count 508
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 271 transition count 508
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 271 transition count 501
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 264 transition count 501
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 73 place count 219 transition count 236
Iterating global reduction 2 with 45 rules applied. Total rules applied 118 place count 219 transition count 236
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 188 place count 184 transition count 201
Applied a total of 188 rules in 34 ms. Remains 184 /278 variables (removed 94) and now considering 201/515 (removed 314) transitions.
[2025-06-01 17:49:35] [INFO ] Flow matrix only has 165 transitions (discarded 36 similar events)
// Phase 1: matrix 165 rows 184 cols
[2025-06-01 17:49:35] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:49:35] [INFO ] Implicit Places using invariants in 111 ms returned [19, 20, 21, 22, 23, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 114 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 178/278 places, 201/515 transitions.
Applied a total of 0 rules in 8 ms. Remains 178 /178 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 178/278 places, 201/515 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-15
Product exploration explored 100000 steps with 526 reset in 490 ms.
Product exploration explored 100000 steps with 526 reset in 520 ms.
Computed a total of 178 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 178 transition count 201
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 p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-7-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLFireability-15 finished in 1299 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)))'
[2025-06-01 17:49:37] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin639154768360262109
[2025-06-01 17:49:37] [INFO ] Applying decomposition
[2025-06-01 17:49:37] [INFO ] Computing symmetric may disable matrix : 515 transitions.
[2025-06-01 17:49:37] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:49:37] [INFO ] Computing symmetric may enable matrix : 515 transitions.
[2025-06-01 17:49:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:49:37] [INFO ] Flatten gal took : 26 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/graph576101509304823848.txt' '-o' '/tmp/graph576101509304823848.bin' '-w' '/tmp/graph576101509304823848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph576101509304823848.bin' '-l' '-1' '-v' '-w' '/tmp/graph576101509304823848.weights' '-q' '0' '-e' '0.001'
[2025-06-01 17:49:37] [INFO ] Decomposing Gal with order
[2025-06-01 17:49:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 17:49:37] [INFO ] Computing Do-Not-Accords matrix : 515 transitions.
[2025-06-01 17:49:37] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:49:37] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin639154768360262109
Running compilation step : cd /tmp/ltsmin639154768360262109;'/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'
[2025-06-01 17:49:37] [INFO ] Removed a total of 47 redundant transitions.
[2025-06-01 17:49:37] [INFO ] Flatten gal took : 44 ms
[2025-06-01 17:49:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 5 ms.
[2025-06-01 17:49:37] [INFO ] Time to serialize gal into /tmp/LTLFireability12366621448707259128.gal : 6 ms
[2025-06-01 17:49:37] [INFO ] Time to serialize properties into /tmp/LTLFireability9366014555247824844.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/LTLFireability12366621448707259128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9366014555247824844.ltl' '-c' '-stutter-deadlock'
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 : !((G(F("(((((((((((i4.u8.P_masterState_32<1)||(i4.u8.P_negotiation_70<1))||((i4.u8.P_network_1032<1)||(i4.u8.P_poll__handlingMessage_2...32112
Formula 0 simplified : FG!"(((((((((((i4.u8.P_masterState_32<1)||(i4.u8.P_negotiation_70<1))||((i4.u8.P_network_1032<1)||(i4.u8.P_poll__handlingMessage_2<1...32106
Compilation finished in 1457 ms.
Running link step : cd /tmp/ltsmin639154768360262109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin639154768360262109;'/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 18:11:10] [INFO ] Applying decomposition
[2025-06-01 18:11:10] [INFO ] Flatten gal took : 72 ms
[2025-06-01 18:11:10] [INFO ] Decomposing Gal with order
[2025-06-01 18:11:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 18:11:10] [INFO ] Removed a total of 1453 redundant transitions.
[2025-06-01 18:11:10] [INFO ] Flatten gal took : 166 ms
[2025-06-01 18:11:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2025-06-01 18:11:10] [INFO ] Time to serialize gal into /tmp/LTLFireability17168481768338193855.gal : 17 ms
[2025-06-01 18:11:10] [INFO ] Time to serialize properties into /tmp/LTLFireability16932118057309785600.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/LTLFireability17168481768338193855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16932118057309785600.ltl' '-c' '-stutter-deadlock'
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...278
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((((MBOOLM32.P_masterState_32<1)||(MMNEGSTEP70.P_negotiation_70<1))||((MMMTM1032.P_network_1032<1)||(M2.P_poll__handlin...34518
Formula 0 simplified : FG!"(((((((((((MBOOLM32.P_masterState_32<1)||(MMNEGSTEP70.P_negotiation_70<1))||((MMMTM1032.P_network_1032<1)||(M2.P_poll__handlingM...34512
Detected timeout of ITS tools.
[2025-06-01 18:32:50] [INFO ] Flatten gal took : 429 ms
[2025-06-01 18:32:51] [INFO ] Input system was already deterministic with 515 transitions.
[2025-06-01 18:32:52] [INFO ] Transformed 278 places.
[2025-06-01 18:32:52] [INFO ] Transformed 515 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 18:32:52] [INFO ] Time to serialize gal into /tmp/LTLFireability13530934626567238212.gal : 14 ms
[2025-06-01 18:32:52] [INFO ] Time to serialize properties into /tmp/LTLFireability15455110432195563942.ltl : 20 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/LTLFireability13530934626567238212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15455110432195563942.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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(((((((((((P_masterState_32<1)||(P_negotiation_70<1))||((P_network_1032<1)||(P_poll__handlingMessage_2<1)))&&(((P_masterState_...25968
Formula 0 simplified : FG!"(((((((((((P_masterState_32<1)||(P_negotiation_70<1))||((P_network_1032<1)||(P_poll__handlingMessage_2<1)))&&(((P_masterState_72...25962
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
+ [[ 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-7"
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-7, 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-174876811900084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-7.tgz
mv NeoElection-COL-7 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 '
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 ;