Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r265-smll-167863539700164.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is NeoElection-COL-8, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539700164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 12K Feb 26 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 17:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 17:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 20:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 20:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 19:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 19:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 120K Mar 5 18:23 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-8-LTLFireability-00
FORMULA_NAME NeoElection-COL-8-LTLFireability-01
FORMULA_NAME NeoElection-COL-8-LTLFireability-02
FORMULA_NAME NeoElection-COL-8-LTLFireability-03
FORMULA_NAME NeoElection-COL-8-LTLFireability-04
FORMULA_NAME NeoElection-COL-8-LTLFireability-05
FORMULA_NAME NeoElection-COL-8-LTLFireability-06
FORMULA_NAME NeoElection-COL-8-LTLFireability-07
FORMULA_NAME NeoElection-COL-8-LTLFireability-08
FORMULA_NAME NeoElection-COL-8-LTLFireability-09
FORMULA_NAME NeoElection-COL-8-LTLFireability-10
FORMULA_NAME NeoElection-COL-8-LTLFireability-11
FORMULA_NAME NeoElection-COL-8-LTLFireability-12
FORMULA_NAME NeoElection-COL-8-LTLFireability-13
FORMULA_NAME NeoElection-COL-8-LTLFireability-14
FORMULA_NAME NeoElection-COL-8-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678801621776

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-8
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 13:47:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 13:47:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:47:04] [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.
[2023-03-14 13:47:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 13:47:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 960 ms
[2023-03-14 13:47:05] [INFO ] Detected 6 constant HL places corresponding to 5058 PT places.
[2023-03-14 13:47:05] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 10062 PT places and 34578.0 transition bindings in 44 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 13:47:05] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 7 ms.
[2023-03-14 13:47:05] [INFO ] Skeletonized 11 HLPN properties in 2 ms. Removed 5 properties that had guard overlaps.
Initial state reduction rules removed 3 formulas.
FORMULA NeoElection-COL-8-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-14 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.2 ms
Remains 8 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-8-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Finished random walk after 50 steps, including 1 resets, run visited all 2 properties in 9 ms. (steps per millisecond=5 )
[2023-03-14 13:47:05] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2023-03-14 13:47:05] [INFO ] Flatten gal took : 22 ms
[2023-03-14 13:47:05] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA NeoElection-COL-8-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 13:47:05] [INFO ] Flatten gal took : 2 ms
Domain [M(9), POS(8), M(9)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 8)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-14 13:47:06] [INFO ] Unfolded HLPN to a Petri net with 10062 places and 19858 transitions 113083 arcs in 388 ms.
[2023-03-14 13:47:06] [INFO ] Unfolded 8 HLPN properties in 8 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 9487 places in 53 ms
Reduce places removed 9551 places and 18965 transitions.
Reduce places removed 9 places and 0 transitions.
FORMULA NeoElection-COL-8-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 331 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 893/893 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 446 transition count 893
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 91 place count 411 transition count 579
Iterating global reduction 1 with 35 rules applied. Total rules applied 126 place count 411 transition count 579
Applied a total of 126 rules in 48 ms. Remains 411 /502 variables (removed 91) and now considering 579/893 (removed 314) transitions.
[2023-03-14 13:47:06] [INFO ] Flow matrix only has 530 transitions (discarded 49 similar events)
// Phase 1: matrix 530 rows 411 cols
[2023-03-14 13:47:06] [INFO ] Computed 79 place invariants in 50 ms
[2023-03-14 13:47:07] [INFO ] Implicit Places using invariants in 471 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 532 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 410/502 places, 579/893 transitions.
Applied a total of 0 rules in 9 ms. Remains 410 /410 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 591 ms. Remains : 410/502 places, 579/893 transitions.
Support contains 331 out of 410 places after structural reductions.
[2023-03-14 13:47:07] [INFO ] Flatten gal took : 115 ms
[2023-03-14 13:47:07] [INFO ] Flatten gal took : 106 ms
[2023-03-14 13:47:07] [INFO ] Input system was already deterministic with 579 transitions.
Finished random walk after 891 steps, including 1 resets, run visited all 5 properties in 73 ms. (steps per millisecond=12 )
Computed a total of 410 stabilizing places and 579 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 410 transition count 579
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 196 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 579/579 transitions.
Drop transitions 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 410 transition count 578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 409 transition count 578
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2 place count 409 transition count 570
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 401 transition count 570
Applied a total of 18 rules in 69 ms. Remains 401 /410 variables (removed 9) and now considering 570/579 (removed 9) transitions.
[2023-03-14 13:47:08] [INFO ] Flow matrix only has 521 transitions (discarded 49 similar events)
// Phase 1: matrix 521 rows 401 cols
[2023-03-14 13:47:08] [INFO ] Computed 78 place invariants in 14 ms
[2023-03-14 13:47:08] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-14 13:47:08] [INFO ] Flow matrix only has 521 transitions (discarded 49 similar events)
[2023-03-14 13:47:08] [INFO ] Invariant cache hit.
[2023-03-14 13:47:08] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-14 13:47:09] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
[2023-03-14 13:47:09] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-14 13:47:09] [INFO ] Flow matrix only has 521 transitions (discarded 49 similar events)
[2023-03-14 13:47:09] [INFO ] Invariant cache hit.
[2023-03-14 13:47:09] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/410 places, 570/579 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1583 ms. Remains : 401/410 places, 570/579 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-8-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s113 1) (GEQ s394 1)) (AND (GEQ s59 1) (GEQ s367 1)) (AND (GEQ s71 1) (GEQ s373 1)) (AND (GEQ s41 1) (GEQ s358 1)) (AND (GEQ s24 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 594 steps with 1 reset in 26 ms.
FORMULA NeoElection-COL-8-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-8-LTLFireability-01 finished in 1891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 78 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 579/579 transitions.
Reduce places removed 8 places and 8 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 394 transition count 571
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 8 place count 394 transition count 563
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 24 place count 386 transition count 563
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 87 place count 323 transition count 302
Iterating global reduction 1 with 63 rules applied. Total rules applied 150 place count 323 transition count 302
Applied a total of 150 rules in 57 ms. Remains 323 /410 variables (removed 87) and now considering 302/579 (removed 277) transitions.
[2023-03-14 13:47:09] [INFO ] Flow matrix only has 253 transitions (discarded 49 similar events)
// Phase 1: matrix 253 rows 323 cols
[2023-03-14 13:47:09] [INFO ] Computed 70 place invariants in 10 ms
[2023-03-14 13:47:10] [INFO ] Implicit Places using invariants in 324 ms returned [14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 339 ms to find 55 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 268/410 places, 302/579 transitions.
Applied a total of 0 rules in 18 ms. Remains 268 /268 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 415 ms. Remains : 268/410 places, 302/579 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-8-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s12 1) (LT s151 1) (LT s202 1)) (OR (LT s13 1) (LT s161 1) (LT s202 1)) (OR (LT s181 1) (LT s203 1)) (OR (LT s5 1) (LT s59 1) (LT s198 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2291 reset in 1519 ms.
Product exploration explored 100000 steps with 2291 reset in 1483 ms.
Computed a total of 268 stabilizing places and 302 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 268 transition count 302
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 p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 114 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-8-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-8-LTLFireability-02 finished in 3842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 72 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 579/579 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 347 transition count 318
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 347 transition count 318
Applied a total of 126 rules in 16 ms. Remains 347 /410 variables (removed 63) and now considering 318/579 (removed 261) transitions.
[2023-03-14 13:47:13] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
// Phase 1: matrix 269 rows 347 cols
[2023-03-14 13:47:13] [INFO ] Computed 78 place invariants in 6 ms
[2023-03-14 13:47:13] [INFO ] Implicit Places using invariants in 290 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84]
Discarding 63 places :
Implicit Place search using SMT only with invariants took 292 ms to find 63 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 284/410 places, 318/579 transitions.
Applied a total of 0 rules in 5 ms. Remains 284 /284 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 314 ms. Remains : 284/410 places, 318/579 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NeoElection-COL-8-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s39 1) (GEQ s204 1)) (AND (GEQ s95 1) (GEQ s207 1)) (AND (GEQ s45 1) (GEQ s205 1)) (AND (GEQ s105 1) (GEQ s207 1)) (AND (GEQ s150 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 593 ms.
Product exploration explored 100000 steps with 50000 reset in 551 ms.
Computed a total of 284 stabilizing places and 318 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 284 transition count 318
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 10 factoid took 172 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-8-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-8-LTLFireability-05 finished in 1947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 141 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 579/579 transitions.
Applied a total of 0 rules in 9 ms. Remains 410 /410 variables (removed 0) and now considering 579/579 (removed 0) transitions.
[2023-03-14 13:47:15] [INFO ] Flow matrix only has 530 transitions (discarded 49 similar events)
// Phase 1: matrix 530 rows 410 cols
[2023-03-14 13:47:15] [INFO ] Computed 78 place invariants in 10 ms
[2023-03-14 13:47:15] [INFO ] Implicit Places using invariants in 293 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125]
Discarding 56 places :
Implicit Place search using SMT only with invariants took 298 ms to find 56 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 354/410 places, 579/579 transitions.
Applied a total of 0 rules in 6 ms. Remains 354 /354 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 315 ms. Remains : 354/410 places, 579/579 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeoElection-COL-8-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s88 1) (GEQ s274 1)) (AND (GEQ s145 1) (GEQ s277 1)) (AND (GEQ s94 1) (GEQ s275 1)) (AND (GEQ s157 1) (GEQ s277 1)) (AND (GEQ s208 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1396 ms.
Product exploration explored 100000 steps with 50000 reset in 1402 ms.
Computed a total of 354 stabilizing places and 579 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 354 transition count 579
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 7 factoid took 129 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-8-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-8-LTLFireability-08 finished in 3619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(X(X(F(p0))))))'
Support contains 84 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 579/579 transitions.
Applied a total of 0 rules in 5 ms. Remains 410 /410 variables (removed 0) and now considering 579/579 (removed 0) transitions.
[2023-03-14 13:47:19] [INFO ] Flow matrix only has 530 transitions (discarded 49 similar events)
[2023-03-14 13:47:19] [INFO ] Invariant cache hit.
[2023-03-14 13:47:19] [INFO ] Implicit Places using invariants in 314 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125]
Discarding 56 places :
Implicit Place search using SMT only with invariants took 317 ms to find 56 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 354/410 places, 579/579 transitions.
Applied a total of 0 rules in 4 ms. Remains 354 /354 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 328 ms. Remains : 354/410 places, 579/579 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, p0, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-8-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s33 1) (LT s123 1) (LT s276 1)) (OR (LT s38 1) (LT s143 1) (LT s277 1)) (OR (LT s63 1) (LT s225 1) (LT s280 1)) (OR (LT s51 1) (LT s194 1)...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1019 reset in 3351 ms.
Product exploration explored 100000 steps with 1021 reset in 3422 ms.
Computed a total of 354 stabilizing places and 579 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 354 transition count 579
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 p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Finished random walk after 196 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 239 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 :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
[2023-03-14 13:47:27] [INFO ] Flow matrix only has 530 transitions (discarded 49 similar events)
// Phase 1: matrix 530 rows 354 cols
[2023-03-14 13:47:27] [INFO ] Computed 22 place invariants in 11 ms
[2023-03-14 13:47:30] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-14 13:47:30] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-14 13:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:47:30] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2023-03-14 13:47:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 13:47:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-14 13:47:33] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-14 13:47:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 13:47:34] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-14 13:47:34] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 13:47:34] [INFO ] [Nat]Added 43 Read/Feed constraints in 31 ms returned sat
[2023-03-14 13:47:34] [INFO ] Computed and/alt/rep : 437/1173/430 causal constraints (skipped 92 transitions) in 57 ms.
[2023-03-14 13:47:35] [INFO ] Added : 174 causal constraints over 35 iterations in 1622 ms. Result :sat
Could not prove EG p0
Support contains 84 out of 354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 354/354 places, 579/579 transitions.
Reduce places removed 8 places and 8 transitions.
Drop transitions 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 346 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 345 transition count 570
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2 place count 345 transition count 562
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 337 transition count 562
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 331 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 330 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 329 transition count 555
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 32 place count 329 transition count 548
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 46 place count 322 transition count 548
Applied a total of 46 rules in 67 ms. Remains 322 /354 variables (removed 32) and now considering 548/579 (removed 31) transitions.
[2023-03-14 13:47:35] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
// Phase 1: matrix 499 rows 322 cols
[2023-03-14 13:47:35] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-14 13:47:36] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-14 13:47:36] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
[2023-03-14 13:47:36] [INFO ] Invariant cache hit.
[2023-03-14 13:47:36] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 13:47:36] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2023-03-14 13:47:36] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-14 13:47:36] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
[2023-03-14 13:47:36] [INFO ] Invariant cache hit.
[2023-03-14 13:47:37] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/354 places, 548/579 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1299 ms. Remains : 322/354 places, 548/579 transitions.
Computed a total of 322 stabilizing places and 548 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 322 transition count 548
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 p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 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 37 ms :[p0]
Finished random walk after 111 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=18 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 175 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 :[p0]
Stuttering acceptance computed with spot in 36 ms :[p0]
[2023-03-14 13:47:37] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
[2023-03-14 13:47:37] [INFO ] Invariant cache hit.
[2023-03-14 13:47:40] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-14 13:47:40] [INFO ] [Real]Absence check using 14 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-14 13:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:47:40] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2023-03-14 13:47:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 13:47:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-14 13:47:43] [INFO ] [Nat]Absence check using 14 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-14 13:47:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 13:47:43] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2023-03-14 13:47:43] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 13:47:43] [INFO ] [Nat]Added 43 Read/Feed constraints in 34 ms returned sat
[2023-03-14 13:47:44] [INFO ] Computed and/alt/rep : 420/1167/407 causal constraints (skipped 85 transitions) in 47 ms.
[2023-03-14 13:47:45] [INFO ] Added : 157 causal constraints over 32 iterations in 1385 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 42 ms :[p0]
Product exploration explored 100000 steps with 1328 reset in 2903 ms.
Product exploration explored 100000 steps with 1348 reset in 2912 ms.
Support contains 84 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 548/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 322 /322 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-14 13:47:51] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
[2023-03-14 13:47:51] [INFO ] Invariant cache hit.
[2023-03-14 13:47:51] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-14 13:47:51] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
[2023-03-14 13:47:51] [INFO ] Invariant cache hit.
[2023-03-14 13:47:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 13:47:52] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2023-03-14 13:47:52] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-14 13:47:52] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
[2023-03-14 13:47:52] [INFO ] Invariant cache hit.
[2023-03-14 13:47:52] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1202 ms. Remains : 322/322 places, 548/548 transitions.
Treatment of property NeoElection-COL-8-LTLFireability-12 finished in 33414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(X(X(F(p0))))))'
Found a Shortening insensitive property : NeoElection-COL-8-LTLFireability-12
Stuttering acceptance computed with spot in 199 ms :[true, p0, (NOT p0), (NOT p0), (NOT p0)]
Support contains 84 out of 410 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 410/410 places, 579/579 transitions.
Reduce places removed 8 places and 8 transitions.
Ensure Unique test removed 8 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 394 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 393 transition count 570
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 10 place count 393 transition count 562
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 26 place count 385 transition count 562
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 384 transition count 561
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 383 transition count 561
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 382 transition count 560
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 381 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 380 transition count 559
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 379 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 33 place count 378 transition count 558
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 34 place count 377 transition count 558
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 35 place count 376 transition count 557
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 36 place count 375 transition count 557
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 37 place count 374 transition count 556
Ensure Unique test removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 38 place count 373 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 39 place count 372 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 40 place count 371 transition count 555
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 7 Pre rules applied. Total rules applied 40 place count 371 transition count 548
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 54 place count 364 transition count 548
Applied a total of 54 rules in 138 ms. Remains 364 /410 variables (removed 46) and now considering 548/579 (removed 31) transitions.
[2023-03-14 13:47:53] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
// Phase 1: matrix 499 rows 364 cols
[2023-03-14 13:47:53] [INFO ] Computed 63 place invariants in 7 ms
[2023-03-14 13:47:53] [INFO ] Implicit Places using invariants in 256 ms returned [15, 17, 19, 21, 23, 25, 28, 30, 32, 34, 36, 38, 41, 43, 45, 47, 49, 51, 54, 56, 58, 60, 62, 64, 67, 69, 71, 73, 75, 77, 80, 82, 84, 86, 88, 90, 93, 95, 97, 99, 101, 103]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 258 ms to find 42 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 322/410 places, 548/579 transitions.
Applied a total of 0 rules in 12 ms. Remains 322 /322 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 410 ms. Remains : 322/410 places, 548/579 transitions.
Running random walk in product with property : NeoElection-COL-8-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s25 1) (LT s113 1) (LT s260 1)) (OR (LT s30 1) (LT s132 1) (LT s261 1)) (OR (LT s55 1) (LT s211 1) (LT s264 1)) (OR (LT s43 1) (LT s181 1)...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2533 reset in 2759 ms.
Product exploration explored 100000 steps with 2469 reset in 2824 ms.
Computed a total of 322 stabilizing places and 548 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 322 transition count 548
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 p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=16 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 205 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 :[p0]
Stuttering acceptance computed with spot in 36 ms :[p0]
[2023-03-14 13:47:59] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
// Phase 1: matrix 499 rows 322 cols
[2023-03-14 13:47:59] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-14 13:48:02] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-14 13:48:02] [INFO ] [Real]Absence check using 14 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-14 13:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:48:02] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2023-03-14 13:48:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 13:48:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-14 13:48:05] [INFO ] [Nat]Absence check using 14 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-14 13:48:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 13:48:06] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2023-03-14 13:48:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 13:48:06] [INFO ] [Nat]Added 43 Read/Feed constraints in 26 ms returned sat
[2023-03-14 13:48:06] [INFO ] Computed and/alt/rep : 420/1167/407 causal constraints (skipped 85 transitions) in 36 ms.
[2023-03-14 13:48:07] [INFO ] Added : 140 causal constraints over 28 iterations in 1181 ms. Result :sat
Could not prove EG p0
Support contains 84 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 548/548 transitions.
Applied a total of 0 rules in 11 ms. Remains 322 /322 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-14 13:48:07] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
[2023-03-14 13:48:07] [INFO ] Invariant cache hit.
[2023-03-14 13:48:07] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-14 13:48:07] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
[2023-03-14 13:48:07] [INFO ] Invariant cache hit.
[2023-03-14 13:48:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 13:48:08] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2023-03-14 13:48:08] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 13:48:08] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
[2023-03-14 13:48:08] [INFO ] Invariant cache hit.
[2023-03-14 13:48:08] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1143 ms. Remains : 322/322 places, 548/548 transitions.
Computed a total of 322 stabilizing places and 548 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 322 transition count 548
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 p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 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 :[p0]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 167 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 36 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
[2023-03-14 13:48:09] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
[2023-03-14 13:48:09] [INFO ] Invariant cache hit.
[2023-03-14 13:48:11] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-14 13:48:11] [INFO ] [Real]Absence check using 14 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-14 13:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:48:12] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2023-03-14 13:48:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 13:48:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-14 13:48:14] [INFO ] [Nat]Absence check using 14 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-14 13:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 13:48:15] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2023-03-14 13:48:15] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 13:48:15] [INFO ] [Nat]Added 43 Read/Feed constraints in 34 ms returned sat
[2023-03-14 13:48:15] [INFO ] Computed and/alt/rep : 420/1167/407 causal constraints (skipped 85 transitions) in 36 ms.
[2023-03-14 13:48:16] [INFO ] Added : 157 causal constraints over 32 iterations in 1353 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 36 ms :[p0]
Product exploration explored 100000 steps with 1342 reset in 2823 ms.
Product exploration explored 100000 steps with 1329 reset in 2899 ms.
Support contains 84 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 548/548 transitions.
Applied a total of 0 rules in 9 ms. Remains 322 /322 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-14 13:48:22] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
[2023-03-14 13:48:22] [INFO ] Invariant cache hit.
[2023-03-14 13:48:22] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-14 13:48:22] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
[2023-03-14 13:48:22] [INFO ] Invariant cache hit.
[2023-03-14 13:48:23] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 13:48:23] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
[2023-03-14 13:48:23] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 13:48:23] [INFO ] Flow matrix only has 499 transitions (discarded 49 similar events)
[2023-03-14 13:48:23] [INFO ] Invariant cache hit.
[2023-03-14 13:48:23] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1230 ms. Remains : 322/322 places, 548/548 transitions.
Treatment of property NeoElection-COL-8-LTLFireability-12 finished in 31234 ms.
[2023-03-14 13:48:23] [INFO ] Flatten gal took : 62 ms
[2023-03-14 13:48:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2023-03-14 13:48:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 410 places, 579 transitions and 2683 arcs took 5 ms.
Total runtime 79643 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/917/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : NeoElection-COL-8-LTLFireability-12

BK_STOP 1678801760645

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name NeoElection-COL-8-LTLFireability-12
ltl formula formula --ltl=/tmp/917/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 410 places, 579 transitions and 2683 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.170 real 0.010 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/917/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/917/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/917/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/917/ltl_0_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x564f793803f4]
1: pnml2lts-mc(+0xa2496) [0x564f79380496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f22551c7140]
3: pnml2lts-mc(+0x405be5) [0x564f796e3be5]
4: pnml2lts-mc(+0x16b3f9) [0x564f794493f9]
5: pnml2lts-mc(+0x164ac4) [0x564f79442ac4]
6: pnml2lts-mc(+0x272e0a) [0x564f79550e0a]
7: pnml2lts-mc(+0xb61f0) [0x564f793941f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f225501a4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f225501a67a]
10: pnml2lts-mc(+0xa1581) [0x564f7937f581]
11: pnml2lts-mc(+0xa1910) [0x564f7937f910]
12: pnml2lts-mc(+0xa32a2) [0x564f793812a2]
13: pnml2lts-mc(+0x8e039) [0x564f7936c039]
14: pnml2lts-mc(+0x8f01d) [0x564f7936d01d]
15: pnml2lts-mc(+0x7fedb) [0x564f7935dedb]
16: pnml2lts-mc(+0x6095d) [0x564f7933e95d]
17: pnml2lts-mc(+0x609f0) [0x564f7933e9f0]
18: pnml2lts-mc(+0x5eb0a) [0x564f7933cb0a]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f2255002d0a]
20: pnml2lts-mc(+0x6075e) [0x564f7933e75e]

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-8"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is NeoElection-COL-8, 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 r265-smll-167863539700164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-8.tgz
mv NeoElection-COL-8 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 ;