About the Execution of GreatSPN+red for NeoElection-COL-3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
365.539 | 11116.00 | 29366.00 | 63.00 | FFFTTFFTFFFFFTTF | normal |
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.r245-tall-171654349900450.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 greatspnxred
Input is NeoElection-COL-3, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349900450
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 8.7K Apr 11 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 11 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 18:20 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.2K 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 2.9K 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 8.8K Apr 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 18:36 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 75K 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-3-CTLFireability-2024-00
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-01
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-02
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-03
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-04
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-05
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-06
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-07
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-08
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-09
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-10
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-11
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-12
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-13
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-14
FORMULA_NAME NeoElection-COL-3-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716667364129
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 20:02:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 20:02:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 20:02:45] [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-05-25 20:02:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 20:02:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 626 ms
[2024-05-25 20:02:46] [INFO ] Detected 6 constant HL places corresponding to 448 PT places.
[2024-05-25 20:02:46] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 972 PT places and 1808.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2024-05-25 20:02:46] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 4 ms.
[2024-05-25 20:02:46] [INFO ] Skeletonized 3 HLPN properties in 1 ms. Removed 13 properties that had guard overlaps.
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 1 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.
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 12 ms
[2024-05-25 20:02:46] [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.
[2024-05-25 20:02:46] [INFO ] Unfolded HLPN to a Petri net with 972 places and 848 transitions 4688 arcs in 65 ms.
[2024-05-25 20:02:46] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 901 places and 790 transitions.
Reduce places removed 4 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA NeoElection-COL-3-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 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 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 59 transition count 55
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 59 transition count 55
Applied a total of 10 rules in 17 ms. Remains 59 /67 variables (removed 8) and now considering 55/58 (removed 3) transitions.
[2024-05-25 20:02:46] [INFO ] Flow matrix only has 51 transitions (discarded 4 similar events)
// Phase 1: matrix 51 rows 59 cols
[2024-05-25 20:02:46] [INFO ] Computed 14 invariants in 18 ms
[2024-05-25 20:02:46] [INFO ] Implicit Places using invariants in 162 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/67 places, 55/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 224 ms. Remains : 58/67 places, 55/58 transitions.
Support contains 56 out of 58 places after structural reductions.
[2024-05-25 20:02:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 14 ms
[2024-05-25 20:02:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NeoElection-COL-3-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 9 ms
[2024-05-25 20:02:46] [INFO ] Input system was already deterministic with 55 transitions.
Support contains 53 out of 58 places (down from 56) after GAL structural reductions.
RANDOM walk for 231 steps (0 resets) in 42 ms. (5 steps per ms) remains 0/10 properties
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 7 ms
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 8 ms
[2024-05-25 20:02:46] [INFO ] Input system was already deterministic with 55 transitions.
Computed a total of 58 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 55
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA NeoElection-COL-3-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 58/58 places, 55/55 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 58 transition count 52
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 55 transition count 52
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 12 place count 49 transition count 40
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 49 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 18 place count 49 transition count 37
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 24 place count 46 transition count 37
Applied a total of 24 rules in 16 ms. Remains 46 /58 variables (removed 12) and now considering 37/55 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 46/58 places, 37/55 transitions.
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 3 ms
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 3 ms
[2024-05-25 20:02:46] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Reduce places removed 3 places and 3 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 52
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 52 transition count 49
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 49 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 46 transition count 40
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 46 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 1 with 6 rules applied. Total rules applied 21 place count 43 transition count 37
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 40 transition count 34
Ensure Unique test removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 37 transition count 34
Applied a total of 27 rules in 13 ms. Remains 37 /58 variables (removed 21) and now considering 34/55 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 37/58 places, 34/55 transitions.
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:02:46] [INFO ] Input system was already deterministic with 34 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 52 transition count 43
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 52 transition count 43
Applied a total of 12 rules in 3 ms. Remains 52 /58 variables (removed 6) and now considering 43/55 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 52/58 places, 43/55 transitions.
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 4 ms
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 5 ms
[2024-05-25 20:02:46] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Reduce places removed 3 places and 3 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 52
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 52 transition count 49
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 49 transition count 49
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 43 transition count 37
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 43 transition count 37
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 40 transition count 34
Ensure Unique test removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 37 transition count 34
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 34 transition count 31
Applied a total of 30 rules in 12 ms. Remains 34 /58 variables (removed 24) and now considering 31/55 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 34/58 places, 31/55 transitions.
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 3 ms
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 3 ms
[2024-05-25 20:02:46] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Reduce places removed 3 places and 3 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 52
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 49 transition count 43
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 49 transition count 43
Applied a total of 9 rules in 5 ms. Remains 49 /58 variables (removed 9) and now considering 43/55 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 49/58 places, 43/55 transitions.
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 4 ms
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 4 ms
[2024-05-25 20:02:46] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 58/58 places, 55/55 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 58 transition count 52
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 55 transition count 52
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 52 transition count 49
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 52 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 12 place count 52 transition count 48
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 51 transition count 48
Applied a total of 14 rules in 8 ms. Remains 51 /58 variables (removed 7) and now considering 48/55 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 51/58 places, 48/55 transitions.
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 5 ms
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 5 ms
[2024-05-25 20:02:46] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 46
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 46
Applied a total of 6 rules in 2 ms. Remains 55 /58 variables (removed 3) and now considering 46/55 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 55/58 places, 46/55 transitions.
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 3 ms
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 4 ms
[2024-05-25 20:02:46] [INFO ] Input system was already deterministic with 46 transitions.
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 6 ms
[2024-05-25 20:02:46] [INFO ] Flatten gal took : 6 ms
[2024-05-25 20:02:46] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-25 20:02:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 58 places, 55 transitions and 239 arcs took 1 ms.
Total runtime 1749 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running NeoElection-COL-3
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 58
TRANSITIONS: 55
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.002s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 519
MODEL NAME: /home/mcc/execution/413/model
58 places, 55 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA NeoElection-COL-3-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716667375245
--------------------
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 CTLFireability -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-3"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is NeoElection-COL-3, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654349900450"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;