MCC'2024- Execution of r246-tall-171654351700475

About the Execution of ITS-Tools for NeoElection-COL-6

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
652.071	239042.00	304557.00	767.70	FTFFTFFFTTTFTFFF	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r246-tall-171654351700475.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is NeoElection-COL-6, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351700475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.4K Apr 11 19:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 19:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 19:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 20:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 11 20:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 98K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeoElection-COL-6-LTLCardinality-00
FORMULA_NAME NeoElection-COL-6-LTLCardinality-01
FORMULA_NAME NeoElection-COL-6-LTLCardinality-02
FORMULA_NAME NeoElection-COL-6-LTLCardinality-03
FORMULA_NAME NeoElection-COL-6-LTLCardinality-04
FORMULA_NAME NeoElection-COL-6-LTLCardinality-05
FORMULA_NAME NeoElection-COL-6-LTLCardinality-06
FORMULA_NAME NeoElection-COL-6-LTLCardinality-07
FORMULA_NAME NeoElection-COL-6-LTLCardinality-08
FORMULA_NAME NeoElection-COL-6-LTLCardinality-09
FORMULA_NAME NeoElection-COL-6-LTLCardinality-10
FORMULA_NAME NeoElection-COL-6-LTLCardinality-11
FORMULA_NAME NeoElection-COL-6-LTLCardinality-12
FORMULA_NAME NeoElection-COL-6-LTLCardinality-13
FORMULA_NAME NeoElection-COL-6-LTLCardinality-14
FORMULA_NAME NeoElection-COL-6-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716681785157

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-26 00:03:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 00:03:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:03:06] [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.
[2024-05-26 00:03:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 00:03:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 613 ms
[2024-05-26 00:03:07] [INFO ] Detected 6 constant HL places corresponding to 2380 PT places.
[2024-05-26 00:03:07] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 4830 PT places and 13580.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 00:03:07] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2024-05-26 00:03:07] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-COL-6-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLCardinality-09 TRUE 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 14 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-6-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40007 steps (1113 resets) in 423 ms. (94 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (768 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
// Phase 1: matrix 7 rows 6 cols
[2024-05-26 00:03:07] [INFO ] Computed 1 invariants in 2 ms
[2024-05-26 00:03:07] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 5/13 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA NeoElection-COL-6-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 00:03:07] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-26 00:03:07] [INFO ] Flatten gal took : 13 ms
FORMULA NeoElection-COL-6-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 00:03:07] [INFO ] Flatten gal took : 2 ms
Domain [M(7), POS(6), M(7)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 6)]] 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.
[2024-05-26 00:03:07] [INFO ] Unfolded HLPN to a Petri net with 4830 places and 7361 transitions 41792 arcs in 161 ms.
[2024-05-26 00:03:07] [INFO ] Unfolded 6 HLPN properties in 2 ms.
Deduced a syphon composed of 4507 places in 35 ms
Reduce places removed 4543 places and 6967 transitions.
Reduce places removed 7 places and 0 transitions.
Support contains 180 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 394/394 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 250 transition count 394
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 54 place count 226 transition count 214
Iterating global reduction 1 with 24 rules applied. Total rules applied 78 place count 226 transition count 214
Applied a total of 78 rules in 19 ms. Remains 226 /280 variables (removed 54) and now considering 214/394 (removed 180) transitions.
[2024-05-26 00:03:08] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
// Phase 1: matrix 189 rows 226 cols
[2024-05-26 00:03:08] [INFO ] Computed 47 invariants in 11 ms
[2024-05-26 00:03:08] [INFO ] Implicit Places using invariants in 169 ms returned [16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 180 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/280 places, 214/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 213 ms. Remains : 190/280 places, 214/394 transitions.
Support contains 180 out of 190 places after structural reductions.
[2024-05-26 00:03:08] [INFO ] Flatten gal took : 26 ms
[2024-05-26 00:03:08] [INFO ] Flatten gal took : 23 ms
[2024-05-26 00:03:08] [INFO ] Input system was already deterministic with 214 transitions.
RANDOM walk for 40000 steps (96 resets) in 1039 ms. (38 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
[2024-05-26 00:03:09] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
// Phase 1: matrix 189 rows 190 cols
[2024-05-26 00:03:09] [INFO ] Computed 11 invariants in 7 ms
[2024-05-26 00:03:09] [INFO ] State equation strengthened by 15 read => feed constraints.
Problem AtomicPropp1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 60/379 variables, and 6 constraints, problems are : Problem set: 2 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 6/11 constraints, State Equation: 0/190 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 50ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
Computed a total of 190 stabilizing places and 214 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 190 transition count 214
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 164 transition count 178
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 164 transition count 178
Applied a total of 52 rules in 15 ms. Remains 164 /190 variables (removed 26) and now considering 178/214 (removed 36) transitions.
[2024-05-26 00:03:09] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 164 cols
[2024-05-26 00:03:09] [INFO ] Computed 11 invariants in 6 ms
[2024-05-26 00:03:09] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-26 00:03:09] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2024-05-26 00:03:09] [INFO ] Invariant cache hit.
[2024-05-26 00:03:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 00:03:09] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-26 00:03:09] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2024-05-26 00:03:09] [INFO ] Invariant cache hit.
[2024-05-26 00:03:09] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Problem TDEAD15 is UNSAT
At refinement iteration 4 (OVERLAPS) 153/317 variables, 164/175 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 5/180 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-26 00:03:11] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 12 ms to minimize.
[2024-05-26 00:03:11] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-26 00:03:11] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-26 00:03:11] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:03:12] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-26 00:03:12] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-26 00:03:12] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-26 00:03:12] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-26 00:03:12] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-26 00:03:12] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 2 ms to minimize.
[2024-05-26 00:03:12] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 2 ms to minimize.
[2024-05-26 00:03:12] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-26 00:03:12] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 6 ms to minimize.
[2024-05-26 00:03:13] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-26 00:03:13] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
[2024-05-26 00:03:13] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-26 00:03:13] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:03:13] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-26 00:03:13] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-26 00:03:13] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/200 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-26 00:03:14] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-26 00:03:15] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-26 00:03:15] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 18/218 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-26 00:03:15] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-26 00:03:15] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 2/220 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-26 00:03:18] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/317 variables, 1/221 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-26 00:03:19] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/317 variables, 1/222 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-26 00:03:21] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-26 00:03:21] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-26 00:03:21] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 3/225 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 15 (OVERLAPS) 0/317 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 225 constraints, problems are : Problem set: 1 solved, 171 unsolved in 14737 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 1 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 45/56 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 153/317 variables, 164/220 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 5/225 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 171/396 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/396 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/396 constraints. Problems are: Problem set: 1 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 396 constraints, problems are : Problem set: 1 solved, 171 unsolved in 7293 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 171/172 constraints, Known Traps: 45/45 constraints]
After SMT, in 22115ms problems are : Problem set: 1 solved, 171 unsolved
Search for dead transitions found 1 dead transitions in 22119ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 164/190 places, 177/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22371 ms. Remains : 164/190 places, 177/214 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA NeoElection-COL-6-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLCardinality-00 finished in 22655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(((p1 U p0)||G(F(p2))))))))'
Support contains 126 out of 190 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-26 00:03:31] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
// Phase 1: matrix 189 rows 190 cols
[2024-05-26 00:03:31] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 00:03:31] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-26 00:03:31] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 00:03:31] [INFO ] Invariant cache hit.
[2024-05-26 00:03:32] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-26 00:03:32] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-26 00:03:32] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 00:03:32] [INFO ] Invariant cache hit.
[2024-05-26 00:03:32] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Problem TDEAD35 is UNSAT
At refinement iteration 4 (OVERLAPS) 189/379 variables, 190/201 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 15/216 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:03:34] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:03:34] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-26 00:03:35] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-26 00:03:35] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:03:35] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-26 00:03:36] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 20/236 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:03:37] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-26 00:03:38] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-26 00:03:38] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-26 00:03:38] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:03:38] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-26 00:03:38] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-26 00:03:38] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 2 ms to minimize.
[2024-05-26 00:03:38] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:03:38] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-26 00:03:38] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-05-26 00:03:39] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-26 00:03:39] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:03:39] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:03:39] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:03:39] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-26 00:03:39] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-26 00:03:39] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-26 00:03:39] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 18/254 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:03:40] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-26 00:03:40] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 2/256 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 10 (OVERLAPS) 0/379 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 256 constraints, problems are : Problem set: 1 solved, 207 unsolved in 12456 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 190/190 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 1 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 6/190 variables, 6/14 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 37/51 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 189/379 variables, 190/241 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 15/256 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 207/463 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:03:47] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-26 00:03:47] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-26 00:03:49] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-26 00:03:49] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-26 00:03:49] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-26 00:03:49] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-26 00:03:49] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-26 00:03:49] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:03:49] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:03:49] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:03:49] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:03:49] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-26 00:03:49] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 13/476 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:03:53] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-26 00:03:53] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 2/478 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:03:54] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 1/479 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:04:00] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 1/480 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/480 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 14 (OVERLAPS) 0/379 variables, 0/480 constraints. Problems are: Problem set: 1 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 480 constraints, problems are : Problem set: 1 solved, 207 unsolved in 25704 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 190/190 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 207/208 constraints, Known Traps: 57/57 constraints]
After SMT, in 38246ms problems are : Problem set: 1 solved, 207 unsolved
Search for dead transitions found 1 dead transitions in 38249ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/190 places, 213/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38443 ms. Remains : 190/190 places, 213/214 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NeoElection-COL-6-LTLCardinality-01
Product exploration explored 100000 steps with 20913 reset in 379 ms.
Product exploration explored 100000 steps with 20919 reset in 296 ms.
Computed a total of 190 stabilizing places and 213 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 190 transition count 213
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)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 161 steps (0 resets) in 7 ms. (20 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p0) (NOT p2)))), (F p0), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 7 factoid took 478 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
[2024-05-26 00:04:12] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
// Phase 1: matrix 188 rows 190 cols
[2024-05-26 00:04:12] [INFO ] Computed 12 invariants in 4 ms
[2024-05-26 00:04:13] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-26 00:04:13] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-05-26 00:04:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 00:04:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-26 00:04:13] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-26 00:04:13] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 00:04:13] [INFO ] [Nat]Added 14 Read/Feed constraints in 6 ms returned sat
[2024-05-26 00:04:13] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-26 00:04:13] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-26 00:04:13] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-26 00:04:13] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-26 00:04:13] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-05-26 00:04:13] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-26 00:04:14] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-26 00:04:14] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-26 00:04:14] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:04:14] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:04:14] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-26 00:04:14] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-26 00:04:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-26 00:04:14] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 2 ms to minimize.
[2024-05-26 00:04:14] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-26 00:04:14] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1099 ms
[2024-05-26 00:04:14] [INFO ] Computed and/alt/rep : 201/495/176 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-26 00:04:14] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 126 out of 190 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 213/213 transitions.
Applied a total of 0 rules in 18 ms. Remains 190 /190 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-26 00:04:14] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
[2024-05-26 00:04:14] [INFO ] Invariant cache hit.
[2024-05-26 00:04:14] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-26 00:04:14] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
[2024-05-26 00:04:14] [INFO ] Invariant cache hit.
[2024-05-26 00:04:14] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 00:04:14] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-26 00:04:14] [INFO ] Redundant transitions in 10 ms returned []
Running 207 sub problems to find dead transitions.
[2024-05-26 00:04:14] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
[2024-05-26 00:04:14] [INFO ] Invariant cache hit.
[2024-05-26 00:04:14] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-26 00:04:16] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-26 00:04:16] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 188/378 variables, 190/204 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 14/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-26 00:04:19] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
[2024-05-26 00:04:19] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-26 00:04:19] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:04:19] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:04:19] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-26 00:04:19] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-26 00:04:19] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-26 00:04:19] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-26 00:04:19] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-26 00:04:19] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-26 00:04:20] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-26 00:04:20] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-26 00:04:20] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-26 00:04:20] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-26 00:04:20] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-26 00:04:20] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-26 00:04:20] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-26 00:04:20] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-26 00:04:20] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-26 00:04:20] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-26 00:04:21] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-26 00:04:22] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-26 00:04:23] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-26 00:04:23] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:04:23] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-26 00:04:23] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-26 00:04:23] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:04:23] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-26 00:04:25] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:04:25] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-26 00:04:25] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-26 00:04:25] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:04:25] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:04:25] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-26 00:04:25] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-26 00:04:26] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-26 00:04:30] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/378 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 15 (OVERLAPS) 0/378 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 272 constraints, problems are : Problem set: 0 solved, 207 unsolved in 19940 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 190/190 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 188/378 variables, 190/258 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 14/272 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 207/479 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-26 00:04:39] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 480 constraints, problems are : Problem set: 0 solved, 207 unsolved in 13952 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 190/190 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 57/57 constraints]
After SMT, in 34009ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 34011ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34202 ms. Remains : 190/190 places, 213/213 transitions.
Computed a total of 190 stabilizing places and 213 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 190 transition count 213
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)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 10 factoid took 429 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 174 steps (0 resets) in 6 ms. (24 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p0), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 701 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
[2024-05-26 00:04:50] [INFO ] Flow matrix only has 188 transitions (discarded 25 similar events)
[2024-05-26 00:04:50] [INFO ] Invariant cache hit.
[2024-05-26 00:04:50] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-26 00:04:51] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-26 00:04:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 00:04:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-26 00:04:51] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-26 00:04:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 00:04:51] [INFO ] [Nat]Added 14 Read/Feed constraints in 6 ms returned sat
[2024-05-26 00:04:51] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-26 00:04:51] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-26 00:04:51] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-05-26 00:04:51] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-26 00:04:51] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 3 ms to minimize.
[2024-05-26 00:04:52] [INFO ] Deduced a trap composed of 7 places in 624 ms of which 1 ms to minimize.
[2024-05-26 00:04:52] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-26 00:04:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1313 ms
[2024-05-26 00:04:52] [INFO ] Computed and/alt/rep : 201/495/176 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-26 00:04:52] [INFO ] Added : 0 causal constraints over 0 iterations in 41 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Product exploration explored 100000 steps with 20944 reset in 334 ms.
Product exploration explored 100000 steps with 20893 reset in 353 ms.
Built C files in :
/tmp/ltsmin3753961544308266992
[2024-05-26 00:04:53] [INFO ] Computing symmetric may disable matrix : 213 transitions.
[2024-05-26 00:04:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 00:04:53] [INFO ] Computing symmetric may enable matrix : 213 transitions.
[2024-05-26 00:04:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 00:04:53] [INFO ] Computing Do-Not-Accords matrix : 213 transitions.
[2024-05-26 00:04:53] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 00:04:53] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3753961544308266992
Running compilation step : cd /tmp/ltsmin3753961544308266992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 637 ms.
Running link step : cd /tmp/ltsmin3753961544308266992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3753961544308266992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4778003573722425116.hoa' '--buchi-type=spotba'
LTSmin run took 716 ms.
FORMULA NeoElection-COL-6-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-6-LTLCardinality-01 finished in 83249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)&&(G(p0)||F(p1))))))'
Support contains 162 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-26 00:04:55] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
// Phase 1: matrix 189 rows 190 cols
[2024-05-26 00:04:55] [INFO ] Computed 11 invariants in 2 ms
[2024-05-26 00:04:55] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-26 00:04:55] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 00:04:55] [INFO ] Invariant cache hit.
[2024-05-26 00:04:55] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-26 00:04:55] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-26 00:04:55] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 00:04:55] [INFO ] Invariant cache hit.
[2024-05-26 00:04:55] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 6/190 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Problem TDEAD35 is UNSAT
At refinement iteration 4 (OVERLAPS) 189/379 variables, 190/201 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 15/216 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:04:58] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-26 00:04:58] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
[2024-05-26 00:04:58] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-26 00:04:58] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:04:58] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-26 00:04:59] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-05-26 00:04:59] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-26 00:04:59] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-26 00:04:59] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:04:59] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-26 00:04:59] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-26 00:04:59] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:04:59] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-26 00:04:59] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-26 00:04:59] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-26 00:05:00] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:05:00] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:05:00] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-26 00:05:00] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:05:00] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 20/236 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:05:01] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-26 00:05:02] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-26 00:05:02] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-05-26 00:05:02] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-26 00:05:02] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-26 00:05:02] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:05:02] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-26 00:05:02] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
[2024-05-26 00:05:02] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-26 00:05:02] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-26 00:05:02] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-26 00:05:02] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-26 00:05:03] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 3 ms to minimize.
[2024-05-26 00:05:03] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 3 ms to minimize.
[2024-05-26 00:05:03] [INFO ] Deduced a trap composed of 8 places in 371 ms of which 1 ms to minimize.
[2024-05-26 00:05:03] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:05:04] [INFO ] Deduced a trap composed of 8 places in 771 ms of which 1 ms to minimize.
[2024-05-26 00:05:04] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 18/254 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:05:05] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-26 00:05:05] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 2/256 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 10 (OVERLAPS) 0/379 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 256 constraints, problems are : Problem set: 1 solved, 207 unsolved in 14353 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 190/190 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 1 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 6/190 variables, 6/14 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 37/51 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 189/379 variables, 190/241 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 15/256 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 207/463 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:05:12] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:05:12] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-26 00:05:14] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:05:14] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-26 00:05:14] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-26 00:05:14] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-26 00:05:14] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:05:14] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-26 00:05:14] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-26 00:05:14] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:05:14] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 2 ms to minimize.
[2024-05-26 00:05:14] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-26 00:05:15] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 13/476 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:05:18] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-26 00:05:18] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 2/478 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:05:20] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 1/479 constraints. Problems are: Problem set: 1 solved, 207 unsolved
[2024-05-26 00:05:25] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 1/480 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/480 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 14 (OVERLAPS) 0/379 variables, 0/480 constraints. Problems are: Problem set: 1 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 480 constraints, problems are : Problem set: 1 solved, 207 unsolved in 25872 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 190/190 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 207/208 constraints, Known Traps: 57/57 constraints]
After SMT, in 40324ms problems are : Problem set: 1 solved, 207 unsolved
Search for dead transitions found 1 dead transitions in 40326ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/190 places, 213/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40499 ms. Remains : 190/190 places, 213/214 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 61 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-6-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLCardinality-05 finished in 40700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Reduce places removed 6 places and 6 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 184 transition count 202
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 178 transition count 202
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 32 place count 158 transition count 172
Iterating global reduction 0 with 20 rules applied. Total rules applied 52 place count 158 transition count 172
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 112 place count 128 transition count 142
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 122 transition count 136
Applied a total of 118 rules in 47 ms. Remains 122 /190 variables (removed 68) and now considering 136/214 (removed 78) transitions.
[2024-05-26 00:05:35] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
// Phase 1: matrix 111 rows 122 cols
[2024-05-26 00:05:35] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 00:05:35] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-26 00:05:35] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2024-05-26 00:05:35] [INFO ] Invariant cache hit.
[2024-05-26 00:05:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 00:05:36] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-26 00:05:36] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-26 00:05:36] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2024-05-26 00:05:36] [INFO ] Invariant cache hit.
[2024-05-26 00:05:36] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 111/228 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Problem TDEAD98 is UNSAT
At refinement iteration 5 (OVERLAPS) 5/233 variables, 5/138 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/233 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 138 constraints, problems are : Problem set: 1 solved, 105 unsolved in 2126 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 122/122 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 111/228 variables, 117/128 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 5/133 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 105/238 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 5/233 variables, 5/243 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/243 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/233 variables, 0/243 constraints. Problems are: Problem set: 1 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 243 constraints, problems are : Problem set: 1 solved, 105 unsolved in 2944 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 122/122 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 105/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5116ms problems are : Problem set: 1 solved, 105 unsolved
Search for dead transitions found 1 dead transitions in 5121ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 122/190 places, 135/214 transitions.
Applied a total of 0 rules in 11 ms. Remains 122 /122 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-26 00:05:41] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 5452 ms. Remains : 122/190 places, 135/214 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLCardinality-06
Product exploration explored 100000 steps with 8752 reset in 390 ms.
Product exploration explored 100000 steps with 8746 reset in 388 ms.
Computed a total of 122 stabilizing places and 135 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 122 transition count 135
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)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 177 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-6-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-6-LTLCardinality-06 finished in 6722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p0&&G(p1)))||X(X(F(p0)))))'
Support contains 126 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 208
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 208
Applied a total of 12 rules in 5 ms. Remains 184 /190 variables (removed 6) and now considering 208/214 (removed 6) transitions.
[2024-05-26 00:05:42] [INFO ] Flow matrix only has 183 transitions (discarded 25 similar events)
// Phase 1: matrix 183 rows 184 cols
[2024-05-26 00:05:42] [INFO ] Computed 11 invariants in 9 ms
[2024-05-26 00:05:42] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-26 00:05:42] [INFO ] Flow matrix only has 183 transitions (discarded 25 similar events)
[2024-05-26 00:05:42] [INFO ] Invariant cache hit.
[2024-05-26 00:05:42] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-26 00:05:42] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-26 00:05:42] [INFO ] Flow matrix only has 183 transitions (discarded 25 similar events)
[2024-05-26 00:05:42] [INFO ] Invariant cache hit.
[2024-05-26 00:05:42] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 6/184 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Problem TDEAD35 is UNSAT
At refinement iteration 4 (OVERLAPS) 183/367 variables, 184/195 constraints. Problems are: Problem set: 1 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 15/210 constraints. Problems are: Problem set: 1 solved, 201 unsolved
[2024-05-26 00:05:45] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-26 00:05:45] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-26 00:05:45] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:05:45] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-26 00:05:45] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-26 00:05:45] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:05:46] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-26 00:05:46] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-26 00:05:46] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-26 00:05:46] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-26 00:05:46] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
[2024-05-26 00:05:46] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-26 00:05:46] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-26 00:05:47] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-26 00:05:47] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-26 00:05:47] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2024-05-26 00:05:47] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:05:47] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 3 ms to minimize.
[2024-05-26 00:05:47] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-26 00:05:47] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 20/230 constraints. Problems are: Problem set: 1 solved, 201 unsolved
[2024-05-26 00:05:48] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-26 00:05:48] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-26 00:05:48] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-26 00:05:48] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-26 00:05:48] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-26 00:05:48] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-26 00:05:48] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-26 00:05:48] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-26 00:05:48] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-26 00:05:48] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-26 00:05:48] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-26 00:05:49] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-26 00:05:49] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-26 00:05:49] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 14/244 constraints. Problems are: Problem set: 1 solved, 201 unsolved
[2024-05-26 00:05:50] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-26 00:05:50] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 2/246 constraints. Problems are: Problem set: 1 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/246 constraints. Problems are: Problem set: 1 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/246 constraints. Problems are: Problem set: 1 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 246 constraints, problems are : Problem set: 1 solved, 201 unsolved in 11326 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 184/184 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 1 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 6/184 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 36/47 constraints. Problems are: Problem set: 1 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 183/367 variables, 184/231 constraints. Problems are: Problem set: 1 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 15/246 constraints. Problems are: Problem set: 1 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 201/447 constraints. Problems are: Problem set: 1 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/447 constraints. Problems are: Problem set: 1 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/447 constraints. Problems are: Problem set: 1 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 447 constraints, problems are : Problem set: 1 solved, 201 unsolved in 9643 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 184/184 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 201/202 constraints, Known Traps: 36/36 constraints]
After SMT, in 21058ms problems are : Problem set: 1 solved, 201 unsolved
Search for dead transitions found 1 dead transitions in 21061ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 207/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21233 ms. Remains : 184/190 places, 207/214 transitions.
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-COL-6-LTLCardinality-08
Product exploration explored 100000 steps with 8262 reset in 281 ms.
Product exploration explored 100000 steps with 8264 reset in 296 ms.
Computed a total of 184 stabilizing places and 207 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 184 transition count 207
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)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 174 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 46 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 11 factoid took 212 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-26 00:06:05] [INFO ] Flow matrix only has 182 transitions (discarded 25 similar events)
// Phase 1: matrix 182 rows 184 cols
[2024-05-26 00:06:05] [INFO ] Computed 12 invariants in 4 ms
[2024-05-26 00:06:05] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-26 00:06:06] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-26 00:06:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 00:06:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-26 00:06:06] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-26 00:06:06] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 00:06:06] [INFO ] [Nat]Added 14 Read/Feed constraints in 8 ms returned sat
[2024-05-26 00:06:06] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-26 00:06:06] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:06:06] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-26 00:06:06] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:06:06] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-26 00:06:06] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-26 00:06:07] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-26 00:06:07] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-26 00:06:07] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:06:07] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:06:07] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-26 00:06:07] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:06:07] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:06:07] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:06:07] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:06:07] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:06:07] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:06:07] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-26 00:06:07] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-26 00:06:08] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-26 00:06:08] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-26 00:06:08] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-26 00:06:08] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-05-26 00:06:08] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:06:08] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-26 00:06:08] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:06:08] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:06:08] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-26 00:06:08] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:06:08] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-26 00:06:08] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-26 00:06:08] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 2234 ms
[2024-05-26 00:06:08] [INFO ] Computed and/alt/rep : 195/483/170 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-26 00:06:08] [INFO ] Added : 5 causal constraints over 1 iterations in 53 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 120 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 207/207 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2024-05-26 00:06:08] [INFO ] Flow matrix only has 182 transitions (discarded 25 similar events)
[2024-05-26 00:06:08] [INFO ] Invariant cache hit.
[2024-05-26 00:06:08] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-26 00:06:08] [INFO ] Flow matrix only has 182 transitions (discarded 25 similar events)
[2024-05-26 00:06:08] [INFO ] Invariant cache hit.
[2024-05-26 00:06:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 00:06:08] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-26 00:06:08] [INFO ] Flow matrix only has 182 transitions (discarded 25 similar events)
[2024-05-26 00:06:08] [INFO ] Invariant cache hit.
[2024-05-26 00:06:08] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 6/184 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-26 00:06:10] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 182/366 variables, 184/197 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 14/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-26 00:06:13] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 2 ms to minimize.
[2024-05-26 00:06:13] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-26 00:06:13] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:06:13] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-26 00:06:13] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-26 00:06:13] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-26 00:06:14] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-26 00:06:14] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-26 00:06:14] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-26 00:06:14] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-26 00:06:14] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-26 00:06:14] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-26 00:06:14] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-26 00:06:14] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-26 00:06:14] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-26 00:06:14] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-26 00:06:14] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:06:14] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-26 00:06:14] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-05-26 00:06:15] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-26 00:06:16] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-26 00:06:17] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:06:17] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-26 00:06:19] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (OVERLAPS) 0/366 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 235 constraints, problems are : Problem set: 0 solved, 201 unsolved in 14385 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 184/184 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 6/184 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 182/366 variables, 184/221 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 14/235 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 201/436 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-26 00:06:25] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-26 00:06:25] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-26 00:06:25] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-26 00:06:25] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-26 00:06:25] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 5/441 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-26 00:06:29] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:06:30] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 443 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16489 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 184/184 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 32/32 constraints]
After SMT, in 30955ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 30959ms
Finished structural reductions in LTL mode , in 1 iterations and 31109 ms. Remains : 184/184 places, 207/207 transitions.
Computed a total of 184 stabilizing places and 207 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 184 transition count 207
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)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 45 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-26 00:06:40] [INFO ] Flow matrix only has 182 transitions (discarded 25 similar events)
[2024-05-26 00:06:40] [INFO ] Invariant cache hit.
[2024-05-26 00:06:40] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-26 00:06:41] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-26 00:06:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 00:06:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-26 00:06:41] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-26 00:06:41] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 00:06:41] [INFO ] [Nat]Added 14 Read/Feed constraints in 6 ms returned sat
[2024-05-26 00:06:41] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-26 00:06:41] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:06:41] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:06:41] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-26 00:06:41] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-26 00:06:42] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:06:42] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:06:42] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-26 00:06:42] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-26 00:06:42] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:06:42] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-26 00:06:42] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-26 00:06:42] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:06:42] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:06:42] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:06:42] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:06:42] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-26 00:06:42] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-26 00:06:43] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:06:43] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:06:43] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:06:43] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1620 ms
[2024-05-26 00:06:43] [INFO ] Computed and/alt/rep : 195/483/170 causal constraints (skipped 6 transitions) in 11 ms.
[2024-05-26 00:06:43] [INFO ] Added : 6 causal constraints over 2 iterations in 71 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8271 reset in 265 ms.
Product exploration explored 100000 steps with 8264 reset in 350 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 120 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 207/207 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 184 transition count 207
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 6 place count 184 transition count 207
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 184 transition count 207
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 184 transition count 207
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 178 transition count 201
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 178 transition count 201
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 30 rules in 28 ms. Remains 178 /184 variables (removed 6) and now considering 201/207 (removed 6) transitions.
[2024-05-26 00:06:44] [INFO ] Redundant transitions in 1 ms returned []
Running 195 sub problems to find dead transitions.
[2024-05-26 00:06:44] [INFO ] Flow matrix only has 176 transitions (discarded 25 similar events)
// Phase 1: matrix 176 rows 178 cols
[2024-05-26 00:06:44] [INFO ] Computed 12 invariants in 0 ms
[2024-05-26 00:06:44] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 6/178 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-26 00:06:45] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-26 00:06:45] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-26 00:06:45] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-26 00:06:45] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-26 00:06:45] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-26 00:06:45] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-26 00:06:45] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 7/19 constraints. Problems are: Problem set: 12 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/19 constraints. Problems are: Problem set: 12 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 176/354 variables, 178/197 constraints. Problems are: Problem set: 12 solved, 183 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 134/331 constraints. Problems are: Problem set: 12 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/331 constraints. Problems are: Problem set: 12 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/331 constraints. Problems are: Problem set: 12 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 331 constraints, problems are : Problem set: 12 solved, 183 unsolved in 5825 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 178/178 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 12 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 5/5 constraints. Problems are: Problem set: 12 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 12 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 18/178 variables, 7/12 constraints. Problems are: Problem set: 12 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 7/19 constraints. Problems are: Problem set: 12 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/19 constraints. Problems are: Problem set: 12 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 176/354 variables, 178/197 constraints. Problems are: Problem set: 12 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 134/331 constraints. Problems are: Problem set: 12 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 183/514 constraints. Problems are: Problem set: 12 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/514 constraints. Problems are: Problem set: 12 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/514 constraints. Problems are: Problem set: 12 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 514 constraints, problems are : Problem set: 12 solved, 183 unsolved in 5285 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 178/178 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 183/195 constraints, Known Traps: 7/7 constraints]
After SMT, in 11135ms problems are : Problem set: 12 solved, 183 unsolved
Search for dead transitions found 12 dead transitions in 11138ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 178/184 places, 189/207 transitions.
Graph (complete) has 516 edges and 178 vertex of which 166 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Discarding 12 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 166 /178 variables (removed 12) and now considering 189/189 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 166/184 places, 189/207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11189 ms. Remains : 166/184 places, 189/207 transitions.
Built C files in :
/tmp/ltsmin6172084755131328543
[2024-05-26 00:06:55] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6172084755131328543
Running compilation step : cd /tmp/ltsmin6172084755131328543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 413 ms.
Running link step : cd /tmp/ltsmin6172084755131328543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6172084755131328543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6979230114231593956.hoa' '--buchi-type=spotba'
LTSmin run took 855 ms.
FORMULA NeoElection-COL-6-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-6-LTLCardinality-08 finished in 74322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(!p0)))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Reduce places removed 6 places and 6 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 158 transition count 172
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 158 transition count 172
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 100 place count 134 transition count 148
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 128 transition count 142
Applied a total of 106 rules in 30 ms. Remains 128 /190 variables (removed 62) and now considering 142/214 (removed 72) transitions.
[2024-05-26 00:06:56] [INFO ] Flow matrix only has 117 transitions (discarded 25 similar events)
// Phase 1: matrix 117 rows 128 cols
[2024-05-26 00:06:56] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 00:06:56] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-26 00:06:56] [INFO ] Flow matrix only has 117 transitions (discarded 25 similar events)
[2024-05-26 00:06:56] [INFO ] Invariant cache hit.
[2024-05-26 00:06:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 00:06:57] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-26 00:06:57] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-26 00:06:57] [INFO ] Flow matrix only has 117 transitions (discarded 25 similar events)
[2024-05-26 00:06:57] [INFO ] Invariant cache hit.
[2024-05-26 00:06:57] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 6/128 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Problem TDEAD15 is UNSAT
At refinement iteration 4 (OVERLAPS) 117/245 variables, 128/139 constraints. Problems are: Problem set: 1 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 5/144 constraints. Problems are: Problem set: 1 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 144 constraints, problems are : Problem set: 1 solved, 135 unsolved in 2597 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 128/128 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 6/128 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 117/245 variables, 128/139 constraints. Problems are: Problem set: 1 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 5/144 constraints. Problems are: Problem set: 1 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 135/279 constraints. Problems are: Problem set: 1 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 279 constraints, problems are : Problem set: 1 solved, 135 unsolved in 3448 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 128/128 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 135/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 6092ms problems are : Problem set: 1 solved, 135 unsolved
Search for dead transitions found 1 dead transitions in 6094ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 128/190 places, 141/214 transitions.
Applied a total of 0 rules in 15 ms. Remains 128 /128 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-05-26 00:07:03] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 6344 ms. Remains : 128/190 places, 141/214 transitions.
Stuttering acceptance computed with spot in 91 ms :[false, p0]
Running random walk in product with property : NeoElection-COL-6-LTLCardinality-15
Product exploration explored 100000 steps with 23182 reset in 176 ms.
Product exploration explored 100000 steps with 23229 reset in 185 ms.
Computed a total of 128 stabilizing places and 141 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 transition count 141
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)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be false thanks to negative knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-6-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-6-LTLCardinality-15 finished in 6973 ms.
All properties solved by simple procedures.
Total runtime 237519 ms.

BK_STOP 1716682024199

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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