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-171654351700468.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351700468
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME NeoElection-COL-5-LTLFireability-01
FORMULA_NAME NeoElection-COL-5-LTLFireability-02
FORMULA_NAME NeoElection-COL-5-LTLFireability-03
FORMULA_NAME NeoElection-COL-5-LTLFireability-04
FORMULA_NAME NeoElection-COL-5-LTLFireability-05
FORMULA_NAME NeoElection-COL-5-LTLFireability-06
FORMULA_NAME NeoElection-COL-5-LTLFireability-07
FORMULA_NAME NeoElection-COL-5-LTLFireability-08
FORMULA_NAME NeoElection-COL-5-LTLFireability-09
FORMULA_NAME NeoElection-COL-5-LTLFireability-10
FORMULA_NAME NeoElection-COL-5-LTLFireability-11
FORMULA_NAME NeoElection-COL-5-LTLFireability-12
FORMULA_NAME NeoElection-COL-5-LTLFireability-13
FORMULA_NAME NeoElection-COL-5-LTLFireability-14
FORMULA_NAME NeoElection-COL-5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717238769057

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
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:46:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:46:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:46:10] [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:46:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 10:46:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 614 ms
[2024-06-01 10:46:10] [INFO ] Detected 6 constant HL places corresponding to 1500 PT places.
[2024-06-01 10:46:10] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 3090 PT places and 7716.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 10:46:11] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 4 ms.
[2024-06-01 10:46:11] [INFO ] Skeletonized 11 HLPN properties in 2 ms. Removed 5 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-COL-5-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-13 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 6 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-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 97 steps (2 resets) in 21 ms. (4 steps per ms) remains 0/2 properties
[2024-06-01 10:46:11] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 10:46:11] [INFO ] Flatten gal took : 12 ms
FORMULA NeoElection-COL-5-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:46:11] [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:46:11] [INFO ] Unfolded HLPN to a Petri net with 3090 places and 4024 transitions 22762 arcs in 175 ms.
[2024-06-01 10:46:11] [INFO ] Unfolded 12 HLPN properties in 2 ms.
Deduced a syphon composed of 2866 places in 21 ms
Reduce places removed 2891 places and 3788 transitions.
Reduce places removed 6 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-COL-5-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 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 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 34 place count 159 transition count 177
Iterating global reduction 1 with 14 rules applied. Total rules applied 48 place count 159 transition count 177
Applied a total of 48 rules in 32 ms. Remains 159 /193 variables (removed 34) and now considering 177/236 (removed 59) transitions.
[2024-06-01 10:46:11] [INFO ] Flow matrix only has 161 transitions (discarded 16 similar events)
// Phase 1: matrix 161 rows 159 cols
[2024-06-01 10:46:11] [INFO ] Computed 34 invariants in 27 ms
[2024-06-01 10:46:12] [INFO ] Implicit Places using invariants in 361 ms returned [13, 14, 15, 16, 17, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 437 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/193 places, 177/236 transitions.
Applied a total of 0 rules in 10 ms. Remains 138 /138 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 502 ms. Remains : 138/193 places, 177/236 transitions.
Support contains 51 out of 138 places after structural reductions.
[2024-06-01 10:46:12] [INFO ] Flatten gal took : 31 ms
[2024-06-01 10:46:12] [INFO ] Flatten gal took : 23 ms
[2024-06-01 10:46:12] [INFO ] Input system was already deterministic with 177 transitions.
RANDOM walk for 417 steps (0 resets) in 40 ms. (10 steps per ms) remains 0/2 properties
Computed a total of 138 stabilizing places and 177 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 138 transition count 177
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 30 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 177/177 transitions.
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 132 transition count 171
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 132 transition count 166
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 127 transition count 166
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 124 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 123 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 122 transition count 162
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 20 place count 122 transition count 158
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 28 place count 118 transition count 158
Applied a total of 28 rules in 50 ms. Remains 118 /138 variables (removed 20) and now considering 158/177 (removed 19) transitions.
[2024-06-01 10:46:12] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2024-06-01 10:46:12] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 10:46:12] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 10:46:12] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2024-06-01 10:46:12] [INFO ] Invariant cache hit.
[2024-06-01 10:46:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 10:46:12] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-06-01 10:46:12] [INFO ] Redundant transitions in 6 ms returned []
Running 154 sub problems to find dead transitions.
[2024-06-01 10:46:12] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2024-06-01 10:46:12] [INFO ] Invariant cache hit.
[2024-06-01 10:46:12] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 4/118 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 5 (OVERLAPS) 142/260 variables, 118/130 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 13/143 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/143 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/260 variables, 0/143 constraints. Problems are: Problem set: 4 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 143 constraints, problems are : Problem set: 4 solved, 150 unsolved in 4005 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/8 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 4/118 variables, 4/12 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 142/260 variables, 118/130 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 13/143 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 150/293 constraints. Problems are: Problem set: 4 solved, 150 unsolved
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 7 ms to minimize.
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:46:19] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:46:20] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 15/308 constraints. Problems are: Problem set: 4 solved, 150 unsolved
[2024-06-01 10:46:21] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 1/309 constraints. Problems are: Problem set: 4 solved, 150 unsolved
[2024-06-01 10:46:23] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
[2024-06-01 10:46:23] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:46:23] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:46:23] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:46:23] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:46:23] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:46:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:46:23] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 8/317 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/317 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/260 variables, 0/317 constraints. Problems are: Problem set: 4 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 317 constraints, problems are : Problem set: 4 solved, 150 unsolved in 11159 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 150/154 constraints, Known Traps: 24/24 constraints]
After SMT, in 15324ms problems are : Problem set: 4 solved, 150 unsolved
Search for dead transitions found 4 dead transitions in 15336ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 118/138 places, 154/177 transitions.
Applied a total of 0 rules in 16 ms. Remains 118 /118 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2024-06-01 10:46:28] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 15752 ms. Remains : 118/138 places, 154/177 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-08
Product exploration explored 100000 steps with 2771 reset in 597 ms.
Product exploration explored 100000 steps with 2813 reset in 592 ms.
Computed a total of 118 stabilizing places and 154 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 154
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 86 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 31 ms :[(NOT p0)]
RANDOM walk for 130 steps (0 resets) in 12 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 118 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-06-01 10:46:29] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
// Phase 1: matrix 138 rows 118 cols
[2024-06-01 10:46:29] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 10:46:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 10:46:30] [INFO ] [Real]Absence check using 8 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-01 10:46:30] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-01 10:46:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:46:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 10:46:30] [INFO ] [Nat]Absence check using 8 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-01 10:46:30] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 10:46:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 10:46:30] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2024-06-01 10:46:30] [INFO ] Computed and/alt/rep : 146/434/130 causal constraints (skipped 4 transitions) in 12 ms.
[2024-06-01 10:46:30] [INFO ] Added : 66 causal constraints over 14 iterations in 282 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 30 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 154/154 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2024-06-01 10:46:30] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-06-01 10:46:30] [INFO ] Invariant cache hit.
[2024-06-01 10:46:30] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 10:46:30] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-06-01 10:46:30] [INFO ] Invariant cache hit.
[2024-06-01 10:46:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 10:46:31] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-06-01 10:46:31] [INFO ] Redundant transitions in 4 ms returned []
Running 150 sub problems to find dead transitions.
[2024-06-01 10:46:31] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-06-01 10:46:31] [INFO ] Invariant cache hit.
[2024-06-01 10:46:31] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 4/118 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 138/256 variables, 118/131 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 10:46:34] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:46:34] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:46:34] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:46:34] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:46:34] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:46:34] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:46:34] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 10:46:34] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:46:34] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:46:34] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 10:46:34] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 8 ms to minimize.
[2024-06-01 10:46:34] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 10:46:35] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/256 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 153 constraints, problems are : Problem set: 0 solved, 150 unsolved in 6175 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 118/118 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 4/118 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 138/256 variables, 118/144 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 9/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 150/303 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 10:46:39] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-06-01 10:46:39] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 10:46:41] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:46:41] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 10:46:42] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 10:46:46] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/256 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/256 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 17 (OVERLAPS) 0/256 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 309 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13233 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 118/118 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 19/19 constraints]
After SMT, in 19526ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19529ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19785 ms. Remains : 118/118 places, 154/154 transitions.
Computed a total of 118 stabilizing places and 154 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 154
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 100 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 52 ms :[(NOT p0)]
RANDOM walk for 130 steps (0 resets) in 11 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 156 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
[2024-06-01 10:46:51] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-06-01 10:46:51] [INFO ] Invariant cache hit.
[2024-06-01 10:46:51] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 10:46:51] [INFO ] [Real]Absence check using 8 positive and 5 generalized place invariants in 6 ms returned sat
[2024-06-01 10:46:51] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-01 10:46:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:46:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 10:46:51] [INFO ] [Nat]Absence check using 8 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-01 10:46:51] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-01 10:46:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 10:46:51] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2024-06-01 10:46:51] [INFO ] Computed and/alt/rep : 146/434/130 causal constraints (skipped 4 transitions) in 12 ms.
[2024-06-01 10:46:51] [INFO ] Added : 56 causal constraints over 12 iterations in 162 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2773 reset in 531 ms.
Product exploration explored 100000 steps with 2788 reset in 549 ms.
Support contains 30 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 154/154 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2024-06-01 10:46:53] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-06-01 10:46:53] [INFO ] Invariant cache hit.
[2024-06-01 10:46:53] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 10:46:53] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-06-01 10:46:53] [INFO ] Invariant cache hit.
[2024-06-01 10:46:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 10:46:53] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-06-01 10:46:53] [INFO ] Redundant transitions in 2 ms returned []
Running 150 sub problems to find dead transitions.
[2024-06-01 10:46:53] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-06-01 10:46:53] [INFO ] Invariant cache hit.
[2024-06-01 10:46:53] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 4/118 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 138/256 variables, 118/131 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 10:46:55] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:46:55] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:46:55] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:46:55] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:46:56] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:46:56] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:46:56] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:46:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:46:56] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:46:56] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:46:56] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:46:56] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 10:46:57] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/256 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 153 constraints, problems are : Problem set: 0 solved, 150 unsolved in 5430 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 118/118 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 4/118 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 138/256 variables, 118/144 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 9/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 150/303 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 10:47:01] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:47:01] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 10:47:02] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:47:02] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 10:47:04] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 10:47:07] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/256 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/256 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 17 (OVERLAPS) 0/256 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 309 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13228 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 118/118 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 19/19 constraints]
After SMT, in 18729ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 18732ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18905 ms. Remains : 118/118 places, 154/154 transitions.
Treatment of property NeoElection-COL-5-LTLFireability-08 finished in 59705 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 25 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 177/177 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 120 transition count 123
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 120 transition count 123
Applied a total of 36 rules in 4 ms. Remains 120 /138 variables (removed 18) and now considering 123/177 (removed 54) transitions.
[2024-06-01 10:47:12] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 120 cols
[2024-06-01 10:47:12] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 10:47:12] [INFO ] Implicit Places using invariants in 52 ms returned [13, 14, 15, 16]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/138 places, 123/177 transitions.
Applied a total of 0 rules in 2 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 62 ms. Remains : 116/138 places, 123/177 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-10
Entered a terminal (fully accepting) state of product in 40 steps with 0 reset in 14 ms.
FORMULA NeoElection-COL-5-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-5-LTLFireability-10 finished in 168 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:47:12] [INFO ] Flatten gal took : 26 ms
[2024-06-01 10:47:12] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2024-06-01 10:47:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 177 transitions and 788 arcs took 3 ms.
Total runtime 62237 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA NeoElection-COL-5-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717238945948

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2024
ltl formula name NeoElection-COL-5-LTLFireability-08
ltl formula formula --ltl=/tmp/860/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 138 places, 177 transitions and 788 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.020 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/860/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/860/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/860/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/860/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 140 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 139, there are 258 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( 2/ 4): ~144 levels ~10000 states ~65168 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~20000 states ~92312 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~40000 states ~140808 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~80000 states ~249648 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~160000 states ~441504 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~320000 states ~847764 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~640000 states ~1854616 transitions
pnml2lts-mc( 2/ 4): ~144 levels ~1280000 states ~3785948 transitions
pnml2lts-mc( 0/ 4): ~165 levels ~2560000 states ~7753712 transitions
pnml2lts-mc( 3/ 4): ~174 levels ~5120000 states ~15364632 transitions
pnml2lts-mc( 3/ 4): ~174 levels ~10240000 states ~31684724 transitions
pnml2lts-mc( 2/ 4): ~159 levels ~20480000 states ~72252232 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33551364
pnml2lts-mc( 0/ 4): unique states count: 33551974
pnml2lts-mc( 0/ 4): unique transitions count: 120933650
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 87348997
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33551981
pnml2lts-mc( 0/ 4): - cum. max stack depth: 720
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33551981 states 120936352 transitions, fanout: 3.604
pnml2lts-mc( 0/ 4): Total exploration time 112.480 sec (112.470 sec minimum, 112.475 sec on average)
pnml2lts-mc( 0/ 4): States per second: 298293, Transitions per second: 1075181
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 269.8MB, 8.4 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/21.0%
pnml2lts-mc( 0/ 4): Stored 177 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 269.8MB (~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="LTLFireability"
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 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 r508-tall-171654351700468"
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 [ "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 ;