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.r508-tall-171654351700467.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 ltsminxred
Input is NeoElection-COL-5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351700467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.8K Apr 11 18:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 18:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 18:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 18:34 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.3K 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.9K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 19:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 11 19:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 19:29 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 89K 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-5-LTLCardinality-00
FORMULA_NAME NeoElection-COL-5-LTLCardinality-01
FORMULA_NAME NeoElection-COL-5-LTLCardinality-02
FORMULA_NAME NeoElection-COL-5-LTLCardinality-03
FORMULA_NAME NeoElection-COL-5-LTLCardinality-04
FORMULA_NAME NeoElection-COL-5-LTLCardinality-05
FORMULA_NAME NeoElection-COL-5-LTLCardinality-06
FORMULA_NAME NeoElection-COL-5-LTLCardinality-07
FORMULA_NAME NeoElection-COL-5-LTLCardinality-08
FORMULA_NAME NeoElection-COL-5-LTLCardinality-09
FORMULA_NAME NeoElection-COL-5-LTLCardinality-10
FORMULA_NAME NeoElection-COL-5-LTLCardinality-11
FORMULA_NAME NeoElection-COL-5-LTLCardinality-12
FORMULA_NAME NeoElection-COL-5-LTLCardinality-13
FORMULA_NAME NeoElection-COL-5-LTLCardinality-14
FORMULA_NAME NeoElection-COL-5-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717238711217

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:45:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:45:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:45:12] [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-06-01 10:45:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 10:45:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 593 ms
[2024-06-01 10:45:13] [INFO ] Detected 6 constant HL places corresponding to 1500 PT places.
[2024-06-01 10:45:13] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 3090 PT places and 7716.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 10:45:13] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2024-06-01 10:45:13] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA NeoElection-COL-5-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Remains 11 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-5-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 280 steps (9 resets) in 13 ms. (20 steps per ms) remains 0/4 properties
[2024-06-01 10:45:13] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 10:45:13] [INFO ] Flatten gal took : 11 ms
[2024-06-01 10:45:13] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA NeoElection-COL-5-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:45:13] [INFO ] Flatten gal took : 2 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(6), POS(5), M(6)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 5)]] 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-06-01 10:45:13] [INFO ] Unfolded HLPN to a Petri net with 3090 places and 4024 transitions 22762 arcs in 127 ms.
[2024-06-01 10:45:13] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Deduced a syphon composed of 2866 places in 14 ms
Reduce places removed 2891 places and 3788 transitions.
Reduce places removed 6 places and 0 transitions.
Support contains 15 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 236/236 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 173 transition count 236
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 52 place count 141 transition count 123
Iterating global reduction 1 with 32 rules applied. Total rules applied 84 place count 141 transition count 123
Applied a total of 84 rules in 23 ms. Remains 141 /193 variables (removed 52) and now considering 123/236 (removed 113) transitions.
[2024-06-01 10:45:13] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 141 cols
[2024-06-01 10:45:13] [INFO ] Computed 34 invariants in 16 ms
[2024-06-01 10:45:13] [INFO ] Implicit Places using invariants in 244 ms returned [13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 271 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/193 places, 123/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 311 ms. Remains : 116/193 places, 123/236 transitions.
Support contains 15 out of 116 places after structural reductions.
[2024-06-01 10:45:13] [INFO ] Flatten gal took : 18 ms
[2024-06-01 10:45:13] [INFO ] Flatten gal took : 15 ms
[2024-06-01 10:45:13] [INFO ] Input system was already deterministic with 123 transitions.
RANDOM walk for 255 steps (0 resets) in 16 ms. (15 steps per ms) remains 0/3 properties
Computed a total of 116 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116 transition count 123
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' '!(F(p0))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 123/123 transitions.
Reduce places removed 5 places and 5 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 111 transition count 113
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 106 transition count 113
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 40 place count 91 transition count 98
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 45 place count 86 transition count 93
Applied a total of 45 rules in 29 ms. Remains 86 /116 variables (removed 30) and now considering 93/123 (removed 30) transitions.
[2024-06-01 10:45:14] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2024-06-01 10:45:14] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 10:45:14] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 10:45:14] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
[2024-06-01 10:45:14] [INFO ] Invariant cache hit.
[2024-06-01 10:45:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 10:45:14] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-06-01 10:45:14] [INFO ] Redundant transitions in 1 ms returned []
Running 88 sub problems to find dead transitions.
[2024-06-01 10:45:14] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
[2024-06-01 10:45:14] [INFO ] Invariant cache hit.
[2024-06-01 10:45:14] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD7 is UNSAT
At refinement iteration 4 (OVERLAPS) 77/163 variables, 86/95 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 4/99 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 99 constraints, problems are : Problem set: 1 solved, 87 unsolved in 1388 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 77/163 variables, 86/95 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 4/99 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 87/186 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 186 constraints, problems are : Problem set: 1 solved, 87 unsolved in 1507 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 87/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 2963ms problems are : Problem set: 1 solved, 87 unsolved
Search for dead transitions found 1 dead transitions in 2970ms
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 : 86/116 places, 92/123 transitions.
Applied a total of 0 rules in 8 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 10:45:17] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 3217 ms. Remains : 86/116 places, 92/123 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLCardinality-07
Product exploration explored 100000 steps with 6346 reset in 341 ms.
Product exploration explored 100000 steps with 6214 reset in 280 ms.
Computed a total of 86 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 92
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 68 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 119 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2024-06-01 10:45:18] [INFO ] Flow matrix only has 76 transitions (discarded 16 similar events)
// Phase 1: matrix 76 rows 86 cols
[2024-06-01 10:45:18] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 10:45:18] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 10:45:18] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 10:45:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:45:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-01 10:45:18] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 10:45:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 10:45:18] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:45:18] [INFO ] Computed and/alt/rep : 87/175/71 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 10:45:18] [INFO ] Added : 39 causal constraints over 8 iterations in 64 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 10:45:18] [INFO ] Flow matrix only has 76 transitions (discarded 16 similar events)
[2024-06-01 10:45:18] [INFO ] Invariant cache hit.
[2024-06-01 10:45:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 10:45:18] [INFO ] Flow matrix only has 76 transitions (discarded 16 similar events)
[2024-06-01 10:45:18] [INFO ] Invariant cache hit.
[2024-06-01 10:45:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 10:45:18] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-06-01 10:45:18] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2024-06-01 10:45:18] [INFO ] Flow matrix only has 76 transitions (discarded 16 similar events)
[2024-06-01 10:45:18] [INFO ] Invariant cache hit.
[2024-06-01 10:45:18] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 76/162 variables, 86/96 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 99 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1214 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 86/86 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 76/162 variables, 86/96 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 87/186 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 186 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1411 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 86/86 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
After SMT, in 2657ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 2658ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2800 ms. Remains : 86/86 places, 92/92 transitions.
Computed a total of 86 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 92
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 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 44 ms :[(NOT p0)]
RANDOM walk for 78 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 115 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-06-01 10:45:21] [INFO ] Flow matrix only has 76 transitions (discarded 16 similar events)
[2024-06-01 10:45:21] [INFO ] Invariant cache hit.
[2024-06-01 10:45:21] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-01 10:45:21] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 10:45:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:45:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-01 10:45:22] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 10:45:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 10:45:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:45:22] [INFO ] Computed and/alt/rep : 87/175/71 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 10:45:22] [INFO ] Added : 48 causal constraints over 10 iterations in 77 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6201 reset in 222 ms.
Product exploration explored 100000 steps with 6107 reset in 268 ms.
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 15 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 10:45:22] [INFO ] Flow matrix only has 76 transitions (discarded 16 similar events)
[2024-06-01 10:45:22] [INFO ] Invariant cache hit.
[2024-06-01 10:45:22] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 10:45:22] [INFO ] Flow matrix only has 76 transitions (discarded 16 similar events)
[2024-06-01 10:45:22] [INFO ] Invariant cache hit.
[2024-06-01 10:45:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 10:45:22] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-06-01 10:45:22] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2024-06-01 10:45:22] [INFO ] Flow matrix only has 76 transitions (discarded 16 similar events)
[2024-06-01 10:45:22] [INFO ] Invariant cache hit.
[2024-06-01 10:45:22] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 76/162 variables, 86/96 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 99 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1220 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 86/86 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 76/162 variables, 86/96 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 87/186 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 186 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 86/86 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
After SMT, in 2648ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 2649ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2777 ms. Remains : 86/86 places, 92/92 transitions.
Treatment of property NeoElection-COL-5-LTLCardinality-07 finished in 11452 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 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 123/123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 116 transition count 118
Reduce places removed 5 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 111 transition count 113
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 20 place count 106 transition count 113
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 20 place count 106 transition count 108
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 30 place count 101 transition count 108
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 60 place count 86 transition count 93
Applied a total of 60 rules in 13 ms. Remains 86 /116 variables (removed 30) and now considering 93/123 (removed 30) transitions.
[2024-06-01 10:45:25] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2024-06-01 10:45:25] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 10:45:25] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 10:45:25] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
[2024-06-01 10:45:25] [INFO ] Invariant cache hit.
[2024-06-01 10:45:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 10:45:25] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-06-01 10:45:25] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2024-06-01 10:45:25] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
[2024-06-01 10:45:25] [INFO ] Invariant cache hit.
[2024-06-01 10:45:25] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD58 is UNSAT
At refinement iteration 4 (OVERLAPS) 77/163 variables, 86/95 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 72/167 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 167 constraints, problems are : Problem set: 1 solved, 87 unsolved in 1308 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 77/163 variables, 86/95 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 72/167 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 87/254 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 254 constraints, problems are : Problem set: 1 solved, 87 unsolved in 1218 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 87/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 2543ms problems are : Problem set: 1 solved, 87 unsolved
Search for dead transitions found 1 dead transitions in 2545ms
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 : 86/116 places, 92/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 10:45:28] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 2720 ms. Remains : 86/116 places, 92/123 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLCardinality-10
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-5-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-5-LTLCardinality-10 finished in 2765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 123/123 transitions.
Reduce places removed 5 places and 5 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 96 transition count 103
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 35 place count 91 transition count 98
Applied a total of 35 rules in 13 ms. Remains 91 /116 variables (removed 25) and now considering 98/123 (removed 25) transitions.
[2024-06-01 10:45:28] [INFO ] Flow matrix only has 82 transitions (discarded 16 similar events)
// Phase 1: matrix 82 rows 91 cols
[2024-06-01 10:45:28] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 10:45:28] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 10:45:28] [INFO ] Flow matrix only has 82 transitions (discarded 16 similar events)
[2024-06-01 10:45:28] [INFO ] Invariant cache hit.
[2024-06-01 10:45:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 10:45:28] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-06-01 10:45:28] [INFO ] Redundant transitions in 1 ms returned []
Running 93 sub problems to find dead transitions.
[2024-06-01 10:45:28] [INFO ] Flow matrix only has 82 transitions (discarded 16 similar events)
[2024-06-01 10:45:28] [INFO ] Invariant cache hit.
[2024-06-01 10:45:28] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 5/91 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 82/173 variables, 91/100 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 4/104 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/173 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 104 constraints, problems are : Problem set: 1 solved, 92 unsolved in 1335 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 91/91 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 5/91 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 82/173 variables, 91/100 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 4/104 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 92/196 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/173 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 196 constraints, problems are : Problem set: 1 solved, 92 unsolved in 1711 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 91/91 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 92/93 constraints, Known Traps: 0/0 constraints]
After SMT, in 3079ms problems are : Problem set: 1 solved, 92 unsolved
Search for dead transitions found 1 dead transitions in 3080ms
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 : 91/116 places, 97/123 transitions.
Applied a total of 0 rules in 7 ms. Remains 91 /91 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-06-01 10:45:31] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 3255 ms. Remains : 91/116 places, 97/123 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLCardinality-11
Product exploration explored 100000 steps with 2933 reset in 257 ms.
Product exploration explored 100000 steps with 2877 reset in 286 ms.
Computed a total of 91 stabilizing places and 97 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 91 transition count 97
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 (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 10 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-5-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-5-LTLCardinality-11 finished in 3924 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-06-01 10:45:32] [INFO ] Flatten gal took : 16 ms
[2024-06-01 10:45:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 10:45:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 123 transitions and 510 arcs took 4 ms.
Total runtime 20007 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA NeoElection-COL-5-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717238796837

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name NeoElection-COL-5-LTLCardinality-07
ltl formula formula --ltl=/tmp/705/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 116 places, 123 transitions and 510 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/705/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/705/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/705/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/705/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 118 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 117, there are 124 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~274 levels ~10000 states ~24060 transitions
pnml2lts-mc( 1/ 4): ~274 levels ~20000 states ~55332 transitions
pnml2lts-mc( 1/ 4): ~274 levels ~40000 states ~112340 transitions
pnml2lts-mc( 1/ 4): ~274 levels ~80000 states ~238324 transitions
pnml2lts-mc( 2/ 4): ~273 levels ~160000 states ~521696 transitions
pnml2lts-mc( 1/ 4): ~274 levels ~320000 states ~1019228 transitions
pnml2lts-mc( 1/ 4): ~274 levels ~640000 states ~2081768 transitions
pnml2lts-mc( 1/ 4): ~274 levels ~1280000 states ~4241844 transitions
pnml2lts-mc( 1/ 4): ~274 levels ~2560000 states ~8747480 transitions
pnml2lts-mc( 2/ 4): ~273 levels ~5120000 states ~19274932 transitions
pnml2lts-mc( 2/ 4): ~273 levels ~10240000 states ~40532524 transitions
pnml2lts-mc( 2/ 4): ~273 levels ~20480000 states ~81303672 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33550683
pnml2lts-mc( 0/ 4): unique states count: 33551596
pnml2lts-mc( 0/ 4): unique transitions count: 137444042
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 103889652
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33551605
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1095
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33551605 states 137444085 transitions, fanout: 4.096
pnml2lts-mc( 0/ 4): Total exploration time 63.680 sec (63.670 sec minimum, 63.677 sec on average)
pnml2lts-mc( 0/ 4): States per second: 526878, Transitions per second: 2158356
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.6MB, 8.1 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 123 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.6MB (~256.0MB paged-in)

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-5"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is NeoElection-COL-5, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654351700467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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