Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 9.0K Apr 11 18:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 11 18:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 18:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 18:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:43 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-2-LTLFireability-00
FORMULA_NAME NeoElection-COL-2-LTLFireability-01
FORMULA_NAME NeoElection-COL-2-LTLFireability-02
FORMULA_NAME NeoElection-COL-2-LTLFireability-03
FORMULA_NAME NeoElection-COL-2-LTLFireability-04
FORMULA_NAME NeoElection-COL-2-LTLFireability-05
FORMULA_NAME NeoElection-COL-2-LTLFireability-06
FORMULA_NAME NeoElection-COL-2-LTLFireability-07
FORMULA_NAME NeoElection-COL-2-LTLFireability-08
FORMULA_NAME NeoElection-COL-2-LTLFireability-09
FORMULA_NAME NeoElection-COL-2-LTLFireability-10
FORMULA_NAME NeoElection-COL-2-LTLFireability-11
FORMULA_NAME NeoElection-COL-2-LTLFireability-12
FORMULA_NAME NeoElection-COL-2-LTLFireability-13
FORMULA_NAME NeoElection-COL-2-LTLFireability-14
FORMULA_NAME NeoElection-COL-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717238412235

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:40:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:40:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:40: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.
[2024-06-01 10:40:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 10:40:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 585 ms
[2024-06-01 10:40:14] [INFO ] Detected 6 constant HL places corresponding to 192 PT places.
[2024-06-01 10:40:14] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 438 PT places and 672.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 10:40:14] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2024-06-01 10:40:14] [INFO ] Skeletonized 10 HLPN properties in 1 ms. Removed 6 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-COL-2-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Remains 6 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-2-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Reduction of identical properties reduced properties to check from 6 to 3
RANDOM walk for 58 steps (1 resets) in 9 ms. (5 steps per ms) remains 0/3 properties
[2024-06-01 10:40:14] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 10:40:14] [INFO ] Flatten gal took : 14 ms
FORMULA NeoElection-COL-2-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:40:14] [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.
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.
Domain [M(3), POS(2), M(3)] of place P_masterList breaks symmetries in sort M
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.
Arc [15:1*[$m, (MOD (ADD $i 1) 2)]] contains successor/predecessor on variables of sort POS
[2024-06-01 10:40:14] [INFO ] Unfolded HLPN to a Petri net with 438 places and 295 transitions 1570 arcs in 55 ms.
[2024-06-01 10:40:14] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 403 places in 1 ms
Reduce places removed 407 places and 275 transitions.
Reduce places removed 3 places and 0 transitions.
FORMULA NeoElection-COL-2-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 20
Applied a total of 2 rules in 8 ms. Remains 26 /28 variables (removed 2) and now considering 20/20 (removed 0) transitions.
[2024-06-01 10:40:14] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 26 cols
[2024-06-01 10:40:14] [INFO ] Computed 7 invariants in 7 ms
[2024-06-01 10:40:14] [INFO ] Implicit Places using invariants in 146 ms returned [4, 5, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 174 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 193 ms. Remains : 23/28 places, 20/20 transitions.
Support contains 18 out of 23 places after structural reductions.
[2024-06-01 10:40:14] [INFO ] Flatten gal took : 4 ms
[2024-06-01 10:40:14] [INFO ] Flatten gal took : 4 ms
[2024-06-01 10:40:14] [INFO ] Input system was already deterministic with 20 transitions.
Reduction of identical properties reduced properties to check from 9 to 7
RANDOM walk for 96 steps (0 resets) in 10 ms. (8 steps per ms) remains 0/7 properties
FORMULA NeoElection-COL-2-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 23 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((p2&&F(p3))||p1))))'
Support contains 10 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-06-01 10:40:14] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 23 cols
[2024-06-01 10:40:14] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 10:40:14] [INFO ] Implicit Places using invariants in 36 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 22/23 places, 20/20 transitions.
Stuttering acceptance computed with spot in 520 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : NeoElection-COL-2-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA NeoElection-COL-2-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-2-LTLFireability-02 finished in 613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 2 places and 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 21 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 19 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 17 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 15 transition count 12
Applied a total of 10 rules in 9 ms. Remains 15 /23 variables (removed 8) and now considering 12/20 (removed 8) transitions.
[2024-06-01 10:40:15] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 15 cols
[2024-06-01 10:40:15] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 10:40:15] [INFO ] Implicit Places using invariants in 30 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/23 places, 12/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41 ms. Remains : 14/23 places, 12/20 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-2-LTLFireability-05
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-2-LTLFireability-05 finished in 90 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p1&&G(p2))||p0))))'
Support contains 10 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-06-01 10:40:15] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 23 cols
[2024-06-01 10:40:15] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 10:40:15] [INFO ] Implicit Places using invariants in 40 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 22/23 places, 20/20 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : NeoElection-COL-2-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-2-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-2-LTLFireability-07 finished in 199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 2 places and 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 21 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 19 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 17 transition count 14
Applied a total of 8 rules in 5 ms. Remains 17 /23 variables (removed 6) and now considering 14/20 (removed 6) transitions.
[2024-06-01 10:40:15] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 17 cols
[2024-06-01 10:40:15] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 10:40:15] [INFO ] Implicit Places using invariants in 31 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/23 places, 14/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39 ms. Remains : 16/23 places, 14/20 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-2-LTLFireability-08
Stuttering criterion allowed to conclude after 18 steps with 3 reset in 1 ms.
FORMULA NeoElection-COL-2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-2-LTLFireability-08 finished in 122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0)) U p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-06-01 10:40:15] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 23 cols
[2024-06-01 10:40:15] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 10:40:15] [INFO ] Implicit Places using invariants in 35 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 22/23 places, 20/20 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), p0]
Running random walk in product with property : NeoElection-COL-2-LTLFireability-12
Product exploration explored 100000 steps with 4653 reset in 268 ms.
Product exploration explored 100000 steps with 4508 reset in 126 ms.
Computed a total of 22 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 20
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 (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 10 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 10:40:17] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 22 cols
[2024-06-01 10:40:17] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 10:40:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 10:40:17] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:40:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:40:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 10:40:17] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:40:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:40:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:40:17] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 6 ms to minimize.
[2024-06-01 10:40:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-06-01 10:40:17] [INFO ] Computed and/alt/rep : 18/39/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:40:17] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 20 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 18 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 16 transition count 14
Applied a total of 8 rules in 3 ms. Remains 16 /22 variables (removed 6) and now considering 14/20 (removed 6) transitions.
[2024-06-01 10:40:17] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 16 cols
[2024-06-01 10:40:17] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 10:40:17] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 10:40:17] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2024-06-01 10:40:17] [INFO ] Invariant cache hit.
[2024-06-01 10:40:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 10:40:17] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-01 10:40:17] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-06-01 10:40:17] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2024-06-01 10:40:17] [INFO ] Invariant cache hit.
[2024-06-01 10:40:17] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem TDEAD4 is UNSAT
At refinement iteration 4 (OVERLAPS) 13/29 variables, 16/19 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 9/28 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 28 constraints, problems are : Problem set: 1 solved, 11 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 16/16 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 13/29 variables, 16/19 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 9/28 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 11/39 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/29 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 39 constraints, problems are : Problem set: 1 solved, 11 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 16/16 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 11/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 481ms problems are : Problem set: 1 solved, 11 unsolved
Search for dead transitions found 1 dead transitions in 486ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 16/22 places, 13/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-06-01 10:40:17] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 573 ms. Remains : 16/22 places, 13/20 transitions.
Computed a total of 16 stabilizing places and 13 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 13
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 (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-2-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-2-LTLFireability-12 finished in 1936 ms.
All properties solved by simple procedures.
Total runtime 4495 ms.
ITS solved all properties within timeout

BK_STOP 1717238418219

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is NeoElection-COL-2, 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 r508-tall-171654351600444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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