Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.7K Apr 30 05:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 30 05:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 30 04:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 04:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 98K May 10 09:34 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-6-LTLFireability-00
FORMULA_NAME NeoElection-COL-6-LTLFireability-01
FORMULA_NAME NeoElection-COL-6-LTLFireability-02
FORMULA_NAME NeoElection-COL-6-LTLFireability-03
FORMULA_NAME NeoElection-COL-6-LTLFireability-04
FORMULA_NAME NeoElection-COL-6-LTLFireability-05
FORMULA_NAME NeoElection-COL-6-LTLFireability-06
FORMULA_NAME NeoElection-COL-6-LTLFireability-07
FORMULA_NAME NeoElection-COL-6-LTLFireability-08
FORMULA_NAME NeoElection-COL-6-LTLFireability-09
FORMULA_NAME NeoElection-COL-6-LTLFireability-10
FORMULA_NAME NeoElection-COL-6-LTLFireability-11
FORMULA_NAME NeoElection-COL-6-LTLFireability-12
FORMULA_NAME NeoElection-COL-6-LTLFireability-13
FORMULA_NAME NeoElection-COL-6-LTLFireability-14
FORMULA_NAME NeoElection-COL-6-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652917569136

Running Version 202205111006
[2022-05-18 23:46:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 23:46:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 23:46:11] [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.
[2022-05-18 23:46:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 23:46:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1779 ms
[2022-05-18 23:46:13] [INFO ] Detected 6 constant HL places corresponding to 2380 PT places.
[2022-05-18 23:46:13] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 4830 PT places and 13580.0 transition bindings in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2022-05-18 23:46:13] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 29 ms.
[2022-05-18 23:46:13] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Remains 12 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-6-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Incomplete random walk after 10000 steps, including 247 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 6 cols
[2022-05-18 23:46:13] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-18 23:46:13] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2022-05-18 23:46:13] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2022-05-18 23:46:13] [INFO ] Flatten gal took : 26 ms
FORMULA NeoElection-COL-6-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 23:46:13] [INFO ] Flatten gal took : 5 ms
Domain [M(7), POS(6), M(7)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 6)]] 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.
[2022-05-18 23:46:14] [INFO ] Unfolded HLPN to a Petri net with 4830 places and 7361 transitions 41792 arcs in 258 ms.
[2022-05-18 23:46:14] [INFO ] Unfolded 11 HLPN properties in 5 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 4507 places in 36 ms
Reduce places removed 4543 places and 6967 transitions.
Reduce places removed 7 places and 0 transitions.
FORMULA NeoElection-COL-6-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-6-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 158 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 394/394 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 250 transition count 394
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 44 place count 236 transition count 340
Iterating global reduction 1 with 14 rules applied. Total rules applied 58 place count 236 transition count 340
Applied a total of 58 rules in 39 ms. Remains 236 /280 variables (removed 44) and now considering 340/394 (removed 54) transitions.
[2022-05-18 23:46:14] [INFO ] Flow matrix only has 315 transitions (discarded 25 similar events)
// Phase 1: matrix 315 rows 236 cols
[2022-05-18 23:46:14] [INFO ] Computed 47 place invariants in 31 ms
[2022-05-18 23:46:14] [INFO ] Implicit Places using invariants in 278 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 281 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/280 places, 340/394 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 340/340 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 235/280 places, 340/394 transitions.
Support contains 158 out of 235 places after structural reductions.
[2022-05-18 23:46:14] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-18 23:46:14] [INFO ] Flatten gal took : 86 ms
FORMULA NeoElection-COL-6-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 23:46:14] [INFO ] Flatten gal took : 77 ms
[2022-05-18 23:46:15] [INFO ] Input system was already deterministic with 340 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 23:46:15] [INFO ] Flow matrix only has 315 transitions (discarded 25 similar events)
// Phase 1: matrix 315 rows 235 cols
[2022-05-18 23:46:15] [INFO ] Computed 46 place invariants in 15 ms
[2022-05-18 23:46:15] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 235 stabilizing places and 340 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 235 transition count 340
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 60 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 199 transition count 178
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 199 transition count 178
Applied a total of 72 rules in 17 ms. Remains 199 /235 variables (removed 36) and now considering 178/340 (removed 162) transitions.
[2022-05-18 23:46:15] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 199 cols
[2022-05-18 23:46:15] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-18 23:46:15] [INFO ] Implicit Places using invariants in 219 ms returned [17, 23, 29, 35, 41]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 223 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/235 places, 178/340 transitions.
Applied a total of 0 rules in 7 ms. Remains 194 /194 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 194/235 places, 178/340 transitions.
Stuttering acceptance computed with spot in 250 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s36 1) (LT s184 1)) (OR (LT s33 1) (LT s181 1)) (OR (LT s29 1) (LT s177 1)) (OR (LT s40 1) (LT s188 1)) (OR (LT s42 1) (LT s190 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-6-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-00 finished in 571 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 60 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 199 transition count 178
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 199 transition count 178
Applied a total of 72 rules in 16 ms. Remains 199 /235 variables (removed 36) and now considering 178/340 (removed 162) transitions.
[2022-05-18 23:46:16] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 199 cols
[2022-05-18 23:46:16] [INFO ] Computed 46 place invariants in 6 ms
[2022-05-18 23:46:16] [INFO ] Implicit Places using invariants in 233 ms returned [17, 23, 29, 35, 41]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 235 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/235 places, 178/340 transitions.
Applied a total of 0 rules in 5 ms. Remains 194 /194 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 194/235 places, 178/340 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s36 1) (GEQ s184 1)) (AND (GEQ s33 1) (GEQ s181 1)) (AND (GEQ s29 1) (GEQ s177 1)) (AND (GEQ s40 1) (GEQ s188 1)) (AND (GEQ s42 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 805 ms.
Product exploration explored 100000 steps with 50000 reset in 528 ms.
Computed a total of 194 stabilizing places and 178 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 194 transition count 178
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 p0), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA NeoElection-COL-6-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-6-LTLFireability-05 finished in 2004 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 36 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 199 transition count 178
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 199 transition count 178
Applied a total of 72 rules in 14 ms. Remains 199 /235 variables (removed 36) and now considering 178/340 (removed 162) transitions.
[2022-05-18 23:46:18] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 199 cols
[2022-05-18 23:46:18] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-18 23:46:18] [INFO ] Implicit Places using invariants in 273 ms returned [16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 275 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/235 places, 178/340 transitions.
Applied a total of 0 rules in 10 ms. Remains 164 /164 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 164/235 places, 178/340 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s37 1) (GEQ s117 1)) (AND (GEQ s94 1) (GEQ s120 1)) (AND (GEQ s81 1) (GEQ s119 1)) (AND (GEQ s105 1) (GEQ s121 1)) (AND (GEQ s27 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-6-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-06 finished in 420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 199 transition count 178
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 199 transition count 178
Applied a total of 72 rules in 15 ms. Remains 199 /235 variables (removed 36) and now considering 178/340 (removed 162) transitions.
[2022-05-18 23:46:18] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 199 cols
[2022-05-18 23:46:18] [INFO ] Computed 46 place invariants in 5 ms
[2022-05-18 23:46:18] [INFO ] Implicit Places using invariants in 257 ms returned [16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 261 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/235 places, 178/340 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 164/235 places, 178/340 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s0 1) (LT s1 1) (LT s3 1) (LT s2 1) (LT s5 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-6-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-07 finished in 389 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 55 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 229 transition count 334
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 334
Applied a total of 12 rules in 14 ms. Remains 229 /235 variables (removed 6) and now considering 334/340 (removed 6) transitions.
[2022-05-18 23:46:19] [INFO ] Flow matrix only has 309 transitions (discarded 25 similar events)
// Phase 1: matrix 309 rows 229 cols
[2022-05-18 23:46:19] [INFO ] Computed 46 place invariants in 4 ms
[2022-05-18 23:46:19] [INFO ] Implicit Places using invariants in 220 ms returned [16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 67, 68, 69, 70]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 224 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/235 places, 334/340 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 199/235 places, 334/340 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s12 1) (LT s35 1) (LT s113 1) (LT s154 1)) (OR (LT s8 1) (LT s24 1) (LT s68 1) (LT s152 1)) (OR (LT s11 1) (LT s28 1) (LT s99 1) (LT s153 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 132 steps with 0 reset in 10 ms.
FORMULA NeoElection-COL-6-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-08 finished in 374 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 55 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 229 transition count 334
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 334
Applied a total of 12 rules in 11 ms. Remains 229 /235 variables (removed 6) and now considering 334/340 (removed 6) transitions.
[2022-05-18 23:46:19] [INFO ] Flow matrix only has 309 transitions (discarded 25 similar events)
// Phase 1: matrix 309 rows 229 cols
[2022-05-18 23:46:19] [INFO ] Computed 46 place invariants in 3 ms
[2022-05-18 23:46:19] [INFO ] Implicit Places using invariants in 199 ms returned [16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 67, 68, 69, 70]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 203 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/235 places, 334/340 transitions.
Applied a total of 0 rules in 10 ms. Remains 199 /199 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 199/235 places, 334/340 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s35 1) (GEQ s113 1) (GEQ s154 1)) (AND (GEQ s8 1) (GEQ s24 1) (GEQ s68 1) (GEQ s152 1)) (AND (GEQ s11 1) (GEQ s28 1) (GEQ s99...], 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][false, false]]
Product exploration explored 100000 steps with 835 reset in 2762 ms.
Product exploration explored 100000 steps with 843 reset in 2366 ms.
Computed a total of 199 stabilizing places and 334 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 199 transition count 334
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 180 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 125 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=17 )
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 219 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2022-05-18 23:46:25] [INFO ] Flow matrix only has 309 transitions (discarded 25 similar events)
// Phase 1: matrix 309 rows 199 cols
[2022-05-18 23:46:25] [INFO ] Computed 16 place invariants in 24 ms
[2022-05-18 23:46:28] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-18 23:46:28] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 8 ms returned sat
[2022-05-18 23:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 23:46:28] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2022-05-18 23:46:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 23:46:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-18 23:46:30] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 9 ms returned sat
[2022-05-18 23:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 23:46:30] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2022-05-18 23:46:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-05-18 23:46:30] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2022-05-18 23:46:30] [INFO ] Computed and/alt/rep : 212/572/207 causal constraints (skipped 96 transitions) in 72 ms.
[2022-05-18 23:46:31] [INFO ] Added : 89 causal constraints over 18 iterations in 854 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 55 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 334/334 transitions.
Reduce places removed 6 places and 6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 192 transition count 327
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 192 transition count 321
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 186 transition count 321
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 182 transition count 317
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 181 transition count 316
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 544 edges and 180 vertex of which 179 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 179 transition count 315
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 25 place count 179 transition count 305
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 45 place count 169 transition count 305
Applied a total of 45 rules in 111 ms. Remains 169 /199 variables (removed 30) and now considering 305/334 (removed 29) transitions.
[2022-05-18 23:46:31] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:46:31] [INFO ] Computed 15 place invariants in 7 ms
[2022-05-18 23:46:31] [INFO ] Implicit Places using invariants in 135 ms returned []
[2022-05-18 23:46:31] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:46:32] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-18 23:46:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-05-18 23:46:32] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2022-05-18 23:46:32] [INFO ] Redundant transitions in 34 ms returned []
[2022-05-18 23:46:32] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:46:32] [INFO ] Computed 15 place invariants in 4 ms
[2022-05-18 23:46:32] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/199 places, 305/334 transitions.
Finished structural reductions, in 1 iterations. Remains : 169/199 places, 305/334 transitions.
Computed a total of 169 stabilizing places and 305 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 169 transition count 305
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 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 33 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 258 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2022-05-18 23:46:33] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:46:33] [INFO ] Computed 15 place invariants in 4 ms
[2022-05-18 23:46:35] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-18 23:46:35] [INFO ] [Real]Absence check using 10 positive and 5 generalized place invariants in 6 ms returned sat
[2022-05-18 23:46:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 23:46:35] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2022-05-18 23:46:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 23:46:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-05-18 23:46:37] [INFO ] [Nat]Absence check using 10 positive and 5 generalized place invariants in 5 ms returned sat
[2022-05-18 23:46:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 23:46:37] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2022-05-18 23:46:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-05-18 23:46:37] [INFO ] [Nat]Added 75 Read/Feed constraints in 20 ms returned sat
[2022-05-18 23:46:37] [INFO ] Computed and/alt/rep : 185/523/180 causal constraints (skipped 95 transitions) in 50 ms.
[2022-05-18 23:46:38] [INFO ] Added : 72 causal constraints over 15 iterations in 500 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2322 reset in 2545 ms.
Product exploration explored 100000 steps with 2337 reset in 2595 ms.
Built C files in :
/tmp/ltsmin7436639210945530122
[2022-05-18 23:46:43] [INFO ] Computing symmetric may disable matrix : 305 transitions.
[2022-05-18 23:46:43] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:46:43] [INFO ] Computing symmetric may enable matrix : 305 transitions.
[2022-05-18 23:46:43] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:46:43] [INFO ] Computing Do-Not-Accords matrix : 305 transitions.
[2022-05-18 23:46:43] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:46:43] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7436639210945530122
Running compilation step : cd /tmp/ltsmin7436639210945530122;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1694 ms.
Running link step : cd /tmp/ltsmin7436639210945530122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin7436639210945530122;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4403936068820393204.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 55 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 305/305 transitions.
Applied a total of 0 rules in 15 ms. Remains 169 /169 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2022-05-18 23:46:58] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:46:58] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-18 23:46:58] [INFO ] Implicit Places using invariants in 100 ms returned []
[2022-05-18 23:46:58] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:46:58] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-18 23:46:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-05-18 23:46:58] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2022-05-18 23:46:58] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-18 23:46:58] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:46:58] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-18 23:46:59] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 169/169 places, 305/305 transitions.
Built C files in :
/tmp/ltsmin14904225179435830336
[2022-05-18 23:46:59] [INFO ] Computing symmetric may disable matrix : 305 transitions.
[2022-05-18 23:46:59] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:46:59] [INFO ] Computing symmetric may enable matrix : 305 transitions.
[2022-05-18 23:46:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:46:59] [INFO ] Computing Do-Not-Accords matrix : 305 transitions.
[2022-05-18 23:46:59] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:46:59] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14904225179435830336
Running compilation step : cd /tmp/ltsmin14904225179435830336;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1257 ms.
Running link step : cd /tmp/ltsmin14904225179435830336;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14904225179435830336;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3278322126391822654.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 23:47:14] [INFO ] Flatten gal took : 42 ms
[2022-05-18 23:47:14] [INFO ] Flatten gal took : 39 ms
[2022-05-18 23:47:14] [INFO ] Time to serialize gal into /tmp/LTL4769442669608838097.gal : 6 ms
[2022-05-18 23:47:14] [INFO ] Time to serialize properties into /tmp/LTL6353715627259018610.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4769442669608838097.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6353715627259018610.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4769442...266
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((((P_masterState_56>=1)&&(P_negotiation_103>=1))&&((P_network_1407>=1)&&(P_poll__handlingMessage_4>=1)))||(((P_masterS...16008
Formula 0 simplified : !XF"(((((((((((P_masterState_56>=1)&&(P_negotiation_103>=1))&&((P_network_1407>=1)&&(P_poll__handlingMessage_4>=1)))||(((P_masterSta...16002
Detected timeout of ITS tools.
[2022-05-18 23:47:29] [INFO ] Flatten gal took : 54 ms
[2022-05-18 23:47:29] [INFO ] Applying decomposition
[2022-05-18 23:47:29] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15834217003026766210.txt' '-o' '/tmp/graph15834217003026766210.bin' '-w' '/tmp/graph15834217003026766210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15834217003026766210.bin' '-l' '-1' '-v' '-w' '/tmp/graph15834217003026766210.weights' '-q' '0' '-e' '0.001'
[2022-05-18 23:47:29] [INFO ] Decomposing Gal with order
[2022-05-18 23:47:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 23:47:29] [INFO ] Removed a total of 21 redundant transitions.
[2022-05-18 23:47:30] [INFO ] Flatten gal took : 161 ms
[2022-05-18 23:47:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 13 ms.
[2022-05-18 23:47:30] [INFO ] Time to serialize gal into /tmp/LTL9318979414249550746.gal : 11 ms
[2022-05-18 23:47:30] [INFO ] Time to serialize properties into /tmp/LTL12810708036610826016.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9318979414249550746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12810708036610826016.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9318979...246
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((((u4.P_masterState_56>=1)&&(u4.P_negotiation_103>=1))&&((u4.P_network_1407>=1)&&(u4.P_poll__handlingMessage_4>=1)))||...18888
Formula 0 simplified : !XF"(((((((((((u4.P_masterState_56>=1)&&(u4.P_negotiation_103>=1))&&((u4.P_network_1407>=1)&&(u4.P_poll__handlingMessage_4>=1)))||((...18882
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15773966645387602327
[2022-05-18 23:47:45] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15773966645387602327
Running compilation step : cd /tmp/ltsmin15773966645387602327;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1063 ms.
Running link step : cd /tmp/ltsmin15773966645387602327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15773966645387602327;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NeoElection-COL-6-LTLFireability-12 finished in 100842 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 205 transition count 184
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 205 transition count 184
Applied a total of 60 rules in 19 ms. Remains 205 /235 variables (removed 30) and now considering 184/340 (removed 156) transitions.
[2022-05-18 23:48:00] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 205 cols
[2022-05-18 23:48:00] [INFO ] Computed 46 place invariants in 2 ms
[2022-05-18 23:48:00] [INFO ] Implicit Places using invariants in 311 ms returned [16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 316 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/235 places, 184/340 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/235 places, 184/340 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s126 1) (GEQ s125 1) (GEQ s127 1) (GEQ s122 1) (GEQ s124 1) (GEQ s123 1))], 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][false, false]]
Product exploration explored 100000 steps with 3060 reset in 195 ms.
Product exploration explored 100000 steps with 3051 reset in 216 ms.
Computed a total of 170 stabilizing places and 184 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 170 transition count 184
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 196 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
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 222 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
[2022-05-18 23:48:01] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 170 cols
[2022-05-18 23:48:01] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 23:48:01] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 23:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 23:48:02] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2022-05-18 23:48:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 23:48:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 23:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 23:48:02] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2022-05-18 23:48:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-18 23:48:02] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2022-05-18 23:48:02] [INFO ] Computed and/alt/rep : 172/368/147 causal constraints (skipped 6 transitions) in 22 ms.
[2022-05-18 23:48:02] [INFO ] Added : 85 causal constraints over 17 iterations in 371 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 184/184 transitions.
Reduce places removed 6 places and 6 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 164 transition count 172
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 158 transition count 172
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 72 place count 128 transition count 142
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 122 transition count 136
Applied a total of 78 rules in 37 ms. Remains 122 /170 variables (removed 48) and now considering 136/184 (removed 48) transitions.
[2022-05-18 23:48:02] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
// Phase 1: matrix 111 rows 122 cols
[2022-05-18 23:48:02] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 23:48:03] [INFO ] Implicit Places using invariants in 186 ms returned []
[2022-05-18 23:48:03] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
// Phase 1: matrix 111 rows 122 cols
[2022-05-18 23:48:03] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 23:48:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-18 23:48:03] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2022-05-18 23:48:03] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-18 23:48:03] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
// Phase 1: matrix 111 rows 122 cols
[2022-05-18 23:48:03] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 23:48:03] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/170 places, 136/184 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/170 places, 136/184 transitions.
Computed a total of 122 stabilizing places and 136 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 122 transition count 136
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 p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA NeoElection-COL-6-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-6-LTLFireability-14 finished in 3514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a CL insensitive property : NeoElection-COL-6-LTLFireability-12
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 55 out of 235 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 235/235 places, 340/340 transitions.
Reduce places removed 6 places and 6 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 223 transition count 334
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 6 place count 223 transition count 328
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 18 place count 217 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 211 transition count 322
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 211 transition count 322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 30 place count 211 transition count 321
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 210 transition count 321
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 209 transition count 320
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 208 transition count 320
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 207 transition count 319
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 206 transition count 319
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 205 transition count 318
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 204 transition count 318
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 203 transition count 317
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 202 transition count 317
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 201 transition count 316
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 604 edges and 200 vertex of which 199 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 43 place count 199 transition count 315
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 43 place count 199 transition count 305
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 63 place count 189 transition count 305
Applied a total of 63 rules in 121 ms. Remains 189 /235 variables (removed 46) and now considering 305/340 (removed 35) transitions.
[2022-05-18 23:48:04] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 189 cols
[2022-05-18 23:48:04] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-18 23:48:04] [INFO ] Implicit Places using invariants in 177 ms returned [11, 13, 15, 17, 20, 22, 24, 26, 29, 31, 33, 35, 38, 40, 42, 44, 47, 49, 51, 53]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 179 ms to find 20 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 169/235 places, 305/340 transitions.
Applied a total of 0 rules in 9 ms. Remains 169 /169 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 169/235 places, 305/340 transitions.
Running random walk in product with property : NeoElection-COL-6-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s29 1) (GEQ s101 1) (GEQ s137 1)) (AND (GEQ s2 1) (GEQ s18 1) (GEQ s60 1) (GEQ s135 1)) (AND (GEQ s5 1) (GEQ s22 1) (GEQ s87 1...], 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][false, false]]
Product exploration explored 100000 steps with 2288 reset in 2369 ms.
Product exploration explored 100000 steps with 2324 reset in 2123 ms.
Computed a total of 169 stabilizing places and 305 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 169 transition count 305
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 187 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 55 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=13 )
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 226 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2022-05-18 23:48:09] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:48:09] [INFO ] Computed 15 place invariants in 8 ms
[2022-05-18 23:48:11] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-18 23:48:11] [INFO ] [Real]Absence check using 10 positive and 5 generalized place invariants in 5 ms returned sat
[2022-05-18 23:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 23:48:11] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2022-05-18 23:48:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 23:48:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-18 23:48:13] [INFO ] [Nat]Absence check using 10 positive and 5 generalized place invariants in 11 ms returned sat
[2022-05-18 23:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 23:48:14] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2022-05-18 23:48:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-05-18 23:48:14] [INFO ] [Nat]Added 75 Read/Feed constraints in 19 ms returned sat
[2022-05-18 23:48:14] [INFO ] Computed and/alt/rep : 185/523/180 causal constraints (skipped 95 transitions) in 36 ms.
[2022-05-18 23:48:14] [INFO ] Added : 62 causal constraints over 13 iterations in 446 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 55 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 305/305 transitions.
Applied a total of 0 rules in 11 ms. Remains 169 /169 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2022-05-18 23:48:14] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:48:14] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-18 23:48:14] [INFO ] Implicit Places using invariants in 104 ms returned []
[2022-05-18 23:48:14] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:48:14] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-18 23:48:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-05-18 23:48:14] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2022-05-18 23:48:14] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-18 23:48:14] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:48:14] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-18 23:48:15] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 169/169 places, 305/305 transitions.
Computed a total of 169 stabilizing places and 305 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 169 transition count 305
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 168 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 49 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=16 )
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 233 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2022-05-18 23:48:15] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:48:15] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-18 23:48:17] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-05-18 23:48:17] [INFO ] [Real]Absence check using 10 positive and 5 generalized place invariants in 9 ms returned sat
[2022-05-18 23:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 23:48:17] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2022-05-18 23:48:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 23:48:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-05-18 23:48:19] [INFO ] [Nat]Absence check using 10 positive and 5 generalized place invariants in 7 ms returned sat
[2022-05-18 23:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 23:48:20] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2022-05-18 23:48:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-05-18 23:48:20] [INFO ] [Nat]Added 75 Read/Feed constraints in 17 ms returned sat
[2022-05-18 23:48:20] [INFO ] Computed and/alt/rep : 185/523/180 causal constraints (skipped 95 transitions) in 35 ms.
[2022-05-18 23:48:20] [INFO ] Added : 62 causal constraints over 13 iterations in 455 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2316 reset in 2494 ms.
Product exploration explored 100000 steps with 2335 reset in 2352 ms.
Built C files in :
/tmp/ltsmin3527417907763701703
[2022-05-18 23:48:25] [INFO ] Computing symmetric may disable matrix : 305 transitions.
[2022-05-18 23:48:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:48:25] [INFO ] Computing symmetric may enable matrix : 305 transitions.
[2022-05-18 23:48:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:48:25] [INFO ] Computing Do-Not-Accords matrix : 305 transitions.
[2022-05-18 23:48:25] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:48:25] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3527417907763701703
Running compilation step : cd /tmp/ltsmin3527417907763701703;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1173 ms.
Running link step : cd /tmp/ltsmin3527417907763701703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3527417907763701703;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14011309189390572924.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 55 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 305/305 transitions.
Applied a total of 0 rules in 16 ms. Remains 169 /169 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2022-05-18 23:48:40] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:48:40] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-18 23:48:40] [INFO ] Implicit Places using invariants in 137 ms returned []
[2022-05-18 23:48:40] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:48:40] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-18 23:48:41] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-05-18 23:48:41] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2022-05-18 23:48:41] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-18 23:48:41] [INFO ] Flow matrix only has 280 transitions (discarded 25 similar events)
// Phase 1: matrix 280 rows 169 cols
[2022-05-18 23:48:41] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-18 23:48:41] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 169/169 places, 305/305 transitions.
Built C files in :
/tmp/ltsmin2836673218907883701
[2022-05-18 23:48:41] [INFO ] Computing symmetric may disable matrix : 305 transitions.
[2022-05-18 23:48:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:48:41] [INFO ] Computing symmetric may enable matrix : 305 transitions.
[2022-05-18 23:48:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:48:41] [INFO ] Computing Do-Not-Accords matrix : 305 transitions.
[2022-05-18 23:48:41] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:48:41] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2836673218907883701
Running compilation step : cd /tmp/ltsmin2836673218907883701;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1227 ms.
Running link step : cd /tmp/ltsmin2836673218907883701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2836673218907883701;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11587959363878599546.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 23:48:56] [INFO ] Flatten gal took : 35 ms
[2022-05-18 23:48:56] [INFO ] Flatten gal took : 30 ms
[2022-05-18 23:48:56] [INFO ] Time to serialize gal into /tmp/LTL3061902063550660150.gal : 6 ms
[2022-05-18 23:48:56] [INFO ] Time to serialize properties into /tmp/LTL17022664027139997569.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3061902063550660150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17022664027139997569.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3061902...267
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((((P_masterState_56>=1)&&(P_negotiation_103>=1))&&((P_network_1407>=1)&&(P_poll__handlingMessage_4>=1)))||(((P_masterS...16008
Formula 0 simplified : !XF"(((((((((((P_masterState_56>=1)&&(P_negotiation_103>=1))&&((P_network_1407>=1)&&(P_poll__handlingMessage_4>=1)))||(((P_masterSta...16002
Detected timeout of ITS tools.
[2022-05-18 23:49:11] [INFO ] Flatten gal took : 45 ms
[2022-05-18 23:49:11] [INFO ] Applying decomposition
[2022-05-18 23:49:11] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3582839246328767159.txt' '-o' '/tmp/graph3582839246328767159.bin' '-w' '/tmp/graph3582839246328767159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3582839246328767159.bin' '-l' '-1' '-v' '-w' '/tmp/graph3582839246328767159.weights' '-q' '0' '-e' '0.001'
[2022-05-18 23:49:11] [INFO ] Decomposing Gal with order
[2022-05-18 23:49:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 23:49:11] [INFO ] Removed a total of 23 redundant transitions.
[2022-05-18 23:49:12] [INFO ] Flatten gal took : 64 ms
[2022-05-18 23:49:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 7 ms.
[2022-05-18 23:49:12] [INFO ] Time to serialize gal into /tmp/LTL4117914650864508350.gal : 10 ms
[2022-05-18 23:49:12] [INFO ] Time to serialize properties into /tmp/LTL14895485965519691340.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4117914650864508350.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14895485965519691340.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4117914...246
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((((u4.P_masterState_56>=1)&&(u4.P_negotiation_103>=1))&&((u4.P_network_1407>=1)&&(u4.P_poll__handlingMessage_4>=1)))||...18528
Formula 0 simplified : !XF"(((((((((((u4.P_masterState_56>=1)&&(u4.P_negotiation_103>=1))&&((u4.P_network_1407>=1)&&(u4.P_poll__handlingMessage_4>=1)))||((...18522
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12101994948501065664
[2022-05-18 23:49:27] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12101994948501065664
Running compilation step : cd /tmp/ltsmin12101994948501065664;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1096 ms.
Running link step : cd /tmp/ltsmin12101994948501065664;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12101994948501065664;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NeoElection-COL-6-LTLFireability-12 finished in 98427 ms.
[2022-05-18 23:49:42] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10109990455391607055
[2022-05-18 23:49:42] [INFO ] Computing symmetric may disable matrix : 340 transitions.
[2022-05-18 23:49:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:49:42] [INFO ] Computing symmetric may enable matrix : 340 transitions.
[2022-05-18 23:49:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:49:42] [INFO ] Applying decomposition
[2022-05-18 23:49:42] [INFO ] Computing Do-Not-Accords matrix : 340 transitions.
[2022-05-18 23:49:42] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 23:49:42] [INFO ] Flatten gal took : 25 ms
[2022-05-18 23:49:42] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10109990455391607055
Running compilation step : cd /tmp/ltsmin10109990455391607055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14920874637159941116.txt' '-o' '/tmp/graph14920874637159941116.bin' '-w' '/tmp/graph14920874637159941116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14920874637159941116.bin' '-l' '-1' '-v' '-w' '/tmp/graph14920874637159941116.weights' '-q' '0' '-e' '0.001'
[2022-05-18 23:49:42] [INFO ] Decomposing Gal with order
[2022-05-18 23:49:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 23:49:42] [INFO ] Removed a total of 31 redundant transitions.
[2022-05-18 23:49:42] [INFO ] Flatten gal took : 44 ms
[2022-05-18 23:49:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 5 ms.
[2022-05-18 23:49:42] [INFO ] Time to serialize gal into /tmp/LTLFireability6464660172258705030.gal : 6 ms
[2022-05-18 23:49:42] [INFO ] Time to serialize properties into /tmp/LTLFireability14459164087394825043.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6464660172258705030.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14459164087394825043.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((((u9.P_masterState_56>=1)&&(u9.P_negotiation_103>=1))&&((u9.P_network_1407>=1)&&(u9.P_poll__handlingMessage_4>=1)))||...19288
Formula 0 simplified : !XF"(((((((((((u9.P_masterState_56>=1)&&(u9.P_negotiation_103>=1))&&((u9.P_network_1407>=1)&&(u9.P_poll__handlingMessage_4>=1)))||((...19282
Compilation finished in 1361 ms.
Running link step : cd /tmp/ltsmin10109990455391607055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10109990455391607055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: LTL layer: formula: X(<>((LTLAPp0==true)))
pins2lts-mc-linux64( 0/ 8), 0.007: "X(<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 0.029: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.079: DFS-FIFO for weak LTL, using special progress label 342
pins2lts-mc-linux64( 0/ 8), 0.079: There are 343 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.079: State length is 236, there are 342 groups
pins2lts-mc-linux64( 0/ 8), 0.079: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.079: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.079: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.079: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.269: ~120 levels ~960 states ~7392 transitions
pins2lts-mc-linux64( 5/ 8), 0.375: ~203 levels ~1920 states ~12344 transitions
pins2lts-mc-linux64( 7/ 8), 0.444: ~207 levels ~3840 states ~14624 transitions
pins2lts-mc-linux64( 5/ 8), 0.535: ~213 levels ~7680 states ~18896 transitions
pins2lts-mc-linux64( 7/ 8), 0.687: ~213 levels ~15360 states ~29432 transitions
pins2lts-mc-linux64( 7/ 8), 0.968: ~219 levels ~30720 states ~49536 transitions
pins2lts-mc-linux64( 7/ 8), 1.544: ~219 levels ~61440 states ~90672 transitions
pins2lts-mc-linux64( 3/ 8), 2.550: ~216 levels ~122880 states ~162624 transitions
pins2lts-mc-linux64( 3/ 8), 4.393: ~216 levels ~245760 states ~348000 transitions
pins2lts-mc-linux64( 3/ 8), 7.400: ~222 levels ~491520 states ~684104 transitions
pins2lts-mc-linux64( 3/ 8), 12.280: ~222 levels ~983040 states ~1390472 transitions
pins2lts-mc-linux64( 3/ 8), 20.615: ~222 levels ~1966080 states ~2830824 transitions
pins2lts-mc-linux64( 0/ 8), 36.705: ~276 levels ~3932160 states ~5720704 transitions
pins2lts-mc-linux64( 0/ 8), 68.680: ~276 levels ~7864320 states ~11543408 transitions
pins2lts-mc-linux64( 3/ 8), 133.296: ~222 levels ~15728640 states ~24337648 transitions
pins2lts-mc-linux64( 3/ 8), 264.863: ~222 levels ~31457280 states ~50069736 transitions
pins2lts-mc-linux64( 3/ 8), 528.933: ~222 levels ~62914560 states ~102680744 transitions
pins2lts-mc-linux64( 3/ 8), 1075.567: ~222 levels ~125829120 states ~217228768 transitions
pins2lts-mc-linux64( 7/ 8), 1239.295: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1239.399:
pins2lts-mc-linux64( 0/ 8), 1239.399: mean standard work distribution: 3.5% (states) 4.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 1239.399:
pins2lts-mc-linux64( 0/ 8), 1239.399: Explored 134205442 states 236834148 transitions, fanout: 1.765
pins2lts-mc-linux64( 0/ 8), 1239.399: Total exploration time 1239.310 sec (1239.190 sec minimum, 1239.254 sec on average)
pins2lts-mc-linux64( 0/ 8), 1239.399: States per second: 108290, Transitions per second: 191102
pins2lts-mc-linux64( 0/ 8), 1239.399:
pins2lts-mc-linux64( 0/ 8), 1239.399: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 1239.399: Redundant explorations: -0.0088
pins2lts-mc-linux64( 0/ 8), 1239.399:
pins2lts-mc-linux64( 0/ 8), 1239.399: Queue width: 8B, total height: 2024, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 1239.399: Tree memory: 1049.3MB, 8.2 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 1239.399: Tree fill ratio (roots/leafs): 99.0%/9.0%
pins2lts-mc-linux64( 0/ 8), 1239.399: Stored 342 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1239.399: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1239.400: Est. total memory use: 1049.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10109990455391607055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10109990455391607055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 00:10:52] [INFO ] Applying decomposition
[2022-05-19 00:10:52] [INFO ] Flatten gal took : 25 ms
[2022-05-19 00:10:52] [INFO ] Decomposing Gal with order
[2022-05-19 00:10:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 00:10:52] [INFO ] Removed a total of 891 redundant transitions.
[2022-05-19 00:10:52] [INFO ] Flatten gal took : 73 ms
[2022-05-19 00:10:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-19 00:10:52] [INFO ] Time to serialize gal into /tmp/LTLFireability7859435999325838739.gal : 7 ms
[2022-05-19 00:10:52] [INFO ] Time to serialize properties into /tmp/LTLFireability12679195709357778354.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7859435999325838739.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12679195709357778354.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((((MBOOLM56.P_masterState_56>=1)&&(MMNEGSTEP103.P_negotiation_103>=1))&&((MMMTM1407.P_network_1407>=1)&&(M4.P_poll__ha...21036
Formula 0 simplified : !XF"(((((((((((MBOOLM56.P_masterState_56>=1)&&(MMNEGSTEP103.P_negotiation_103>=1))&&((MMMTM1407.P_network_1407>=1)&&(M4.P_poll__hand...21030
Detected timeout of ITS tools.
[2022-05-19 00:32:03] [INFO ] Flatten gal took : 32 ms
[2022-05-19 00:32:03] [INFO ] Input system was already deterministic with 340 transitions.
[2022-05-19 00:32:03] [INFO ] Transformed 235 places.
[2022-05-19 00:32:03] [INFO ] Transformed 340 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 00:32:03] [INFO ] Time to serialize gal into /tmp/LTLFireability4570135779700917071.gal : 4 ms
[2022-05-19 00:32:03] [INFO ] Time to serialize properties into /tmp/LTLFireability7153871897518601491.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4570135779700917071.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7153871897518601491.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F("(((((((((((P_masterState_56>=1)&&(P_negotiation_103>=1))&&((P_network_1407>=1)&&(P_poll__handlingMessage_4>=1)))||(((P_masterS...16008
Formula 0 simplified : !XF"(((((((((((P_masterState_56>=1)&&(P_negotiation_103>=1))&&((P_network_1407>=1)&&(P_poll__handlingMessage_4>=1)))||(((P_masterSta...16002

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-6"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-6, 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 r150-smll-165276998300036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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