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.r263-smll-167863537800156.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 lolaxred
Input is NeoElection-COL-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863537800156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 9.5K Feb 26 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 16:52 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.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 19:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 18:42 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 108K 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-7-LTLFireability-00
FORMULA_NAME NeoElection-COL-7-LTLFireability-01
FORMULA_NAME NeoElection-COL-7-LTLFireability-02
FORMULA_NAME NeoElection-COL-7-LTLFireability-03
FORMULA_NAME NeoElection-COL-7-LTLFireability-04
FORMULA_NAME NeoElection-COL-7-LTLFireability-05
FORMULA_NAME NeoElection-COL-7-LTLFireability-06
FORMULA_NAME NeoElection-COL-7-LTLFireability-07
FORMULA_NAME NeoElection-COL-7-LTLFireability-08
FORMULA_NAME NeoElection-COL-7-LTLFireability-09
FORMULA_NAME NeoElection-COL-7-LTLFireability-10
FORMULA_NAME NeoElection-COL-7-LTLFireability-11
FORMULA_NAME NeoElection-COL-7-LTLFireability-12
FORMULA_NAME NeoElection-COL-7-LTLFireability-13
FORMULA_NAME NeoElection-COL-7-LTLFireability-14
FORMULA_NAME NeoElection-COL-7-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678728845156

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-7
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-13 17:34:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 17:34:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:34:09] [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-13 17:34:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 17:34:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 926 ms
[2023-03-13 17:34:10] [INFO ] Detected 6 constant HL places corresponding to 3552 PT places.
[2023-03-13 17:34:10] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 7128 PT places and 22272.0 transition bindings in 48 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-13 17:34:10] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 7 ms.
[2023-03-13 17:34:10] [INFO ] Skeletonized 11 HLPN properties in 1 ms. Removed 5 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-COL-7-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Remains 7 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-7-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Finished random walk after 51 steps, including 1 resets, run visited all 4 properties in 25 ms. (steps per millisecond=2 )
[2023-03-13 17:34:10] [INFO ] Flatten gal took : 19 ms
[2023-03-13 17:34:10] [INFO ] Flatten gal took : 3 ms
Domain [M(8), POS(7), M(8)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 7)]] 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-13 17:34:10] [INFO ] Unfolded HLPN to a Petri net with 7128 places and 12460 transitions 70880 arcs in 338 ms.
[2023-03-13 17:34:10] [INFO ] Unfolded 12 HLPN properties in 8 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 6688 places in 39 ms
Reduce places removed 6737 places and 11850 transitions.
Reduce places removed 8 places and 0 transitions.
FORMULA NeoElection-COL-7-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 119 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 610/610 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 341 transition count 610
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 107 place count 276 transition count 250
Iterating global reduction 1 with 65 rules applied. Total rules applied 172 place count 276 transition count 250
Applied a total of 172 rules in 47 ms. Remains 276 /383 variables (removed 107) and now considering 250/610 (removed 360) transitions.
[2023-03-13 17:34:11] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
// Phase 1: matrix 214 rows 276 cols
[2023-03-13 17:34:11] [INFO ] Computed 62 place invariants in 56 ms
[2023-03-13 17:34:11] [INFO ] Implicit Places using invariants in 499 ms returned [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]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 540 ms to find 49 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/383 places, 250/610 transitions.
Applied a total of 0 rules in 10 ms. Remains 227 /227 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 598 ms. Remains : 227/383 places, 250/610 transitions.
Support contains 119 out of 227 places after structural reductions.
[2023-03-13 17:34:11] [INFO ] Flatten gal took : 74 ms
[2023-03-13 17:34:11] [INFO ] Flatten gal took : 56 ms
[2023-03-13 17:34:12] [INFO ] Input system was already deterministic with 250 transitions.
Finished random walk after 53 steps, including 0 resets, run visited all 6 properties in 15 ms. (steps per millisecond=3 )
Computed a total of 227 stabilizing places and 250 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 227 transition count 250
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' '!(X(X(F(p0))))'
Support contains 49 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 250/250 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 220 transition count 243
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 220 transition count 243
Applied a total of 14 rules in 35 ms. Remains 220 /227 variables (removed 7) and now considering 243/250 (removed 7) transitions.
[2023-03-13 17:34:12] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
// Phase 1: matrix 207 rows 220 cols
[2023-03-13 17:34:12] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-13 17:34:12] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-13 17:34:12] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:34:12] [INFO ] Invariant cache hit.
[2023-03-13 17:34:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:13] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2023-03-13 17:34:13] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:34:13] [INFO ] Invariant cache hit.
[2023-03-13 17:34:13] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 220/227 places, 243/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1081 ms. Remains : 220/227 places, 243/250 transitions.
Stuttering acceptance computed with spot in 452 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s53 1) (GEQ s158 1)) (AND (GEQ s135 1) (GEQ s162 1)) (AND (GEQ s79 1) (GEQ s160 1)) (AND (GEQ s152 1) (GEQ s163 1)) (AND (GEQ s66 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][false, false, false]]
Product exploration explored 100000 steps with 1794 reset in 911 ms.
Product exploration explored 100000 steps with 1798 reset in 575 ms.
Computed a total of 220 stabilizing places and 243 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 220 transition count 243
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-13 17:34:16] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:34:16] [INFO ] Invariant cache hit.
[2023-03-13 17:34:17] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:17] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2023-03-13 17:34:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:34:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-13 17:34:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:18] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2023-03-13 17:34:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:18] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2023-03-13 17:34:18] [INFO ] Computed and/alt/rep : 229/496/193 causal constraints (skipped 7 transitions) in 36 ms.
[2023-03-13 17:34:18] [INFO ] Added : 115 causal constraints over 23 iterations in 880 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 49 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 243/243 transitions.
Applied a total of 0 rules in 17 ms. Remains 220 /220 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2023-03-13 17:34:18] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:34:18] [INFO ] Invariant cache hit.
[2023-03-13 17:34:19] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-13 17:34:19] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:34:19] [INFO ] Invariant cache hit.
[2023-03-13 17:34:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:19] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2023-03-13 17:34:19] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:34:19] [INFO ] Invariant cache hit.
[2023-03-13 17:34:19] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 945 ms. Remains : 220/220 places, 243/243 transitions.
Computed a total of 220 stabilizing places and 243 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 220 transition count 243
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-13 17:34:20] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:34:20] [INFO ] Invariant cache hit.
[2023-03-13 17:34:21] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:21] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2023-03-13 17:34:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:34:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-13 17:34:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:22] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2023-03-13 17:34:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:22] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2023-03-13 17:34:22] [INFO ] Computed and/alt/rep : 229/496/193 causal constraints (skipped 7 transitions) in 30 ms.
[2023-03-13 17:34:23] [INFO ] Added : 115 causal constraints over 23 iterations in 808 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1794 reset in 898 ms.
Product exploration explored 100000 steps with 1791 reset in 727 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 49 out of 220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 243/243 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 220 transition count 243
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 7 place count 220 transition count 243
Deduced a syphon composed of 14 places in 2 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 14 place count 220 transition count 243
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 49 place count 220 transition count 243
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 49 rules in 76 ms. Remains 220 /220 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2023-03-13 17:34:25] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-13 17:34:25] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
// Phase 1: matrix 207 rows 220 cols
[2023-03-13 17:34:25] [INFO ] Computed 13 place invariants in 8 ms
[2023-03-13 17:34:25] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 220/220 places, 243/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 220/220 places, 243/243 transitions.
Support contains 49 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 243/243 transitions.
Applied a total of 0 rules in 6 ms. Remains 220 /220 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2023-03-13 17:34:25] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
// Phase 1: matrix 207 rows 220 cols
[2023-03-13 17:34:25] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-13 17:34:26] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-13 17:34:26] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:34:26] [INFO ] Invariant cache hit.
[2023-03-13 17:34:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:26] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2023-03-13 17:34:26] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2023-03-13 17:34:26] [INFO ] Invariant cache hit.
[2023-03-13 17:34:26] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 888 ms. Remains : 220/220 places, 243/243 transitions.
Treatment of property NeoElection-COL-7-LTLFireability-02 finished in 14770 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 U F(!p0))) U !(p1 U p0)) U G(p1)))'
Support contains 14 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 250/250 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 227 transition count 243
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 220 transition count 243
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 220 transition count 236
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 213 transition count 236
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 98 place count 178 transition count 201
Applied a total of 98 rules in 89 ms. Remains 178 /227 variables (removed 49) and now considering 201/250 (removed 49) transitions.
[2023-03-13 17:34:27] [INFO ] Flow matrix only has 165 transitions (discarded 36 similar events)
// Phase 1: matrix 165 rows 178 cols
[2023-03-13 17:34:27] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-13 17:34:27] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-13 17:34:27] [INFO ] Flow matrix only has 165 transitions (discarded 36 similar events)
[2023-03-13 17:34:27] [INFO ] Invariant cache hit.
[2023-03-13 17:34:27] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-03-13 17:34:28] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2023-03-13 17:34:28] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-13 17:34:28] [INFO ] Flow matrix only has 165 transitions (discarded 36 similar events)
[2023-03-13 17:34:28] [INFO ] Invariant cache hit.
[2023-03-13 17:34:28] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 178/227 places, 201/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1465 ms. Remains : 178/227 places, 201/250 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), p0, p0]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s173 1) (GEQ s169 1) (GEQ s165 1) (GEQ s175 1) (GEQ s171 1) (GEQ s167 1) (GEQ s177 1)), p0:(OR (GEQ s0 1) (GEQ s2 1) (GEQ s1 1) (GEQ s4 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 287 steps with 4 reset in 23 ms.
FORMULA NeoElection-COL-7-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLFireability-05 finished in 1749 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(G(p0)))'
Support contains 7 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 250/250 transitions.
Reduce places removed 7 places and 7 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 220 transition count 236
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 213 transition count 236
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 98 place count 171 transition count 194
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 105 place count 164 transition count 187
Applied a total of 105 rules in 76 ms. Remains 164 /227 variables (removed 63) and now considering 187/250 (removed 63) transitions.
[2023-03-13 17:34:28] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
// Phase 1: matrix 151 rows 164 cols
[2023-03-13 17:34:28] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-13 17:34:29] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-13 17:34:29] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:29] [INFO ] Invariant cache hit.
[2023-03-13 17:34:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:29] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2023-03-13 17:34:29] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 17:34:29] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:29] [INFO ] Invariant cache hit.
[2023-03-13 17:34:29] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/227 places, 187/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 965 ms. Remains : 164/227 places, 187/250 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s155 1) (LT s156 1) (LT s153 1) (LT s154 1) (LT s151 1) (LT s152 1) (LT s150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 296 reset in 814 ms.
Product exploration explored 100000 steps with 296 reset in 549 ms.
Computed a total of 164 stabilizing places and 187 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 187
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-7-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLFireability-06 finished in 2596 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 49 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 250/250 transitions.
Reduce places removed 7 places and 7 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 220 transition count 236
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 213 transition count 236
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 206 transition count 229
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 206 transition count 229
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 98 place count 171 transition count 194
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 105 place count 164 transition count 187
Applied a total of 105 rules in 33 ms. Remains 164 /227 variables (removed 63) and now considering 187/250 (removed 63) transitions.
[2023-03-13 17:34:31] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
// Phase 1: matrix 151 rows 164 cols
[2023-03-13 17:34:31] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-13 17:34:31] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-13 17:34:31] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:31] [INFO ] Invariant cache hit.
[2023-03-13 17:34:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:31] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-13 17:34:31] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 17:34:31] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:31] [INFO ] Invariant cache hit.
[2023-03-13 17:34:31] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/227 places, 187/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 616 ms. Remains : 164/227 places, 187/250 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-08 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:(OR (AND (GEQ s41 1) (GEQ s151 1)) (AND (GEQ s126 1) (GEQ s155 1)) (AND (GEQ s27 1) (GEQ s150 1)) (AND (GEQ s123 1) (GEQ s155 1)) (AND (GEQ s53 1) (GEQ...], 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 3781 reset in 1178 ms.
Product exploration explored 100000 steps with 3757 reset in 851 ms.
Computed a total of 164 stabilizing places and 187 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 187
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 201 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=11 )
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 388 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
[2023-03-13 17:34:35] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:35] [INFO ] Invariant cache hit.
[2023-03-13 17:34:35] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:35] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2023-03-13 17:34:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:34:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:34:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:36] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-03-13 17:34:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:36] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2023-03-13 17:34:36] [INFO ] Computed and/alt/rep : 180/369/144 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-13 17:34:36] [INFO ] Added : 67 causal constraints over 14 iterations in 363 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 49 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 187/187 transitions.
Applied a total of 0 rules in 10 ms. Remains 164 /164 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2023-03-13 17:34:36] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:36] [INFO ] Invariant cache hit.
[2023-03-13 17:34:37] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-13 17:34:37] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:37] [INFO ] Invariant cache hit.
[2023-03-13 17:34:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:37] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2023-03-13 17:34:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-13 17:34:37] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:37] [INFO ] Invariant cache hit.
[2023-03-13 17:34:37] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 778 ms. Remains : 164/164 places, 187/187 transitions.
Computed a total of 164 stabilizing places and 187 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 187
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 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
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 200 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
[2023-03-13 17:34:38] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:38] [INFO ] Invariant cache hit.
[2023-03-13 17:34:38] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:38] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2023-03-13 17:34:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:34:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-13 17:34:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:39] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2023-03-13 17:34:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:39] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-13 17:34:39] [INFO ] Computed and/alt/rep : 180/369/144 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-13 17:34:40] [INFO ] Added : 67 causal constraints over 14 iterations in 362 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3699 reset in 1157 ms.
Product exploration explored 100000 steps with 3771 reset in 860 ms.
Support contains 49 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 187/187 transitions.
Applied a total of 0 rules in 16 ms. Remains 164 /164 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2023-03-13 17:34:42] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:42] [INFO ] Invariant cache hit.
[2023-03-13 17:34:42] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-13 17:34:42] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:42] [INFO ] Invariant cache hit.
[2023-03-13 17:34:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:42] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-13 17:34:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 17:34:42] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:42] [INFO ] Invariant cache hit.
[2023-03-13 17:34:42] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 618 ms. Remains : 164/164 places, 187/187 transitions.
Treatment of property NeoElection-COL-7-LTLFireability-08 finished in 11584 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((G(p0)&&F(p1))))'
Support contains 56 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-13 17:34:42] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
// Phase 1: matrix 214 rows 227 cols
[2023-03-13 17:34:42] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-13 17:34:43] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-13 17:34:43] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:34:43] [INFO ] Invariant cache hit.
[2023-03-13 17:34:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:43] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2023-03-13 17:34:43] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:34:43] [INFO ] Invariant cache hit.
[2023-03-13 17:34:43] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 960 ms. Remains : 227/227 places, 250/250 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GEQ s212 1) (GEQ s198 1) (GEQ s184 1) (GEQ s219 1) (GEQ s205 1) (GEQ s191 1) (GEQ s226 1)), p1:(OR (AND (GEQ s48 1) (GEQ s158 1)) (AND (GEQ s133 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-7-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLFireability-11 finished in 1175 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((X(p0)||(!p0&&G(!p1)))))'
Support contains 14 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-13 17:34:44] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:34:44] [INFO ] Invariant cache hit.
[2023-03-13 17:34:44] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-13 17:34:44] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:34:44] [INFO ] Invariant cache hit.
[2023-03-13 17:34:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:44] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2023-03-13 17:34:44] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2023-03-13 17:34:44] [INFO ] Invariant cache hit.
[2023-03-13 17:34:45] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1115 ms. Remains : 227/227 places, 250/250 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) p1), (NOT p0), (AND p1 (NOT p0)), true, p1]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s176 1) (LT s177 1) (LT s174 1) (LT s175 1) (LT s172 1) (LT s173 1) (LT s171 1)), p1:(AND (LT s169 1) (LT s170 1) (LT s167 1) (LT s168 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33293 reset in 425 ms.
Product exploration explored 100000 steps with 33357 reset in 455 ms.
Computed a total of 227 stabilizing places and 250 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 227 transition count 250
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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 538 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), true, (AND p0 p1)]
Finished random walk after 46 steps, including 0 resets, run visited all 6 properties in 11 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (OR p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 (NOT p1))))
Knowledge based reduction with 8 factoid took 295 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-7-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLFireability-13 finished in 3470 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(X(F(p0))))'
Found a Shortening insensitive property : NeoElection-COL-7-LTLFireability-02
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 49 out of 227 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 227/227 places, 250/250 transitions.
Reduce places removed 7 places and 7 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 220 transition count 236
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 213 transition count 236
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 206 transition count 229
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 206 transition count 229
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 98 place count 171 transition count 194
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 105 place count 164 transition count 187
Applied a total of 105 rules in 37 ms. Remains 164 /227 variables (removed 63) and now considering 187/250 (removed 63) transitions.
[2023-03-13 17:34:47] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
// Phase 1: matrix 151 rows 164 cols
[2023-03-13 17:34:47] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-13 17:34:48] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-13 17:34:48] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:48] [INFO ] Invariant cache hit.
[2023-03-13 17:34:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:48] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-13 17:34:48] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:48] [INFO ] Invariant cache hit.
[2023-03-13 17:34:48] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 164/227 places, 187/250 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 759 ms. Remains : 164/227 places, 187/250 transitions.
Running random walk in product with property : NeoElection-COL-7-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s46 1) (GEQ s151 1)) (AND (GEQ s128 1) (GEQ s155 1)) (AND (GEQ s72 1) (GEQ s153 1)) (AND (GEQ s145 1) (GEQ s156 1)) (AND (GEQ s59 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, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12915 reset in 840 ms.
Product exploration explored 100000 steps with 12963 reset in 871 ms.
Computed a total of 164 stabilizing places and 187 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 187
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-13 17:34:51] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:51] [INFO ] Invariant cache hit.
[2023-03-13 17:34:51] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:34:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:52] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2023-03-13 17:34:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:34:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:34:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:52] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-13 17:34:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:52] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-13 17:34:52] [INFO ] Computed and/alt/rep : 180/369/144 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-13 17:34:53] [INFO ] Added : 72 causal constraints over 15 iterations in 370 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 49 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 187/187 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2023-03-13 17:34:53] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:53] [INFO ] Invariant cache hit.
[2023-03-13 17:34:53] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-13 17:34:53] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:53] [INFO ] Invariant cache hit.
[2023-03-13 17:34:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:53] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2023-03-13 17:34:53] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:53] [INFO ] Invariant cache hit.
[2023-03-13 17:34:53] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 733 ms. Remains : 164/164 places, 187/187 transitions.
Computed a total of 164 stabilizing places and 187 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 187
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-13 17:34:54] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:54] [INFO ] Invariant cache hit.
[2023-03-13 17:34:55] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-13 17:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:55] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2023-03-13 17:34:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:34:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 17:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:56] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2023-03-13 17:34:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:56] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-13 17:34:56] [INFO ] Computed and/alt/rep : 180/369/144 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-13 17:34:56] [INFO ] Added : 72 causal constraints over 15 iterations in 378 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12939 reset in 996 ms.
Product exploration explored 100000 steps with 12929 reset in 709 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 49 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 187/187 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2023-03-13 17:34:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 17:34:58] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:58] [INFO ] Invariant cache hit.
[2023-03-13 17:34:59] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 298 ms. Remains : 164/164 places, 187/187 transitions.
Support contains 49 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 187/187 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2023-03-13 17:34:59] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:59] [INFO ] Invariant cache hit.
[2023-03-13 17:34:59] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-13 17:34:59] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:59] [INFO ] Invariant cache hit.
[2023-03-13 17:34:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:34:59] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2023-03-13 17:34:59] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2023-03-13 17:34:59] [INFO ] Invariant cache hit.
[2023-03-13 17:34:59] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 772 ms. Remains : 164/164 places, 187/187 transitions.
Treatment of property NeoElection-COL-7-LTLFireability-02 finished in 12286 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)))'
[2023-03-13 17:35:00] [INFO ] Flatten gal took : 39 ms
[2023-03-13 17:35:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2023-03-13 17:35:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 227 places, 250 transitions and 1052 arcs took 3 ms.
Total runtime 51122 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NeoElection-COL-7
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1678728957010

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 NeoElection-COL-7-LTLFireability-08
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
NeoElection-COL-7-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 7/32 NeoElection-COL-7-LTLFireability-08 896323 m, 179264 m/sec, 1187807 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
NeoElection-COL-7-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 14/32 NeoElection-COL-7-LTLFireability-08 1819127 m, 184560 m/sec, 2436957 t fired, .

Time elapsed: 10 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
NeoElection-COL-7-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 21/32 NeoElection-COL-7-LTLFireability-08 2760967 m, 188368 m/sec, 3719897 t fired, .

Time elapsed: 15 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
NeoElection-COL-7-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 28/32 NeoElection-COL-7-LTLFireability-08 3669360 m, 181678 m/sec, 4958832 t fired, .

Time elapsed: 20 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for NeoElection-COL-7-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
NeoElection-COL-7-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 NeoElection-COL-7-LTLFireability-02
lola: time limit : 3575 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3575 6/32 NeoElection-COL-7-LTLFireability-02 775924 m, 155184 m/sec, 1243674 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3575 12/32 NeoElection-COL-7-LTLFireability-02 1579416 m, 160698 m/sec, 2564401 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3575 17/32 NeoElection-COL-7-LTLFireability-02 2383721 m, 160861 m/sec, 3886783 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3575 23/32 NeoElection-COL-7-LTLFireability-02 3217086 m, 166673 m/sec, 5150982 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
NeoElection-COL-7-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3575 29/32 NeoElection-COL-7-LTLFireability-02 4043424 m, 165267 m/sec, 6364925 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for NeoElection-COL-7-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-7-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
NeoElection-COL-7-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NeoElection-COL-7-LTLFireability-02: LTL unknown AGGR
NeoElection-COL-7-LTLFireability-08: LTL unknown AGGR


Time elapsed: 55 secs. Pages in use: 32

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-7"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is NeoElection-COL-7, 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 r263-smll-167863537800156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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