About the Execution of ITS-Tools for NeoElection-COL-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14425.403 | 3600000.00 | 14018879.00 | 533.10 | TFTTFFFF?FFFFFFT | 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.r246-tall-171654351700468.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 itstools
Input is NeoElection-COL-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351700468
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.8K Apr 11 18:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 18:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 18:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 18:34 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.3K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Apr 11 19:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 11 19:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 19:29 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 89K 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-5-LTLFireability-00
FORMULA_NAME NeoElection-COL-5-LTLFireability-01
FORMULA_NAME NeoElection-COL-5-LTLFireability-02
FORMULA_NAME NeoElection-COL-5-LTLFireability-03
FORMULA_NAME NeoElection-COL-5-LTLFireability-04
FORMULA_NAME NeoElection-COL-5-LTLFireability-05
FORMULA_NAME NeoElection-COL-5-LTLFireability-06
FORMULA_NAME NeoElection-COL-5-LTLFireability-07
FORMULA_NAME NeoElection-COL-5-LTLFireability-08
FORMULA_NAME NeoElection-COL-5-LTLFireability-09
FORMULA_NAME NeoElection-COL-5-LTLFireability-10
FORMULA_NAME NeoElection-COL-5-LTLFireability-11
FORMULA_NAME NeoElection-COL-5-LTLFireability-12
FORMULA_NAME NeoElection-COL-5-LTLFireability-13
FORMULA_NAME NeoElection-COL-5-LTLFireability-14
FORMULA_NAME NeoElection-COL-5-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716680774095
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-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-25 23:46:15] [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]
[2024-05-25 23:46:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:46:15] [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 23:46:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 23:46:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 626 ms
[2024-05-25 23:46:16] [INFO ] Detected 6 constant HL places corresponding to 1500 PT places.
[2024-05-25 23:46:16] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 3090 PT places and 7716.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 23:46:16] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2024-05-25 23:46:16] [INFO ] Skeletonized 11 HLPN properties in 1 ms. Removed 5 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-COL-5-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Remains 6 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-5-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 76 steps (1 resets) in 6 ms. (10 steps per ms) remains 0/2 properties
[2024-05-25 23:46:16] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-25 23:46:16] [INFO ] Flatten gal took : 12 ms
FORMULA NeoElection-COL-5-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 23:46:16] [INFO ] Flatten gal took : 1 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(6), POS(5), M(6)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 5)]] 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 23:46:16] [INFO ] Unfolded HLPN to a Petri net with 3090 places and 4024 transitions 22762 arcs in 118 ms.
[2024-05-25 23:46:16] [INFO ] Unfolded 12 HLPN properties in 2 ms.
Deduced a syphon composed of 2866 places in 36 ms
Reduce places removed 2891 places and 3788 transitions.
Reduce places removed 6 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-COL-5-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 236/236 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 173 transition count 236
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 34 place count 159 transition count 177
Iterating global reduction 1 with 14 rules applied. Total rules applied 48 place count 159 transition count 177
Applied a total of 48 rules in 43 ms. Remains 159 /193 variables (removed 34) and now considering 177/236 (removed 59) transitions.
[2024-05-25 23:46:16] [INFO ] Flow matrix only has 161 transitions (discarded 16 similar events)
// Phase 1: matrix 161 rows 159 cols
[2024-05-25 23:46:16] [INFO ] Computed 34 invariants in 30 ms
[2024-05-25 23:46:16] [INFO ] Implicit Places using invariants in 353 ms returned [13, 14, 15, 16, 17, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 391 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/193 places, 177/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 446 ms. Remains : 138/193 places, 177/236 transitions.
Support contains 51 out of 138 places after structural reductions.
[2024-05-25 23:46:17] [INFO ] Flatten gal took : 29 ms
[2024-05-25 23:46:17] [INFO ] Flatten gal took : 22 ms
[2024-05-25 23:46:17] [INFO ] Input system was already deterministic with 177 transitions.
RANDOM walk for 356 steps (0 resets) in 55 ms. (6 steps per ms) remains 0/2 properties
Computed a total of 138 stabilizing places and 177 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 138 transition count 177
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 30 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 177/177 transitions.
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 132 transition count 171
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 132 transition count 166
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 127 transition count 166
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 124 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 123 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 122 transition count 162
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 20 place count 122 transition count 158
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 28 place count 118 transition count 158
Applied a total of 28 rules in 78 ms. Remains 118 /138 variables (removed 20) and now considering 158/177 (removed 19) transitions.
[2024-05-25 23:46:17] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2024-05-25 23:46:17] [INFO ] Computed 12 invariants in 4 ms
[2024-05-25 23:46:17] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-25 23:46:17] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2024-05-25 23:46:17] [INFO ] Invariant cache hit.
[2024-05-25 23:46:17] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-25 23:46:17] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-05-25 23:46:17] [INFO ] Redundant transitions in 4 ms returned []
Running 154 sub problems to find dead transitions.
[2024-05-25 23:46:17] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2024-05-25 23:46:17] [INFO ] Invariant cache hit.
[2024-05-25 23:46:17] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 4/118 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 5 (OVERLAPS) 142/260 variables, 118/130 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 13/143 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/143 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/260 variables, 0/143 constraints. Problems are: Problem set: 4 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 143 constraints, problems are : Problem set: 4 solved, 150 unsolved in 3559 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/8 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 4/118 variables, 4/12 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 142/260 variables, 118/130 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 13/143 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 150/293 constraints. Problems are: Problem set: 4 solved, 150 unsolved
[2024-05-25 23:46:23] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 5 ms to minimize.
[2024-05-25 23:46:23] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-25 23:46:23] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-25 23:46:24] [INFO ] Deduced a trap composed of 6 places in 254 ms of which 1 ms to minimize.
[2024-05-25 23:46:24] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-25 23:46:24] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-25 23:46:24] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-25 23:46:24] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-25 23:46:24] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-25 23:46:24] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-25 23:46:24] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-25 23:46:24] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-25 23:46:24] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-25 23:46:24] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-25 23:46:24] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 15/308 constraints. Problems are: Problem set: 4 solved, 150 unsolved
[2024-05-25 23:46:26] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 1/309 constraints. Problems are: Problem set: 4 solved, 150 unsolved
[2024-05-25 23:46:27] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-25 23:46:27] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-25 23:46:27] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-25 23:46:27] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-25 23:46:27] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-25 23:46:27] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-25 23:46:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-25 23:46:28] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 8/317 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/317 constraints. Problems are: Problem set: 4 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/260 variables, 0/317 constraints. Problems are: Problem set: 4 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 317 constraints, problems are : Problem set: 4 solved, 150 unsolved in 10646 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 150/154 constraints, Known Traps: 24/24 constraints]
After SMT, in 14344ms problems are : Problem set: 4 solved, 150 unsolved
Search for dead transitions found 4 dead transitions in 14353ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 118/138 places, 154/177 transitions.
Applied a total of 0 rules in 13 ms. Remains 118 /118 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2024-05-25 23:46:32] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 14860 ms. Remains : 118/138 places, 154/177 transitions.
Stuttering acceptance computed with spot in 397 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-08
Product exploration explored 100000 steps with 2752 reset in 641 ms.
Product exploration explored 100000 steps with 2795 reset in 574 ms.
Computed a total of 118 stabilizing places and 154 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 154
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 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 32 ms :[(NOT p0)]
RANDOM walk for 141 steps (0 resets) in 16 ms. (8 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 99 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-25 23:46:34] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
// Phase 1: matrix 138 rows 118 cols
[2024-05-25 23:46:34] [INFO ] Computed 13 invariants in 3 ms
[2024-05-25 23:46:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 23:46:34] [INFO ] [Real]Absence check using 8 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-25 23:46:34] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-25 23:46:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:46:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 23:46:34] [INFO ] [Nat]Absence check using 8 positive and 5 generalized place invariants in 7 ms returned sat
[2024-05-25 23:46:34] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-25 23:46:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-25 23:46:34] [INFO ] [Nat]Added 9 Read/Feed constraints in 7 ms returned sat
[2024-05-25 23:46:34] [INFO ] Computed and/alt/rep : 146/434/130 causal constraints (skipped 4 transitions) in 11 ms.
[2024-05-25 23:46:34] [INFO ] Added : 66 causal constraints over 14 iterations in 186 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 30 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 154/154 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2024-05-25 23:46:34] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-05-25 23:46:34] [INFO ] Invariant cache hit.
[2024-05-25 23:46:35] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-25 23:46:35] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-05-25 23:46:35] [INFO ] Invariant cache hit.
[2024-05-25 23:46:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-25 23:46:35] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-25 23:46:35] [INFO ] Redundant transitions in 13 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-25 23:46:35] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-05-25 23:46:35] [INFO ] Invariant cache hit.
[2024-05-25 23:46:35] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 4/118 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 138/256 variables, 118/131 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-25 23:46:37] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-25 23:46:37] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-25 23:46:37] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-25 23:46:37] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-25 23:46:37] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-25 23:46:37] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-25 23:46:37] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:46:37] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-25 23:46:38] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-25 23:46:38] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-25 23:46:38] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
[2024-05-25 23:46:38] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-25 23:46:38] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/256 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 153 constraints, problems are : Problem set: 0 solved, 150 unsolved in 5342 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 118/118 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 4/118 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 138/256 variables, 118/144 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 9/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 150/303 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-25 23:46:42] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-25 23:46:42] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-25 23:46:44] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2024-05-25 23:46:44] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-25 23:46:45] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-25 23:46:48] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/256 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/256 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 17 (OVERLAPS) 0/256 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 309 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12636 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 118/118 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 19/19 constraints]
After SMT, in 18053ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 18057ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18257 ms. Remains : 118/118 places, 154/154 transitions.
Computed a total of 118 stabilizing places and 154 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 154
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 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 34 ms :[(NOT p0)]
RANDOM walk for 143 steps (0 resets) in 13 ms. (10 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 103 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-05-25 23:46:53] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-05-25 23:46:53] [INFO ] Invariant cache hit.
[2024-05-25 23:46:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 23:46:53] [INFO ] [Real]Absence check using 8 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-25 23:46:53] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-25 23:46:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:46:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 23:46:54] [INFO ] [Nat]Absence check using 8 positive and 5 generalized place invariants in 6 ms returned sat
[2024-05-25 23:46:54] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-25 23:46:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-25 23:46:54] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2024-05-25 23:46:54] [INFO ] Computed and/alt/rep : 146/434/130 causal constraints (skipped 4 transitions) in 9 ms.
[2024-05-25 23:46:54] [INFO ] Added : 56 causal constraints over 12 iterations in 140 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2769 reset in 536 ms.
Product exploration explored 100000 steps with 2778 reset in 549 ms.
Built C files in :
/tmp/ltsmin8294914955198342471
[2024-05-25 23:46:55] [INFO ] Computing symmetric may disable matrix : 154 transitions.
[2024-05-25 23:46:55] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:46:55] [INFO ] Computing symmetric may enable matrix : 154 transitions.
[2024-05-25 23:46:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:46:55] [INFO ] Computing Do-Not-Accords matrix : 154 transitions.
[2024-05-25 23:46:55] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:46:55] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8294914955198342471
Running compilation step : cd /tmp/ltsmin8294914955198342471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 519 ms.
Running link step : cd /tmp/ltsmin8294914955198342471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin8294914955198342471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3468280032721586124.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 154/154 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2024-05-25 23:47:10] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-05-25 23:47:10] [INFO ] Invariant cache hit.
[2024-05-25 23:47:10] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-25 23:47:10] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-05-25 23:47:10] [INFO ] Invariant cache hit.
[2024-05-25 23:47:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-25 23:47:10] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-25 23:47:10] [INFO ] Redundant transitions in 1 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-25 23:47:10] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-05-25 23:47:10] [INFO ] Invariant cache hit.
[2024-05-25 23:47:10] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 4/118 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 138/256 variables, 118/131 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-25 23:47:13] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-25 23:47:13] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-25 23:47:13] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-25 23:47:13] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:47:13] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-25 23:47:13] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-25 23:47:13] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-25 23:47:13] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-25 23:47:13] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2024-05-25 23:47:13] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-25 23:47:13] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-25 23:47:13] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-25 23:47:14] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/256 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 153 constraints, problems are : Problem set: 0 solved, 150 unsolved in 5380 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 118/118 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 4/118 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 138/256 variables, 118/144 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 9/153 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 150/303 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-25 23:47:18] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-25 23:47:18] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-25 23:47:24] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/256 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/256 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 17 (OVERLAPS) 0/256 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 309 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12860 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 118/118 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 19/19 constraints]
After SMT, in 18315ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 18317ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18496 ms. Remains : 118/118 places, 154/154 transitions.
Built C files in :
/tmp/ltsmin16580836927338905559
[2024-05-25 23:47:29] [INFO ] Computing symmetric may disable matrix : 154 transitions.
[2024-05-25 23:47:29] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:47:29] [INFO ] Computing symmetric may enable matrix : 154 transitions.
[2024-05-25 23:47:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:47:29] [INFO ] Computing Do-Not-Accords matrix : 154 transitions.
[2024-05-25 23:47:29] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:47:29] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16580836927338905559
Running compilation step : cd /tmp/ltsmin16580836927338905559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 390 ms.
Running link step : cd /tmp/ltsmin16580836927338905559;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16580836927338905559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13280726452047047063.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 23:47:44] [INFO ] Flatten gal took : 14 ms
[2024-05-25 23:47:44] [INFO ] Flatten gal took : 12 ms
[2024-05-25 23:47:44] [INFO ] Time to serialize gal into /tmp/LTL4515819763040581444.gal : 4 ms
[2024-05-25 23:47:44] [INFO ] Time to serialize properties into /tmp/LTL184364295077715165.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4515819763040581444.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7394828252095514522.hoa' '-atoms' '/tmp/LTL184364295077715165.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL184364295077715165.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7394828252095514522.hoa
Detected timeout of ITS tools.
[2024-05-25 23:47:59] [INFO ] Flatten gal took : 12 ms
[2024-05-25 23:47:59] [INFO ] Flatten gal took : 12 ms
[2024-05-25 23:47:59] [INFO ] Time to serialize gal into /tmp/LTL5415112517910458768.gal : 11 ms
[2024-05-25 23:47:59] [INFO ] Time to serialize properties into /tmp/LTL9744777425007598077.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5415112517910458768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9744777425007598077.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((P_negotiation_82>=1)&&(P_network_990>=1))&&(P_poll__handlingMessage_4>=1))||(((P_negotiation_103>=1)&&(P_network_1170>=...3291
Formula 0 simplified : G!"(((((((((P_negotiation_82>=1)&&(P_network_990>=1))&&(P_poll__handlingMessage_4>=1))||(((P_negotiation_103>=1)&&(P_network_1170>=1...3287
Detected timeout of ITS tools.
[2024-05-25 23:48:14] [INFO ] Flatten gal took : 12 ms
[2024-05-25 23:48:14] [INFO ] Applying decomposition
[2024-05-25 23:48:14] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8885871075557450622.txt' '-o' '/tmp/graph8885871075557450622.bin' '-w' '/tmp/graph8885871075557450622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8885871075557450622.bin' '-l' '-1' '-v' '-w' '/tmp/graph8885871075557450622.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:48:14] [INFO ] Decomposing Gal with order
[2024-05-25 23:48:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:48:14] [INFO ] Removed a total of 25 redundant transitions.
[2024-05-25 23:48:14] [INFO ] Flatten gal took : 31 ms
[2024-05-25 23:48:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 4 ms.
[2024-05-25 23:48:14] [INFO ] Time to serialize gal into /tmp/LTL16387002368751317673.gal : 4 ms
[2024-05-25 23:48:14] [INFO ] Time to serialize properties into /tmp/LTL6949725293988185080.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16387002368751317673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6949725293988185080.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((u7.P_negotiation_82>=1)&&(u7.P_network_990>=1))&&(u7.P_poll__handlingMessage_4>=1))||(((u8.P_negotiation_103>=1)&&(u8.P...3723
Formula 0 simplified : G!"(((((((((u7.P_negotiation_82>=1)&&(u7.P_network_990>=1))&&(u7.P_poll__handlingMessage_4>=1))||(((u8.P_negotiation_103>=1)&&(u8.P_...3719
Detected timeout of ITS tools.
Treatment of property NeoElection-COL-5-LTLFireability-08 finished in 132496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 25 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 177/177 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 120 transition count 123
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 120 transition count 123
Applied a total of 36 rules in 5 ms. Remains 120 /138 variables (removed 18) and now considering 123/177 (removed 54) transitions.
[2024-05-25 23:48:29] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 120 cols
[2024-05-25 23:48:29] [INFO ] Computed 13 invariants in 3 ms
[2024-05-25 23:48:29] [INFO ] Implicit Places using invariants in 69 ms returned [13, 14, 15, 16]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 70 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/138 places, 123/177 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 116/138 places, 123/177 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-10
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-5-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-5-LTLFireability-10 finished in 170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-05-25 23:48:30] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11283325630052255551
[2024-05-25 23:48:30] [INFO ] Computing symmetric may disable matrix : 177 transitions.
[2024-05-25 23:48:30] [INFO ] Applying decomposition
[2024-05-25 23:48:30] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:48:30] [INFO ] Computing symmetric may enable matrix : 177 transitions.
[2024-05-25 23:48:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:48:30] [INFO ] Flatten gal took : 12 ms
[2024-05-25 23:48:30] [INFO ] Computing Do-Not-Accords matrix : 177 transitions.
[2024-05-25 23:48:30] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 23:48:30] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11283325630052255551
Running compilation step : cd /tmp/ltsmin11283325630052255551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5800087145390117932.txt' '-o' '/tmp/graph5800087145390117932.bin' '-w' '/tmp/graph5800087145390117932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5800087145390117932.bin' '-l' '-1' '-v' '-w' '/tmp/graph5800087145390117932.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:48:30] [INFO ] Decomposing Gal with order
[2024-05-25 23:48:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:48:30] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-25 23:48:30] [INFO ] Flatten gal took : 21 ms
[2024-05-25 23:48:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 3 ms.
[2024-05-25 23:48:30] [INFO ] Time to serialize gal into /tmp/LTLFireability5639712824888521943.gal : 3 ms
[2024-05-25 23:48:30] [INFO ] Time to serialize properties into /tmp/LTLFireability2908453730282944714.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5639712824888521943.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2908453730282944714.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((u9.P_negotiation_82>=1)&&(u9.P_network_990>=1))&&(u9.P_poll__handlingMessage_4>=1))||(((i3.u6.P_negotiation_103>=1)&&(i...3903
Formula 0 simplified : G!"(((((((((u9.P_negotiation_82>=1)&&(u9.P_network_990>=1))&&(u9.P_poll__handlingMessage_4>=1))||(((i3.u6.P_negotiation_103>=1)&&(i3...3899
Compilation finished in 472 ms.
Running link step : cd /tmp/ltsmin11283325630052255551;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11283325630052255551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-26 00:09:15] [INFO ] Applying decomposition
[2024-05-26 00:09:15] [INFO ] Flatten gal took : 35 ms
[2024-05-26 00:09:15] [INFO ] Decomposing Gal with order
[2024-05-26 00:09:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 00:09:15] [INFO ] Removed a total of 330 redundant transitions.
[2024-05-26 00:09:15] [INFO ] Flatten gal took : 80 ms
[2024-05-26 00:09:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-26 00:09:15] [INFO ] Time to serialize gal into /tmp/LTLFireability13109775499638826393.gal : 3 ms
[2024-05-26 00:09:15] [INFO ] Time to serialize properties into /tmp/LTLFireability17249022464179930192.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13109775499638826393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17249022464179930192.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((MMNEGSTEP82.P_negotiation_82>=1)&&(MMMTM990.P_network_990>=1))&&(M4.P_poll__handlingMessage_4>=1))||(((MMNEGSTEP103.P_n...4275
Formula 0 simplified : G!"(((((((((MMNEGSTEP82.P_negotiation_82>=1)&&(MMMTM990.P_network_990>=1))&&(M4.P_poll__handlingMessage_4>=1))||(((MMNEGSTEP103.P_ne...4271
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24...531
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-26 00:30:00] [INFO ] Flatten gal took : 9 ms
[2024-05-26 00:30:00] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-26 00:30:00] [INFO ] Transformed 138 places.
[2024-05-26 00:30:00] [INFO ] Transformed 177 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 00:30:01] [INFO ] Time to serialize gal into /tmp/LTLFireability13205882667992298670.gal : 1 ms
[2024-05-26 00:30:01] [INFO ] Time to serialize properties into /tmp/LTLFireability10504918170752935995.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13205882667992298670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10504918170752935995.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F("(((((((((P_negotiation_82>=1)&&(P_network_990>=1))&&(P_poll__handlingMessage_4>=1))||(((P_negotiation_103>=1)&&(P_network_1170>=...3291
Formula 0 simplified : G!"(((((((((P_negotiation_82>=1)&&(P_network_990>=1))&&(P_poll__handlingMessage_4>=1))||(((P_negotiation_103>=1)&&(P_network_1170>=1...3287
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.139: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.142: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.146: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.145: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.147: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.160: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.169: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.169: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.177: Initializing POR dependencies: labels 178, guards 177
pins2lts-mc-linux64( 2/ 8), 0.298: LTL layer: formula: <>((LTLAPp0==true))
pins2lts-mc-linux64( 2/ 8), 0.298: "<>((LTLAPp0==true))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.298: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.379: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.384: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.401: There are 180 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.401: State length is 139, there are 178 groups
pins2lts-mc-linux64( 0/ 8), 0.401: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.401: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.401: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.401: Visible groups: 0 / 178, labels: 1 / 180
pins2lts-mc-linux64( 0/ 8), 0.401: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.401: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.456: [Blue] ~102 levels ~960 states ~2680 transitions
pins2lts-mc-linux64( 7/ 8), 0.482: [Blue] ~123 levels ~1920 states ~3896 transitions
pins2lts-mc-linux64( 7/ 8), 0.535: [Blue] ~123 levels ~3840 states ~5752 transitions
pins2lts-mc-linux64( 1/ 8), 0.647: [Blue] ~138 levels ~7680 states ~10328 transitions
pins2lts-mc-linux64( 4/ 8), 0.875: [Blue] ~135 levels ~15360 states ~20528 transitions
pins2lts-mc-linux64( 2/ 8), 1.269: [Blue] ~193 levels ~30720 states ~40432 transitions
pins2lts-mc-linux64( 2/ 8), 2.071: [Blue] ~201 levels ~61440 states ~76984 transitions
pins2lts-mc-linux64( 2/ 8), 3.591: [Blue] ~201 levels ~122880 states ~152904 transitions
pins2lts-mc-linux64( 2/ 8), 6.377: [Blue] ~201 levels ~245760 states ~313096 transitions
pins2lts-mc-linux64( 2/ 8), 11.484: [Blue] ~201 levels ~491520 states ~646040 transitions
pins2lts-mc-linux64( 2/ 8), 20.822: [Blue] ~201 levels ~983040 states ~1285056 transitions
pins2lts-mc-linux64( 2/ 8), 41.938: [Blue] ~201 levels ~1966080 states ~2657984 transitions
pins2lts-mc-linux64( 5/ 8), 82.620: [Blue] ~189 levels ~3932160 states ~5205752 transitions
pins2lts-mc-linux64( 5/ 8), 163.945: [Blue] ~189 levels ~7864320 states ~10611688 transitions
pins2lts-mc-linux64( 5/ 8), 324.562: [Blue] ~189 levels ~15728640 states ~21761560 transitions
pins2lts-mc-linux64( 5/ 8), 636.797: [Blue] ~189 levels ~31457280 states ~44092288 transitions
pins2lts-mc-linux64( 5/ 8), 1341.899: [Blue] ~189 levels ~62914560 states ~91364936 transitions
pins2lts-mc-linux64( 5/ 8), 3037.596: [Blue] ~195 levels ~125829120 states ~183026368 transitions
pins2lts-mc-linux64( 7/ 8), 3436.094: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 3436.147:
pins2lts-mc-linux64( 0/ 8), 3436.147: Explored 134214451 states 198977827 transitions, fanout: 1.483
pins2lts-mc-linux64( 0/ 8), 3436.147: Total exploration time 3435.730 sec (3435.680 sec minimum, 3435.701 sec on average)
pins2lts-mc-linux64( 0/ 8), 3436.147: States per second: 39064, Transitions per second: 57914
pins2lts-mc-linux64( 0/ 8), 3436.147:
pins2lts-mc-linux64( 0/ 8), 3436.147: State space has 134217427 states, 134213269 are accepting
pins2lts-mc-linux64( 0/ 8), 3436.147: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 3436.147: blue states: 134214451 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 3436.147: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 3436.147: all-red states: 134213269 (100.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 3436.147:
pins2lts-mc-linux64( 0/ 8), 3436.147: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 3436.147:
pins2lts-mc-linux64( 0/ 8), 3436.147: Queue width: 8B, total height: 1470, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 3436.147: Tree memory: 1103.6MB, 8.6 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 3436.147: Tree fill ratio (roots/leafs): 99.0%/31.0%
pins2lts-mc-linux64( 0/ 8), 3436.147: Stored 177 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 3436.147: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 3436.147: Est. total memory use: 1103.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11283325630052255551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11283325630052255551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-5"
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-5568"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-5, 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 r246-tall-171654351700468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-5.tgz
mv NeoElection-COL-5 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;