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-165276998300011.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-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998300011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 11K Apr 30 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 30 04:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 04:00 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.4K May 9 08:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K 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 75K 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-3-LTLCardinality-00
FORMULA_NAME NeoElection-COL-3-LTLCardinality-01
FORMULA_NAME NeoElection-COL-3-LTLCardinality-02
FORMULA_NAME NeoElection-COL-3-LTLCardinality-03
FORMULA_NAME NeoElection-COL-3-LTLCardinality-04
FORMULA_NAME NeoElection-COL-3-LTLCardinality-05
FORMULA_NAME NeoElection-COL-3-LTLCardinality-06
FORMULA_NAME NeoElection-COL-3-LTLCardinality-07
FORMULA_NAME NeoElection-COL-3-LTLCardinality-08
FORMULA_NAME NeoElection-COL-3-LTLCardinality-09
FORMULA_NAME NeoElection-COL-3-LTLCardinality-10
FORMULA_NAME NeoElection-COL-3-LTLCardinality-11
FORMULA_NAME NeoElection-COL-3-LTLCardinality-12
FORMULA_NAME NeoElection-COL-3-LTLCardinality-13
FORMULA_NAME NeoElection-COL-3-LTLCardinality-14
FORMULA_NAME NeoElection-COL-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652908307447

Running Version 202205111006
[2022-05-18 21:11:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 21:11:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 21:11:49] [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 21:11:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 21:11:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1101 ms
[2022-05-18 21:11:50] [INFO ] Detected 6 constant HL places corresponding to 448 PT places.
[2022-05-18 21:11:50] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 972 PT places and 1808.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2022-05-18 21:11:50] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 15 ms.
[2022-05-18 21:11:50] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA NeoElection-COL-3-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Remains 13 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-3-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Incomplete random walk after 10002 steps, including 386 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 400 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 6 cols
[2022-05-18 21:11:51] [INFO ] Computed 1 place invariants in 15 ms
[2022-05-18 21:11:51] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-05-18 21:11:51] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA NeoElection-COL-3-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 21:11:51] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2022-05-18 21:11:51] [INFO ] Flatten gal took : 53 ms
FORMULA NeoElection-COL-3-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 21:11:51] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Domain [M(4), POS(3), M(4)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 3)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-18 21:11:51] [INFO ] Unfolded HLPN to a Petri net with 972 places and 848 transitions 4688 arcs in 98 ms.
[2022-05-18 21:11:51] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Deduced a syphon composed of 892 places in 3 ms
Reduce places removed 901 places and 790 transitions.
Reduce places removed 4 places and 0 transitions.
Support contains 33 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 58/58 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 58
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 55 transition count 46
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 55 transition count 46
Applied a total of 18 rules in 14 ms. Remains 55 /67 variables (removed 12) and now considering 46/58 (removed 12) transitions.
[2022-05-18 21:11:52] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 55 cols
[2022-05-18 21:11:52] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-18 21:11:52] [INFO ] Implicit Places using invariants in 134 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 138 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/67 places, 46/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 46/67 places, 46/58 transitions.
Support contains 33 out of 46 places after structural reductions.
[2022-05-18 21:11:52] [INFO ] Flatten gal took : 14 ms
[2022-05-18 21:11:52] [INFO ] Flatten gal took : 13 ms
[2022-05-18 21:11:52] [INFO ] Input system was already deterministic with 46 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=2 )
Computed a total of 46 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 46
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(F(p0)))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 43
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 43
Applied a total of 4 rules in 5 ms. Remains 44 /46 variables (removed 2) and now considering 43/46 (removed 3) transitions.
[2022-05-18 21:11:52] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 44 cols
[2022-05-18 21:11:52] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-18 21:11:52] [INFO ] Implicit Places using invariants in 83 ms returned []
[2022-05-18 21:11:52] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 44 cols
[2022-05-18 21:11:52] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-18 21:11:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-18 21:11:52] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2022-05-18 21:11:52] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 44 cols
[2022-05-18 21:11:52] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-18 21:11:52] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/46 places, 43/46 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/46 places, 43/46 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s35 s36 s37) 0)], 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 11988 reset in 429 ms.
Product exploration explored 100000 steps with 12008 reset in 218 ms.
Computed a total of 44 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 43
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 156 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 35 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
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 210 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 43 ms :[(NOT p0)]
[2022-05-18 21:11:54] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 44 cols
[2022-05-18 21:11:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-18 21:11:54] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 21:11:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 21:11:54] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-05-18 21:11:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 21:11:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 21:11:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 21:11:54] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-18 21:11:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-18 21:11:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-18 21:11:54] [INFO ] Computed and/alt/rep : 39/91/35 causal constraints (skipped 1 transitions) in 7 ms.
[2022-05-18 21:11:54] [INFO ] Added : 30 causal constraints over 6 iterations in 196 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 43/43 transitions.
Reduce places removed 3 places and 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 38 transition count 37
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 35 transition count 34
Applied a total of 9 rules in 22 ms. Remains 35 /44 variables (removed 9) and now considering 34/43 (removed 9) transitions.
[2022-05-18 21:11:54] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 35 cols
[2022-05-18 21:11:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:11:54] [INFO ] Implicit Places using invariants in 95 ms returned []
[2022-05-18 21:11:54] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 35 cols
[2022-05-18 21:11:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:11:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-18 21:11:54] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2022-05-18 21:11:54] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-18 21:11:54] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 35 cols
[2022-05-18 21:11:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:11:54] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/44 places, 34/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/44 places, 34/43 transitions.
Computed a total of 35 stabilizing places and 34 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35 transition count 34
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 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA NeoElection-COL-3-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-3-LTLCardinality-00 finished in 2868 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(p0)))))'
Support contains 24 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2022-05-18 21:11:55] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 46 cols
[2022-05-18 21:11:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:11:55] [INFO ] Implicit Places using invariants in 68 ms returned []
[2022-05-18 21:11:55] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 46 cols
[2022-05-18 21:11:55] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-18 21:11:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-18 21:11:55] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2022-05-18 21:11:55] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 46 cols
[2022-05-18 21:11:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:11:55] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 46/46 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30))], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-3-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-3-LTLCardinality-02 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Reduce places removed 3 places and 3 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 43 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 40 transition count 40
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 38 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 38 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 35 transition count 34
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 32 transition count 31
Applied a total of 19 rules in 17 ms. Remains 32 /46 variables (removed 14) and now considering 31/46 (removed 15) transitions.
[2022-05-18 21:11:55] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 32 cols
[2022-05-18 21:11:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:11:55] [INFO ] Implicit Places using invariants in 80 ms returned []
[2022-05-18 21:11:55] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 32 cols
[2022-05-18 21:11:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:11:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-18 21:11:55] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2022-05-18 21:11:55] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-18 21:11:55] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 32 cols
[2022-05-18 21:11:55] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-18 21:11:56] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/46 places, 31/46 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/46 places, 31/46 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s26 s27 s28))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 20511 reset in 356 ms.
Product exploration explored 100000 steps with 20517 reset in 495 ms.
Computed a total of 32 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 31
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)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 215 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 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 247 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 50 ms :[(NOT p0)]
[2022-05-18 21:11:57] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 32 cols
[2022-05-18 21:11:57] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-18 21:11:57] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-18 21:11:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 21:11:57] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-18 21:11:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 21:11:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-18 21:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 21:11:57] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-18 21:11:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-18 21:11:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-18 21:11:57] [INFO ] Computed and/alt/rep : 28/55/24 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 21:11:57] [INFO ] Added : 7 causal constraints over 2 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 31/31 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2022-05-18 21:11:57] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 32 cols
[2022-05-18 21:11:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:11:57] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-18 21:11:57] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 32 cols
[2022-05-18 21:11:57] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-18 21:11:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-18 21:11:58] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-05-18 21:11:58] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-18 21:11:58] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 32 cols
[2022-05-18 21:11:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-18 21:11:58] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 31/31 transitions.
Computed a total of 32 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 31
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)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 144 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 32 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 192 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2022-05-18 21:11:58] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 32 cols
[2022-05-18 21:11:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-18 21:11:58] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-18 21:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 21:11:58] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-18 21:11:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 21:11:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-18 21:11:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 21:11:58] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-05-18 21:11:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-18 21:11:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-18 21:11:58] [INFO ] Computed and/alt/rep : 28/55/24 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 21:11:58] [INFO ] Added : 7 causal constraints over 2 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20533 reset in 244 ms.
Product exploration explored 100000 steps with 20587 reset in 270 ms.
Built C files in :
/tmp/ltsmin14943396589997746112
[2022-05-18 21:11:59] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2022-05-18 21:11:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 21:11:59] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2022-05-18 21:11:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 21:11:59] [INFO ] Computing Do-Not-Accords matrix : 31 transitions.
[2022-05-18 21:11:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 21:11:59] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14943396589997746112
Running compilation step : cd /tmp/ltsmin14943396589997746112;'/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 474 ms.
Running link step : cd /tmp/ltsmin14943396589997746112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin14943396589997746112;'/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/stateBased9590840474232036684.hoa' '--buchi-type=spotba'
LTSmin run took 1977 ms.
FORMULA NeoElection-COL-3-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-3-LTLCardinality-03 finished in 6300 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(p0))))'
Support contains 24 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Reduce places removed 3 places and 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 43 transition count 40
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 40 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 40 transition count 37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 37 transition count 37
Applied a total of 12 rules in 6 ms. Remains 37 /46 variables (removed 9) and now considering 37/46 (removed 9) transitions.
[2022-05-18 21:12:02] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 37 cols
[2022-05-18 21:12:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:12:02] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-18 21:12:02] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 37 cols
[2022-05-18 21:12:02] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-18 21:12:02] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-05-18 21:12:02] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2022-05-18 21:12:02] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-18 21:12:02] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 37 cols
[2022-05-18 21:12:02] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-18 21:12:02] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/46 places, 37/46 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/46 places, 37/46 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27) 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-3-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-3-LTLCardinality-04 finished in 249 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 46 transition count 43
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 43 transition count 43
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 41 transition count 40
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 41 transition count 40
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 38 transition count 37
Applied a total of 16 rules in 12 ms. Remains 38 /46 variables (removed 8) and now considering 37/46 (removed 9) transitions.
[2022-05-18 21:12:02] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 38 cols
[2022-05-18 21:12:02] [INFO ] Computed 5 place invariants in 11 ms
[2022-05-18 21:12:02] [INFO ] Implicit Places using invariants in 82 ms returned []
[2022-05-18 21:12:02] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 38 cols
[2022-05-18 21:12:02] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-18 21:12:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-18 21:12:02] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2022-05-18 21:12:02] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-18 21:12:02] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 38 cols
[2022-05-18 21:12:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:12:02] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/46 places, 37/46 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/46 places, 37/46 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 3 (ADD s35 s36 s37)) (GT (ADD s0 s1 s2) (ADD s29 s30 s31)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 81 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-3-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-3-LTLCardinality-15 finished in 342 ms.
All properties solved by simple procedures.
Total runtime 13262 ms.

BK_STOP 1652908323023

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-3"
export BK_EXAMINATION="LTLCardinality"
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-3, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-165276998300011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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