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

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

=== Now, execution of the tool begins

BK_START 1652908330430

Running Version 202205111006
[2022-05-18 21:12:12] [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 21:12:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 21:12:13] [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:12:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 21:12:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1670 ms
[2022-05-18 21:12:15] [INFO ] Detected 6 constant HL places corresponding to 448 PT places.
[2022-05-18 21:12:15] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 972 PT places and 1808.0 transition bindings in 54 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2022-05-18 21:12:15] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 13 ms.
[2022-05-18 21:12:15] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA NeoElection-COL-3-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-14 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.4 ms
Remains 10 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-3-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Finished random walk after 54 steps, including 3 resets, run visited all 9 properties in 28 ms. (steps per millisecond=1 )
[2022-05-18 21:12:15] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-18 21:12:15] [INFO ] Flatten gal took : 29 ms
FORMULA NeoElection-COL-3-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 21:12:15] [INFO ] Flatten gal took : 5 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:12:15] [INFO ] Unfolded HLPN to a Petri net with 972 places and 848 transitions 4688 arcs in 121 ms.
[2022-05-18 21:12:15] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Deduced a syphon composed of 892 places in 5 ms
Reduce places removed 901 places and 790 transitions.
Reduce places removed 4 places and 0 transitions.
FORMULA NeoElection-COL-3-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 56 transition count 46
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 56 transition count 46
Applied a total of 16 rules in 31 ms. Remains 56 /67 variables (removed 11) and now considering 46/58 (removed 12) transitions.
[2022-05-18 21:12:15] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 56 cols
[2022-05-18 21:12:15] [INFO ] Computed 14 place invariants in 31 ms
[2022-05-18 21:12:16] [INFO ] Implicit Places using invariants in 339 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 413 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/67 places, 46/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 47/67 places, 46/58 transitions.
Support contains 22 out of 47 places after structural reductions.
[2022-05-18 21:12:16] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2022-05-18 21:12:16] [INFO ] Flatten gal took : 43 ms
FORMULA NeoElection-COL-3-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 21:12:16] [INFO ] Flatten gal took : 26 ms
[2022-05-18 21:12:16] [INFO ] Input system was already deterministic with 46 transitions.
Finished random walk after 16 steps, including 0 resets, run visited all 5 properties in 7 ms. (steps per millisecond=2 )
Computed a total of 47 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 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' '!(F(G((F(X(p1))&&p0))))'
Support contains 16 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 46/46 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 47 transition count 43
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 44 transition count 43
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 41 transition count 40
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 41 transition count 40
Applied a total of 12 rules in 13 ms. Remains 41 /47 variables (removed 6) and now considering 40/46 (removed 6) transitions.
[2022-05-18 21:12:16] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
// Phase 1: matrix 36 rows 41 cols
[2022-05-18 21:12:16] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-18 21:12:16] [INFO ] Implicit Places using invariants in 84 ms returned []
[2022-05-18 21:12:16] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
// Phase 1: matrix 36 rows 41 cols
[2022-05-18 21:12:16] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-18 21:12:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-18 21:12:16] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2022-05-18 21:12:16] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-18 21:12:16] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
// Phase 1: matrix 36 rows 41 cols
[2022-05-18 21:12:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:12:16] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/47 places, 40/46 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/47 places, 40/46 transitions.
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NeoElection-COL-3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s0 1) (LT s1 1) (LT s2 1)), p1:(AND (OR (LT s3 1) (LT s11 1) (LT s29 1)) (OR (LT s26 1) (LT s31 1)) (OR (LT s6 1) (LT s18 1) (LT s30 1)) (OR (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6885 reset in 911 ms.
Product exploration explored 100000 steps with 6846 reset in 310 ms.
Computed a total of 41 stabilizing places and 40 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 40
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 9 factoid took 489 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NeoElection-COL-3-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-3-LTLFireability-01 finished in 2555 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 13 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 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 44 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 41 transition count 40
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 38 transition count 37
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 38 transition count 37
Applied a total of 12 rules in 6 ms. Remains 38 /47 variables (removed 9) and now considering 37/46 (removed 9) transitions.
[2022-05-18 21:12:19] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 38 cols
[2022-05-18 21:12:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:12:19] [INFO ] Implicit Places using invariants in 91 ms returned []
[2022-05-18 21:12:19] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 38 cols
[2022-05-18 21:12:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:12:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-18 21:12:19] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2022-05-18 21:12:19] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-18 21:12:19] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 38 cols
[2022-05-18 21:12:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:12:19] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/47 places, 37/46 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/47 places, 37/46 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s8 1) (GEQ s26 1)) (AND (GEQ s23 1) (GEQ s28 1)) (AND (GEQ s3 1) (GEQ s15 1) (GEQ s27 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s27...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7766 steps with 1156 reset in 53 ms.
FORMULA NeoElection-COL-3-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-3-LTLFireability-03 finished in 521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(X(p1))||p0))))'
Support contains 16 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2022-05-18 21:12:19] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 47 cols
[2022-05-18 21:12:19] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-18 21:12:19] [INFO ] Implicit Places using invariants in 89 ms returned []
[2022-05-18 21:12:19] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 47 cols
[2022-05-18 21:12:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:12:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-18 21:12:19] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2022-05-18 21:12:19] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 47 cols
[2022-05-18 21:12:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:12:19] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/47 places, 46/46 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-COL-3-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(OR (GEQ s46 1) (GEQ s43 1) (GEQ s40 1)), p1:(AND (OR (LT s3 1) (LT s11 1) (LT s29 1)) (OR (LT s26 1) (LT s31 1)) (OR (LT s6 1) (LT s18 1) (LT s30 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 211 ms.
Product exploration explored 100000 steps with 25000 reset in 289 ms.
Computed a total of 47 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NeoElection-COL-3-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-3-LTLFireability-05 finished in 1324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||G(p1)))'
Support contains 16 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2022-05-18 21:12:20] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 47 cols
[2022-05-18 21:12:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:12:20] [INFO ] Implicit Places using invariants in 65 ms returned []
[2022-05-18 21:12:20] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 47 cols
[2022-05-18 21:12:20] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-18 21:12:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-18 21:12:21] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2022-05-18 21:12:21] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 47 cols
[2022-05-18 21:12:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:12:21] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/47 places, 46/46 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-COL-3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s3 1) (LT s11 1) (LT s29 1)) (OR (LT s26 1) (LT s31 1)) (OR (LT s6 1) (LT s18 1) (LT s30 1)) (OR (LT s5 1) (LT s14 1) (LT s30 1)) (OR (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 326 ms.
Product exploration explored 100000 steps with 50000 reset in 347 ms.
Computed a total of 47 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 206 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NeoElection-COL-3-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-3-LTLFireability-06 finished in 1394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(G(X(p1)))&&p0)))'
Support contains 13 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 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 44 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 41 transition count 40
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 38 transition count 37
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 38 transition count 37
Applied a total of 12 rules in 12 ms. Remains 38 /47 variables (removed 9) and now considering 37/46 (removed 9) transitions.
[2022-05-18 21:12:22] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 38 cols
[2022-05-18 21:12:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:12:22] [INFO ] Implicit Places using invariants in 64 ms returned []
[2022-05-18 21:12:22] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 38 cols
[2022-05-18 21:12:22] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-18 21:12:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-18 21:12:22] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2022-05-18 21:12:22] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-18 21:12:22] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 38 cols
[2022-05-18 21:12:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 21:12:22] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/47 places, 37/46 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/47 places, 37/46 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NeoElection-COL-3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s8 1) (LT s26 1)) (OR (LT s23 1) (LT s28 1)) (OR (LT s3 1) (LT s15 1) (LT s27 1)) (OR (LT s2 1) (LT s11 1) (LT s27 1)) (OR (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-3-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-3-LTLFireability-09 finished in 367 ms.
All properties solved by simple procedures.
Total runtime 9678 ms.

BK_STOP 1652908343046

--------------------
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-3"
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-3, 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-165276998300012"
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 [ "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 ;