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.r245-tall-171654349900460.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 greatspnxred
Input is NeoElection-COL-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349900460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 11 18:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 11 18:23 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.6K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 18:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 18:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 18:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:40 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 81K 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-4-LTLFireability-00
FORMULA_NAME NeoElection-COL-4-LTLFireability-01
FORMULA_NAME NeoElection-COL-4-LTLFireability-02
FORMULA_NAME NeoElection-COL-4-LTLFireability-03
FORMULA_NAME NeoElection-COL-4-LTLFireability-04
FORMULA_NAME NeoElection-COL-4-LTLFireability-05
FORMULA_NAME NeoElection-COL-4-LTLFireability-06
FORMULA_NAME NeoElection-COL-4-LTLFireability-07
FORMULA_NAME NeoElection-COL-4-LTLFireability-08
FORMULA_NAME NeoElection-COL-4-LTLFireability-09
FORMULA_NAME NeoElection-COL-4-LTLFireability-10
FORMULA_NAME NeoElection-COL-4-LTLFireability-11
FORMULA_NAME NeoElection-COL-4-LTLFireability-12
FORMULA_NAME NeoElection-COL-4-LTLFireability-13
FORMULA_NAME NeoElection-COL-4-LTLFireability-14
FORMULA_NAME NeoElection-COL-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716668152111

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 20:15:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 20:15:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 20:15:53] [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-25 20:15:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 20:15:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 600 ms
[2024-05-25 20:15:54] [INFO ] Detected 6 constant HL places corresponding to 870 PT places.
[2024-05-25 20:15:54] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 1830 PT places and 3990.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 20:15:54] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 6 ms.
[2024-05-25 20:15:54] [INFO ] Skeletonized 11 HLPN properties in 1 ms. Removed 5 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-4-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Remains 9 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-4-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 125 steps (3 resets) in 12 ms. (9 steps per ms) remains 0/5 properties
[2024-05-25 20:15:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-25 20:15:54] [INFO ] Flatten gal took : 13 ms
FORMULA NeoElection-COL-4-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 20:15:54] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Domain [M(5), POS(4), M(5)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 4)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-25 20:15:54] [INFO ] Unfolded HLPN to a Petri net with 1830 places and 1984 transitions 11141 arcs in 79 ms.
[2024-05-25 20:15:54] [INFO ] Unfolded 13 HLPN properties in 2 ms.
Deduced a syphon composed of 1687 places in 7 ms
Reduce places removed 1703 places and 1857 transitions.
Reduce places removed 5 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA NeoElection-COL-4-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 127/127 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 110 transition count 127
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 26 place count 96 transition count 82
Iterating global reduction 1 with 14 rules applied. Total rules applied 40 place count 96 transition count 82
Applied a total of 40 rules in 19 ms. Remains 96 /122 variables (removed 26) and now considering 82/127 (removed 45) transitions.
[2024-05-25 20:15:54] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 96 cols
[2024-05-25 20:15:54] [INFO ] Computed 23 invariants in 9 ms
[2024-05-25 20:15:54] [INFO ] Implicit Places using invariants in 203 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 236 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/122 places, 82/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 266 ms. Remains : 80/122 places, 82/127 transitions.
Support contains 50 out of 80 places after structural reductions.
[2024-05-25 20:15:54] [INFO ] Flatten gal took : 12 ms
[2024-05-25 20:15:54] [INFO ] Flatten gal took : 12 ms
[2024-05-25 20:15:54] [INFO ] Input system was already deterministic with 82 transitions.
Reduction of identical properties reduced properties to check from 9 to 7
RANDOM walk for 146 steps (0 resets) in 19 ms. (7 steps per ms) remains 0/7 properties
Computed a total of 80 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 80 transition count 82
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((F(p0)&&X(F(p1)))))'
Support contains 8 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 78
Applied a total of 8 rules in 4 ms. Remains 76 /80 variables (removed 4) and now considering 78/82 (removed 4) transitions.
[2024-05-25 20:15:55] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2024-05-25 20:15:55] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 20:15:55] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-25 20:15:55] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-25 20:15:55] [INFO ] Invariant cache hit.
[2024-05-25 20:15:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 20:15:55] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-25 20:15:55] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-25 20:15:55] [INFO ] Invariant cache hit.
[2024-05-25 20:15:55] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD8 is UNSAT
At refinement iteration 4 (OVERLAPS) 69/145 variables, 76/83 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 3/86 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 11 ms to minimize.
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-25 20:15:56] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 14/100 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 20:15:57] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-25 20:15:57] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 2/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 102 constraints, problems are : Problem set: 1 solved, 73 unsolved in 2718 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 1 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 16/23 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 69/145 variables, 76/99 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 3/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 73/175 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 20:15:59] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 1/176 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 176 constraints, problems are : Problem set: 1 solved, 73 unsolved in 2375 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/74 constraints, Known Traps: 17/17 constraints]
After SMT, in 5164ms problems are : Problem set: 1 solved, 73 unsolved
Search for dead transitions found 1 dead transitions in 5176ms
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 : 76/80 places, 77/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5336 ms. Remains : 76/80 places, 77/82 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-02
Product exploration explored 100000 steps with 16271 reset in 207 ms.
Product exploration explored 100000 steps with 16149 reset in 154 ms.
Computed a total of 76 stabilizing places and 77 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 77
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) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-4-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-4-LTLFireability-02 finished in 6090 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' '!(F(p0))'
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Reduce places removed 4 places and 4 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 76 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 72 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 68 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 68 transition count 70
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 60 transition count 62
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 56 transition count 58
Applied a total of 36 rules in 37 ms. Remains 56 /80 variables (removed 24) and now considering 58/82 (removed 24) transitions.
[2024-05-25 20:16:01] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 56 cols
[2024-05-25 20:16:01] [INFO ] Computed 7 invariants in 2 ms
[2024-05-25 20:16:01] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-25 20:16:01] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-25 20:16:01] [INFO ] Invariant cache hit.
[2024-05-25 20:16:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 20:16:01] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-25 20:16:01] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-25 20:16:01] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-25 20:16:01] [INFO ] Invariant cache hit.
[2024-05-25 20:16:01] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem TDEAD4 is UNSAT
At refinement iteration 4 (OVERLAPS) 49/105 variables, 56/63 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 3/66 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 66 constraints, problems are : Problem set: 1 solved, 53 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 49/105 variables, 56/63 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 3/66 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 53/119 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 119 constraints, problems are : Problem set: 1 solved, 53 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 53/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 1376ms problems are : Problem set: 1 solved, 53 unsolved
Search for dead transitions found 1 dead transitions in 1377ms
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 : 56/80 places, 57/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-05-25 20:16:02] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1546 ms. Remains : 56/80 places, 57/82 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-03
Product exploration explored 100000 steps with 6616 reset in 262 ms.
Product exploration explored 100000 steps with 6636 reset in 233 ms.
Computed a total of 56 stabilizing places and 57 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 57
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 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 57 steps (0 resets) in 12 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-25 20:16:03] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 56 cols
[2024-05-25 20:16:03] [INFO ] Computed 8 invariants in 3 ms
[2024-05-25 20:16:03] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 20:16:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-25 20:16:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:16:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 20:16:03] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-25 20:16:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 20:16:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-25 20:16:03] [INFO ] Computed and/alt/rep : 53/105/44 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 20:16:03] [INFO ] Added : 21 causal constraints over 5 iterations in 41 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 16 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 57/57 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-05-25 20:16:03] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 20:16:03] [INFO ] Invariant cache hit.
[2024-05-25 20:16:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-25 20:16:03] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 20:16:03] [INFO ] Invariant cache hit.
[2024-05-25 20:16:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 20:16:03] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-25 20:16:03] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-25 20:16:03] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 20:16:03] [INFO ] Invariant cache hit.
[2024-05-25 20:16:03] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 66 constraints, problems are : Problem set: 0 solved, 53 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 53/119 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 119 constraints, problems are : Problem set: 0 solved, 53 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1491ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1492ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1588 ms. Remains : 56/56 places, 57/57 transitions.
Computed a total of 56 stabilizing places and 57 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 57
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 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 63 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-25 20:16:05] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 20:16:05] [INFO ] Invariant cache hit.
[2024-05-25 20:16:05] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 20:16:05] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 20:16:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:16:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 20:16:05] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-25 20:16:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 20:16:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-25 20:16:05] [INFO ] Computed and/alt/rep : 53/105/44 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 20:16:05] [INFO ] Added : 25 causal constraints over 5 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6643 reset in 212 ms.
Product exploration explored 100000 steps with 6611 reset in 221 ms.
Support contains 16 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 57/57 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-05-25 20:16:06] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 20:16:06] [INFO ] Invariant cache hit.
[2024-05-25 20:16:06] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-25 20:16:06] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 20:16:06] [INFO ] Invariant cache hit.
[2024-05-25 20:16:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 20:16:06] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-25 20:16:06] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-25 20:16:06] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2024-05-25 20:16:06] [INFO ] Invariant cache hit.
[2024-05-25 20:16:06] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 66 constraints, problems are : Problem set: 0 solved, 53 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 4/56 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 53/119 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 119 constraints, problems are : Problem set: 0 solved, 53 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1291ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1295ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1395 ms. Remains : 56/56 places, 57/57 transitions.
Treatment of property NeoElection-COL-4-LTLFireability-03 finished in 6769 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(X(F((X(F(p1))&&p0)))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 78
Applied a total of 8 rules in 3 ms. Remains 76 /80 variables (removed 4) and now considering 78/82 (removed 4) transitions.
[2024-05-25 20:16:07] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2024-05-25 20:16:07] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 20:16:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-25 20:16:07] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-25 20:16:07] [INFO ] Invariant cache hit.
[2024-05-25 20:16:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 20:16:07] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-25 20:16:07] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-25 20:16:07] [INFO ] Invariant cache hit.
[2024-05-25 20:16:07] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD8 is UNSAT
At refinement iteration 4 (OVERLAPS) 69/145 variables, 76/83 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 3/86 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 20:16:08] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-25 20:16:08] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-25 20:16:08] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
[2024-05-25 20:16:08] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 2 ms to minimize.
[2024-05-25 20:16:08] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-25 20:16:08] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-25 20:16:08] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-25 20:16:08] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-25 20:16:08] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-25 20:16:09] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 4 ms to minimize.
[2024-05-25 20:16:09] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-25 20:16:09] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-25 20:16:09] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-25 20:16:09] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 14/100 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 20:16:09] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-25 20:16:09] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 2/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 102 constraints, problems are : Problem set: 1 solved, 73 unsolved in 2109 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 1 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 16/23 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 69/145 variables, 76/99 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 3/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 73/175 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 20:16:10] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 1/176 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 176 constraints, problems are : Problem set: 1 solved, 73 unsolved in 1905 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/74 constraints, Known Traps: 17/17 constraints]
After SMT, in 4039ms problems are : Problem set: 1 solved, 73 unsolved
Search for dead transitions found 1 dead transitions in 4040ms
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 : 76/80 places, 77/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4172 ms. Remains : 76/80 places, 77/82 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-04
Product exploration explored 100000 steps with 25000 reset in 77 ms.
Product exploration explored 100000 steps with 25000 reset in 82 ms.
Computed a total of 76 stabilizing places and 77 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 77
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 p1 p0), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-4-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-4-LTLFireability-04 finished in 4539 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' '!(F(G(p0)))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Reduce places removed 4 places and 4 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 76 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 72 transition count 74
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 32 place count 60 transition count 62
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 56 transition count 58
Applied a total of 36 rules in 14 ms. Remains 56 /80 variables (removed 24) and now considering 58/82 (removed 24) transitions.
[2024-05-25 20:16:12] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 56 cols
[2024-05-25 20:16:12] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 20:16:12] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-25 20:16:12] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-25 20:16:12] [INFO ] Invariant cache hit.
[2024-05-25 20:16:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 20:16:12] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-25 20:16:12] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-25 20:16:12] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-25 20:16:12] [INFO ] Invariant cache hit.
[2024-05-25 20:16:12] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 49/102 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem TDEAD34 is UNSAT
At refinement iteration 5 (OVERLAPS) 3/105 variables, 3/66 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 66 constraints, problems are : Problem set: 1 solved, 45 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 49/102 variables, 53/60 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 3/63 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 45/108 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 3/105 variables, 3/111 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 111 constraints, problems are : Problem set: 1 solved, 45 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 45/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 1303ms problems are : Problem set: 1 solved, 45 unsolved
Search for dead transitions found 1 dead transitions in 1305ms
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 : 56/80 places, 57/82 transitions.
Applied a total of 0 rules in 6 ms. Remains 56 /56 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-05-25 20:16:13] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1433 ms. Remains : 56/80 places, 57/82 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-05
Product exploration explored 100000 steps with 1030 reset in 499 ms.
Product exploration explored 100000 steps with 1030 reset in 380 ms.
Computed a total of 56 stabilizing places and 57 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 57
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 true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-4-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-4-LTLFireability-05 finished in 2421 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' '!(F(G(p0)))'
Support contains 26 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Reduce places removed 4 places and 4 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 72 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 72 transition count 74
Applied a total of 8 rules in 5 ms. Remains 72 /80 variables (removed 8) and now considering 74/82 (removed 8) transitions.
[2024-05-25 20:16:14] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
// Phase 1: matrix 65 rows 72 cols
[2024-05-25 20:16:14] [INFO ] Computed 7 invariants in 4 ms
[2024-05-25 20:16:14] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-25 20:16:14] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2024-05-25 20:16:14] [INFO ] Invariant cache hit.
[2024-05-25 20:16:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 20:16:14] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-25 20:16:14] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-25 20:16:14] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2024-05-25 20:16:14] [INFO ] Invariant cache hit.
[2024-05-25 20:16:14] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Problem TDEAD8 is UNSAT
At refinement iteration 4 (OVERLAPS) 65/137 variables, 72/79 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 3/82 constraints. Problems are: Problem set: 1 solved, 69 unsolved
[2024-05-25 20:16:15] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 15 ms to minimize.
[2024-05-25 20:16:15] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-25 20:16:15] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-25 20:16:15] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-25 20:16:15] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-25 20:16:15] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-25 20:16:15] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-25 20:16:15] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-25 20:16:15] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 2 ms to minimize.
[2024-05-25 20:16:15] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-25 20:16:15] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-25 20:16:15] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 12/94 constraints. Problems are: Problem set: 1 solved, 69 unsolved
[2024-05-25 20:16:16] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-25 20:16:16] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-25 20:16:16] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 3/97 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 69 unsolved
[2024-05-25 20:16:16] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/137 variables, 1/98 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 98 constraints, problems are : Problem set: 1 solved, 69 unsolved in 2197 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 1 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 16/23 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 65/137 variables, 72/95 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 3/98 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 69/167 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 69 unsolved
[2024-05-25 20:16:18] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/137 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 168 constraints, problems are : Problem set: 1 solved, 69 unsolved in 2232 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 69/70 constraints, Known Traps: 17/17 constraints]
After SMT, in 4446ms problems are : Problem set: 1 solved, 69 unsolved
Search for dead transitions found 1 dead transitions in 4446ms
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 : 72/80 places, 73/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 72 /72 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2024-05-25 20:16:19] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 4565 ms. Remains : 72/80 places, 73/82 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-06
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 2 ms.
FORMULA NeoElection-COL-4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-06 finished in 4607 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' '!(F(G((X(X(p1))||p0))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-25 20:16:19] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 80 cols
[2024-05-25 20:16:19] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 20:16:19] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-25 20:16:19] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2024-05-25 20:16:19] [INFO ] Invariant cache hit.
[2024-05-25 20:16:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 20:16:19] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-25 20:16:19] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2024-05-25 20:16:19] [INFO ] Invariant cache hit.
[2024-05-25 20:16:19] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 4/80 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Problem TDEAD8 is UNSAT
At refinement iteration 4 (OVERLAPS) 73/153 variables, 80/87 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 3/90 constraints. Problems are: Problem set: 1 solved, 77 unsolved
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 15/105 constraints. Problems are: Problem set: 1 solved, 77 unsolved
[2024-05-25 20:16:20] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-25 20:16:21] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-25 20:16:21] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-25 20:16:21] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 4/109 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/153 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 109 constraints, problems are : Problem set: 1 solved, 77 unsolved in 2231 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 80/80 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 1 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 4/80 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 19/26 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 73/153 variables, 80/106 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 3/109 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 77/186 constraints. Problems are: Problem set: 1 solved, 77 unsolved
[2024-05-25 20:16:22] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 1/187 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 187 constraints, problems are : Problem set: 1 solved, 77 unsolved in 2075 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 80/80 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 77/78 constraints, Known Traps: 20/20 constraints]
After SMT, in 4322ms problems are : Problem set: 1 solved, 77 unsolved
Search for dead transitions found 1 dead transitions in 4322ms
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 : 80/80 places, 81/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4438 ms. Remains : 80/80 places, 81/82 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-09
Stuttering criterion allowed to conclude after 365 steps with 11 reset in 1 ms.
FORMULA NeoElection-COL-4-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-09 finished in 4569 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' '!(F(G(p0)))'
Support contains 22 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Reduce places removed 4 places and 4 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 76 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 72 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 68 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 68 transition count 70
Applied a total of 16 rules in 9 ms. Remains 68 /80 variables (removed 12) and now considering 70/82 (removed 12) transitions.
[2024-05-25 20:16:23] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 68 cols
[2024-05-25 20:16:23] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 20:16:24] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-25 20:16:24] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2024-05-25 20:16:24] [INFO ] Invariant cache hit.
[2024-05-25 20:16:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 20:16:24] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-25 20:16:24] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-25 20:16:24] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2024-05-25 20:16:24] [INFO ] Invariant cache hit.
[2024-05-25 20:16:24] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 4/68 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Problem TDEAD4 is UNSAT
At refinement iteration 4 (OVERLAPS) 61/129 variables, 68/75 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 3/78 constraints. Problems are: Problem set: 1 solved, 65 unsolved
[2024-05-25 20:16:24] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-25 20:16:24] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-25 20:16:24] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-25 20:16:24] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-25 20:16:24] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-25 20:16:24] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-25 20:16:24] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-25 20:16:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-25 20:16:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-25 20:16:24] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-25 20:16:24] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 11/89 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 89 constraints, problems are : Problem set: 1 solved, 65 unsolved in 1272 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 1 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 4/68 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 11/18 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 61/129 variables, 68/86 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 3/89 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 65/154 constraints. Problems are: Problem set: 1 solved, 65 unsolved
[2024-05-25 20:16:26] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/155 constraints. Problems are: Problem set: 1 solved, 65 unsolved
[2024-05-25 20:16:26] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-25 20:16:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-25 20:16:26] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 3/158 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 158 constraints, problems are : Problem set: 1 solved, 65 unsolved in 1927 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 65/66 constraints, Known Traps: 15/15 constraints]
After SMT, in 3220ms problems are : Problem set: 1 solved, 65 unsolved
Search for dead transitions found 1 dead transitions in 3221ms
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 : 68/80 places, 69/82 transitions.
Applied a total of 0 rules in 8 ms. Remains 68 /68 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-05-25 20:16:27] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 3334 ms. Remains : 68/80 places, 69/82 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-11
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-4-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-11 finished in 3375 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(p0)))'
Support contains 22 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 78
Applied a total of 8 rules in 3 ms. Remains 76 /80 variables (removed 4) and now considering 78/82 (removed 4) transitions.
[2024-05-25 20:16:27] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2024-05-25 20:16:27] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 20:16:27] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-25 20:16:27] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-25 20:16:27] [INFO ] Invariant cache hit.
[2024-05-25 20:16:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 20:16:27] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-25 20:16:27] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-25 20:16:27] [INFO ] Invariant cache hit.
[2024-05-25 20:16:27] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD8 is UNSAT
At refinement iteration 4 (OVERLAPS) 69/145 variables, 76/83 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 3/86 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 14/100 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-25 20:16:28] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 2/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 102 constraints, problems are : Problem set: 1 solved, 73 unsolved in 2040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 1 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 16/23 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 69/145 variables, 76/99 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 3/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 73/175 constraints. Problems are: Problem set: 1 solved, 73 unsolved
[2024-05-25 20:16:30] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 1/176 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 176 constraints, problems are : Problem set: 1 solved, 73 unsolved in 1928 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/74 constraints, Known Traps: 17/17 constraints]
After SMT, in 3985ms problems are : Problem set: 1 solved, 73 unsolved
Search for dead transitions found 1 dead transitions in 3985ms
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 : 76/80 places, 77/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4073 ms. Remains : 76/80 places, 77/82 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-14 finished in 4194 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' '!(F(p0))'
[2024-05-25 20:16:31] [INFO ] Flatten gal took : 11 ms
[2024-05-25 20:16:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-25 20:16:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 80 places, 82 transitions and 323 arcs took 4 ms.
Total runtime 38477 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running NeoElection-COL-4

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/423/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 80
TRANSITIONS: 82
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


SAVING FILE /home/mcc/execution/423/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1219
MODEL NAME: /home/mcc/execution/423/model
80 places, 82 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA NeoElection-COL-4-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716668393467

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-COL-4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is NeoElection-COL-4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654349900460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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