Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876811900092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is NeoElection-COL-8, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876811900092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 120K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NeoElection-COL-8-LTLFireability-00
FORMULA_NAME NeoElection-COL-8-LTLFireability-01
FORMULA_NAME NeoElection-COL-8-LTLFireability-02
FORMULA_NAME NeoElection-COL-8-LTLFireability-03
FORMULA_NAME NeoElection-COL-8-LTLFireability-04
FORMULA_NAME NeoElection-COL-8-LTLFireability-05
FORMULA_NAME NeoElection-COL-8-LTLFireability-06
FORMULA_NAME NeoElection-COL-8-LTLFireability-07
FORMULA_NAME NeoElection-COL-8-LTLFireability-08
FORMULA_NAME NeoElection-COL-8-LTLFireability-09
FORMULA_NAME NeoElection-COL-8-LTLFireability-10
FORMULA_NAME NeoElection-COL-8-LTLFireability-11
FORMULA_NAME NeoElection-COL-8-LTLFireability-12
FORMULA_NAME NeoElection-COL-8-LTLFireability-13
FORMULA_NAME NeoElection-COL-8-LTLFireability-14
FORMULA_NAME NeoElection-COL-8-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748803207649

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-8
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-01 18:40:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 18:40:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 18:40:09] [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.
[2025-06-01 18:40:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 18:40:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 623 ms
[2025-06-01 18:40:09] [INFO ] Detected 6 constant HL places corresponding to 5058 PT places.
[2025-06-01 18:40:09] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 10062 PT places and 34578.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2025-06-01 18:40:09] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 6 ms.
[2025-06-01 18:40:09] [INFO ] Skeletonized 7 HLPN properties in 1 ms. Removed 9 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.4 ms
Remains 7 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-8-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 282 steps (7 resets) in 10 ms. (25 steps per ms) remains 0/3 properties
[2025-06-01 18:40:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-01 18:40:09] [INFO ] Flatten gal took : 13 ms
FORMULA NeoElection-COL-8-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 18:40:09] [INFO ] Flatten gal took : 2 ms
Domain [M(9), POS(8), M(9)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 8)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-01 18:40:10] [INFO ] Unfolded HLPN to a Petri net with 10062 places and 19858 transitions 113083 arcs in 219 ms.
[2025-06-01 18:40:10] [INFO ] Unfolded 14 HLPN properties in 6 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 9487 places in 47 ms
Reduce places removed 9551 places and 18965 transitions.
Reduce places removed 9 places and 0 transitions.
FORMULA NeoElection-COL-8-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 299 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 893/893 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 446 transition count 893
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 83 place count 419 transition count 740
Iterating global reduction 1 with 27 rules applied. Total rules applied 110 place count 419 transition count 740
Applied a total of 110 rules in 30 ms. Remains 419 /502 variables (removed 83) and now considering 740/893 (removed 153) transitions.
[2025-06-01 18:40:10] [INFO ] Flow matrix only has 691 transitions (discarded 49 similar events)
// Phase 1: matrix 691 rows 419 cols
[2025-06-01 18:40:10] [INFO ] Computed 79 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:40:10] [INFO ] Implicit Places using invariants in 330 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 360 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 418/502 places, 740/893 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 740/740 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 405 ms. Remains : 418/502 places, 740/893 transitions.
Support contains 299 out of 418 places after structural reductions.
[2025-06-01 18:40:11] [INFO ] Flatten gal took : 96 ms
[2025-06-01 18:40:11] [INFO ] Flatten gal took : 77 ms
[2025-06-01 18:40:11] [INFO ] Input system was already deterministic with 740 transitions.
RANDOM walk for 813 steps (0 resets) in 558 ms. (1 steps per ms) remains 0/7 properties
FORMULA NeoElection-COL-8-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NeoElection-COL-8-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 418 stabilizing places and 740 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 418 transition count 740
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 418/418 places, 740/740 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 355 transition count 326
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 355 transition count 326
Applied a total of 126 rules in 38 ms. Remains 355 /418 variables (removed 63) and now considering 326/740 (removed 414) transitions.
[2025-06-01 18:40:11] [INFO ] Flow matrix only has 277 transitions (discarded 49 similar events)
// Phase 1: matrix 277 rows 355 cols
[2025-06-01 18:40:11] [INFO ] Computed 78 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:40:12] [INFO ] Implicit Places using invariants in 651 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84]
Discarding 63 places :
Implicit Place search using SMT only with invariants took 657 ms to find 63 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 292/418 places, 326/740 transitions.
Applied a total of 0 rules in 14 ms. Remains 292 /292 variables (removed 0) and now considering 326/326 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 713 ms. Remains : 292/418 places, 326/740 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-8-LTLFireability-01
Product exploration explored 100000 steps with 2721 reset in 332 ms.
Product exploration explored 100000 steps with 2708 reset in 296 ms.
Computed a total of 292 stabilizing places and 326 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 292 transition count 326
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 127 steps (0 resets) in 6 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 113 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
[2025-06-01 18:40:13] [INFO ] Flow matrix only has 277 transitions (discarded 49 similar events)
// Phase 1: matrix 277 rows 292 cols
[2025-06-01 18:40:13] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:40:14] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-06-01 18:40:14] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2025-06-01 18:40:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:40:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-06-01 18:40:14] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2025-06-01 18:40:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 18:40:14] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:14] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:15] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:15] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:15] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:15] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:15] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:15] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:15] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:15] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:16] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:16] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:16] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:16] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:16] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:16] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:16] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:17] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:17] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:17] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:17] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:17] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:17] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:17] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:17] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:18] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:18] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:18] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:18] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:18] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:18] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:18] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:18] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:19] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:19] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:19] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:19] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:19] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:19] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:19] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:19] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:19] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:20] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:20] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:20] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:20] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:20] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:20] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:20] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:20] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:20] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:21] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:21] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:21] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:21] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:21] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:21] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 5 ms to minimize.
[2025-06-01 18:40:21] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 6923 ms
[2025-06-01 18:40:21] [INFO ] Computed and/alt/rep : 310/675/261 causal constraints (skipped 8 transitions) in 18 ms.
[2025-06-01 18:40:22] [INFO ] Added : 58 causal constraints over 12 iterations in 560 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 326/326 transitions.
Reduce places removed 8 places and 8 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 284 transition count 310
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 276 transition count 310
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 112 place count 228 transition count 262
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 220 transition count 254
Applied a total of 120 rules in 74 ms. Remains 220 /292 variables (removed 72) and now considering 254/326 (removed 72) transitions.
[2025-06-01 18:40:22] [INFO ] Flow matrix only has 205 transitions (discarded 49 similar events)
// Phase 1: matrix 205 rows 220 cols
[2025-06-01 18:40:22] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:40:22] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-01 18:40:22] [INFO ] Flow matrix only has 205 transitions (discarded 49 similar events)
[2025-06-01 18:40:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:40:22] [INFO ] State equation strengthened by 189 read => feed constraints.
[2025-06-01 18:40:22] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:40:22] [INFO ] Redundant transitions in 10 ms returned []
Running 246 sub problems to find dead transitions.
[2025-06-01 18:40:22] [INFO ] Flow matrix only has 205 transitions (discarded 49 similar events)
[2025-06-01 18:40:22] [INFO ] Invariant cache hit.
[2025-06-01 18:40:22] [INFO ] State equation strengthened by 189 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 8/220 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:25] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:40:25] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Problem TDEAD202 is UNSAT
At refinement iteration 5 (OVERLAPS) 205/425 variables, 220/237 constraints. Problems are: Problem set: 1 solved, 245 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 189/426 constraints. Problems are: Problem set: 1 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/426 constraints. Problems are: Problem set: 1 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 0/425 variables, 0/426 constraints. Problems are: Problem set: 1 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 426 constraints, problems are : Problem set: 1 solved, 245 unsolved in 11033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 220/220 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 8/220 variables, 8/17 constraints. Problems are: Problem set: 1 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 245 unsolved
At refinement iteration 5 (OVERLAPS) 205/425 variables, 220/237 constraints. Problems are: Problem set: 1 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 189/426 constraints. Problems are: Problem set: 1 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 245/671 constraints. Problems are: Problem set: 1 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/671 constraints. Problems are: Problem set: 1 solved, 245 unsolved
At refinement iteration 9 (OVERLAPS) 0/425 variables, 0/671 constraints. Problems are: Problem set: 1 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 671 constraints, problems are : Problem set: 1 solved, 245 unsolved in 13224 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 220/220 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 245/246 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24317ms problems are : Problem set: 1 solved, 245 unsolved
Search for dead transitions found 1 dead transitions in 24324ms
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 : 220/292 places, 253/326 transitions.
Applied a total of 0 rules in 12 ms. Remains 220 /220 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:40:47] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 25020 ms. Remains : 220/292 places, 253/326 transitions.
Computed a total of 220 stabilizing places and 253 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 220 transition count 253
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
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 22 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-8-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-8-LTLFireability-01 finished in 35743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (X(G(!p0))||(!p1&&X(!p0)))))'
Support contains 72 out of 418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 418/418 places, 740/740 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 347 transition count 318
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 347 transition count 318
Applied a total of 142 rules in 22 ms. Remains 347 /418 variables (removed 71) and now considering 318/740 (removed 422) transitions.
[2025-06-01 18:40:47] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
// Phase 1: matrix 269 rows 347 cols
[2025-06-01 18:40:47] [INFO ] Computed 78 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:40:47] [INFO ] Implicit Places using invariants in 195 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84]
Discarding 63 places :
Implicit Place search using SMT only with invariants took 196 ms to find 63 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 284/418 places, 318/740 transitions.
Applied a total of 0 rules in 4 ms. Remains 284 /284 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 222 ms. Remains : 284/418 places, 318/740 transitions.
Stuttering acceptance computed with spot in 82 ms :[p0, p0, true]
Running random walk in product with property : NeoElection-COL-8-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 407 ms.
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Computed a total of 284 stabilizing places and 318 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 284 transition count 318
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 18 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-8-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-8-LTLFireability-09 finished in 1203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X(F(X(p0)))&&F(p1))) U p1)))'
Support contains 8 out of 418 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 740/740 transitions.
Reduce places removed 8 places and 8 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 402 transition count 732
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 16 place count 394 transition count 724
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 394 transition count 724
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 393 transition count 723
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 392 transition count 723
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 391 transition count 722
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 390 transition count 722
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 389 transition count 721
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 388 transition count 721
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 387 transition count 720
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 386 transition count 720
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 33 place count 385 transition count 719
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 34 place count 384 transition count 719
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 35 place count 383 transition count 718
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 36 place count 382 transition count 718
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 37 place count 381 transition count 717
Applied a total of 37 rules in 169 ms. Remains 381 /418 variables (removed 37) and now considering 717/740 (removed 23) transitions.
[2025-06-01 18:40:48] [INFO ] Flow matrix only has 668 transitions (discarded 49 similar events)
// Phase 1: matrix 668 rows 381 cols
[2025-06-01 18:40:48] [INFO ] Computed 64 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:40:48] [INFO ] Implicit Places using invariants in 178 ms returned [15, 17, 19, 21, 23, 25, 28, 30, 32, 34, 36, 38, 41, 43, 45, 47, 49, 51, 54, 56, 58, 60, 62, 64, 67, 69, 71, 73, 75, 77, 80, 82, 84, 86, 88, 90, 93, 95, 97, 99, 101, 103]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 180 ms to find 42 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 339/418 places, 717/740 transitions.
Applied a total of 0 rules in 14 ms. Remains 339 /339 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 363 ms. Remains : 339/418 places, 717/740 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Running random walk in product with property : NeoElection-COL-8-LTLFireability-10
Product exploration explored 100000 steps with 11323 reset in 281 ms.
Product exploration explored 100000 steps with 11387 reset in 292 ms.
Computed a total of 339 stabilizing places and 717 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 339 transition count 717
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
RANDOM walk for 41 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 231 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
[2025-06-01 18:40:50] [INFO ] Flow matrix only has 668 transitions (discarded 49 similar events)
// Phase 1: matrix 668 rows 339 cols
[2025-06-01 18:40:50] [INFO ] Computed 22 invariants in 10 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:40:50] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-06-01 18:40:50] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-01 18:40:50] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2025-06-01 18:40:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:40:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-01 18:40:51] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-01 18:40:51] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2025-06-01 18:40:51] [INFO ] State equation strengthened by 196 read => feed constraints.
[2025-06-01 18:40:51] [INFO ] [Nat]Added 196 Read/Feed constraints in 75 ms returned sat
[2025-06-01 18:40:51] [INFO ] Computed and/alt/rep : 410/1124/409 causal constraints (skipped 251 transitions) in 50 ms.
[2025-06-01 18:40:52] [INFO ] Added : 98 causal constraints over 20 iterations in 1174 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 8 out of 339 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 339/339 places, 717/717 transitions.
Applied a total of 0 rules in 20 ms. Remains 339 /339 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2025-06-01 18:40:53] [INFO ] Flow matrix only has 668 transitions (discarded 49 similar events)
[2025-06-01 18:40:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:40:53] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-01 18:40:53] [INFO ] Flow matrix only has 668 transitions (discarded 49 similar events)
[2025-06-01 18:40:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:40:53] [INFO ] State equation strengthened by 196 read => feed constraints.
[2025-06-01 18:40:54] [INFO ] Implicit Places using invariants and state equation in 1333 ms returned []
Implicit Place search using SMT with State Equation took 1438 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:40:54] [INFO ] Redundant transitions in 22 ms returned []
Running 709 sub problems to find dead transitions.
[2025-06-01 18:40:54] [INFO ] Flow matrix only has 668 transitions (discarded 49 similar events)
[2025-06-01 18:40:54] [INFO ] Invariant cache hit.
[2025-06-01 18:40:54] [INFO ] State equation strengthened by 196 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 3 (OVERLAPS) 8/339 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Problem TDEAD203 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 5 (OVERLAPS) 668/1007 variables, 339/361 constraints. Problems are: Problem set: 7 solved, 702 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 196/557 constraints. Problems are: Problem set: 7 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 557 constraints, problems are : Problem set: 7 solved, 702 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 339/339 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 709/709 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 702 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 7/14 constraints. Problems are: Problem set: 7 solved, 702 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 702 unsolved
At refinement iteration 3 (OVERLAPS) 8/339 variables, 8/22 constraints. Problems are: Problem set: 7 solved, 702 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/22 constraints. Problems are: Problem set: 7 solved, 702 unsolved
At refinement iteration 5 (OVERLAPS) 668/1007 variables, 339/361 constraints. Problems are: Problem set: 7 solved, 702 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 196/557 constraints. Problems are: Problem set: 7 solved, 702 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1007 variables, 702/1259 constraints. Problems are: Problem set: 7 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1259 constraints, problems are : Problem set: 7 solved, 702 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 339/339 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 702/709 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60732ms problems are : Problem set: 7 solved, 702 unsolved
Search for dead transitions found 7 dead transitions in 60736ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 339/339 places, 710/717 transitions.
Applied a total of 0 rules in 13 ms. Remains 339 /339 variables (removed 0) and now considering 710/710 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:41:55] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 62261 ms. Remains : 339/339 places, 710/717 transitions.
Computed a total of 339 stabilizing places and 710 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 339 transition count 710
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
RANDOM walk for 30 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
[2025-06-01 18:41:55] [INFO ] Flow matrix only has 661 transitions (discarded 49 similar events)
// Phase 1: matrix 661 rows 339 cols
[2025-06-01 18:41:55] [INFO ] Computed 23 invariants in 5 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:41:56] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-06-01 18:41:56] [INFO ] [Real]Absence check using 15 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-01 18:41:56] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2025-06-01 18:41:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:41:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-06-01 18:41:56] [INFO ] [Nat]Absence check using 15 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-01 18:41:57] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2025-06-01 18:41:57] [INFO ] State equation strengthened by 189 read => feed constraints.
[2025-06-01 18:41:57] [INFO ] [Nat]Added 189 Read/Feed constraints in 86 ms returned sat
[2025-06-01 18:41:57] [INFO ] Computed and/alt/rep : 410/1124/409 causal constraints (skipped 244 transitions) in 43 ms.
[2025-06-01 18:41:58] [INFO ] Added : 87 causal constraints over 18 iterations in 1201 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Product exploration explored 100000 steps with 11230 reset in 288 ms.
Product exploration explored 100000 steps with 11149 reset in 305 ms.
Built C files in :
/tmp/ltsmin14489888710819742414
[2025-06-01 18:41:59] [INFO ] Computing symmetric may disable matrix : 710 transitions.
[2025-06-01 18:41:59] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:41:59] [INFO ] Computing symmetric may enable matrix : 710 transitions.
[2025-06-01 18:41:59] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:41:59] [INFO ] Computing Do-Not-Accords matrix : 710 transitions.
[2025-06-01 18:41:59] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:41:59] [INFO ] Built C files in 197ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14489888710819742414
Running compilation step : cd /tmp/ltsmin14489888710819742414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2224 ms.
Running link step : cd /tmp/ltsmin14489888710819742414;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin14489888710819742414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9054441819152266806.hoa' '--buchi-type=spotba'
LTSmin run took 9249 ms.
FORMULA NeoElection-COL-8-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-8-LTLFireability-10 finished in 82471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(p1))))))'
Support contains 16 out of 418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 418/418 places, 740/740 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 355 transition count 326
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 355 transition count 326
Applied a total of 126 rules in 11 ms. Remains 355 /418 variables (removed 63) and now considering 326/740 (removed 414) transitions.
[2025-06-01 18:42:11] [INFO ] Flow matrix only has 277 transitions (discarded 49 similar events)
// Phase 1: matrix 277 rows 355 cols
[2025-06-01 18:42:11] [INFO ] Computed 78 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:42:11] [INFO ] Implicit Places using invariants in 227 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84]
Discarding 63 places :
Implicit Place search using SMT only with invariants took 228 ms to find 63 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 292/418 places, 326/740 transitions.
Applied a total of 0 rules in 2 ms. Remains 292 /292 variables (removed 0) and now considering 326/326 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 292/418 places, 326/740 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-COL-8-LTLFireability-12
Product exploration explored 100000 steps with 4416 reset in 198 ms.
Product exploration explored 100000 steps with 4408 reset in 207 ms.
Computed a total of 292 stabilizing places and 326 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 292 transition count 326
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-8-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-8-LTLFireability-12 finished in 946 ms.
All properties solved by simple procedures.
Total runtime 123071 ms.

BK_STOP 1748803332384

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-8"
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-5832"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-8, 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 r142-tall-174876811900092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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