fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r150-smll-165276998300028
Last Updated
Jun 22, 2022

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
13831.260 3600000.00 5891364.00 10624.50 FFT?FTFFTF?FTFF? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 7.7K Apr 30 04:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 30 04:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 30 04:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 04:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K May 9 08:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 89K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeoElection-COL-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 1652911812302

Running Version 202205111006
[2022-05-18 22:10:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 22:10:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 22:10: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.
[2022-05-18 22:10:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 22:10:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1557 ms
[2022-05-18 22:10:16] [INFO ] Detected 6 constant HL places corresponding to 1500 PT places.
[2022-05-18 22:10:16] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 3090 PT places and 7716.0 transition bindings in 57 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2022-05-18 22:10:16] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 13 ms.
[2022-05-18 22:10:16] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA NeoElection-COL-5-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-14 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.4 ms
Remains 10 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-5-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Incomplete random walk after 10000 steps, including 275 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 6 cols
[2022-05-18 22:10:17] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-18 22:10:17] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2022-05-18 22:10:17] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-18 22:10:17] [INFO ] Flatten gal took : 54 ms
FORMULA NeoElection-COL-5-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 22:10:17] [INFO ] Flatten gal took : 5 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Domain [M(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.
[2022-05-18 22:10:17] [INFO ] Unfolded HLPN to a Petri net with 3090 places and 4024 transitions 22762 arcs in 261 ms.
[2022-05-18 22:10:17] [INFO ] Unfolded 9 HLPN properties in 3 ms.
Deduced a syphon composed of 2866 places in 28 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-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 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 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 164 transition count 182
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 164 transition count 182
Applied a total of 38 rules in 37 ms. Remains 164 /193 variables (removed 29) and now considering 182/236 (removed 54) transitions.
[2022-05-18 22:10:18] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 164 cols
[2022-05-18 22:10:18] [INFO ] Computed 34 place invariants in 27 ms
[2022-05-18 22:10:18] [INFO ] Implicit Places using invariants in 304 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 311 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/193 places, 182/236 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 143/193 places, 182/236 transitions.
Support contains 71 out of 143 places after structural reductions.
[2022-05-18 22:10:18] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-18 22:10:18] [INFO ] Flatten gal took : 49 ms
FORMULA NeoElection-COL-5-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 22:10:18] [INFO ] Flatten gal took : 31 ms
[2022-05-18 22:10:18] [INFO ] Input system was already deterministic with 182 transitions.
Support contains 66 out of 143 places (down from 71) after GAL structural reductions.
Finished random walk after 107 steps, including 0 resets, run visited all 7 properties in 10 ms. (steps per millisecond=10 )
FORMULA NeoElection-COL-5-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 143 stabilizing places and 182 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 143 transition count 182
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(F(X(p0)))))))'
Support contains 30 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 182/182 transitions.
Reduce places removed 5 places and 5 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 138 transition count 172
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 133 transition count 172
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 128 transition count 167
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 128 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 20 place count 128 transition count 166
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 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 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 124 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 123 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 122 transition count 162
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 30 place count 122 transition count 158
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 118 transition count 158
Applied a total of 38 rules in 53 ms. Remains 118 /143 variables (removed 25) and now considering 158/182 (removed 24) transitions.
[2022-05-18 22:10:18] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2022-05-18 22:10:18] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-18 22:10:19] [INFO ] Implicit Places using invariants in 140 ms returned []
[2022-05-18 22:10:19] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2022-05-18 22:10:19] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-18 22:10:19] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-18 22:10:19] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2022-05-18 22:10:19] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-18 22:10:19] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2022-05-18 22:10:19] [INFO ] Computed 12 place invariants in 12 ms
[2022-05-18 22:10:19] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/143 places, 158/182 transitions.
Finished structural reductions, in 1 iterations. Remains : 118/143 places, 158/182 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s18 1) (GEQ s74 1) (GEQ s96 1)) (AND (GEQ s23 1) (GEQ s85 1) (GEQ s97 1)) (AND (GEQ s20 1) (GEQ s89 1) (GEQ s97 1)) (AND (GEQ s22 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2756 reset in 1100 ms.
Product exploration explored 100000 steps with 2780 reset in 834 ms.
Computed a total of 118 stabilizing places and 158 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 158
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 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
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 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
[2022-05-18 22:10:22] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2022-05-18 22:10:22] [INFO ] Computed 12 place invariants in 7 ms
[2022-05-18 22:10:23] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-05-18 22:10:23] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 6 ms returned sat
[2022-05-18 22:10:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 22:10:23] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2022-05-18 22:10:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 22:10:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-18 22:10:23] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 4 ms returned sat
[2022-05-18 22:10:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 22:10:23] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2022-05-18 22:10:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-18 22:10:23] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2022-05-18 22:10:24] [INFO ] Computed and/alt/rep : 150/462/134 causal constraints (skipped 4 transitions) in 31 ms.
[2022-05-18 22:10:24] [INFO ] Added : 77 causal constraints over 16 iterations in 527 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, 158/158 transitions.
Applied a total of 0 rules in 22 ms. Remains 118 /118 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2022-05-18 22:10:24] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2022-05-18 22:10:24] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-18 22:10:24] [INFO ] Implicit Places using invariants in 124 ms returned []
[2022-05-18 22:10:24] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2022-05-18 22:10:24] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-18 22:10:24] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-18 22:10:24] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2022-05-18 22:10:24] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-18 22:10:24] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2022-05-18 22:10:24] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-18 22:10:25] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 118/118 places, 158/158 transitions.
Computed a total of 118 stabilizing places and 158 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 158
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 212 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Finished random walk after 30 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
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 240 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
[2022-05-18 22:10:26] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2022-05-18 22:10:26] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-18 22:10:26] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-18 22:10:26] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 4 ms returned sat
[2022-05-18 22:10:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 22:10:26] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-05-18 22:10:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 22:10:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-05-18 22:10:27] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 4 ms returned sat
[2022-05-18 22:10:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 22:10:27] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-05-18 22:10:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-18 22:10:27] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2022-05-18 22:10:27] [INFO ] Computed and/alt/rep : 150/462/134 causal constraints (skipped 4 transitions) in 23 ms.
[2022-05-18 22:10:27] [INFO ] Added : 77 causal constraints over 16 iterations in 413 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2792 reset in 988 ms.
Product exploration explored 100000 steps with 2753 reset in 697 ms.
Built C files in :
/tmp/ltsmin4827127126753629073
[2022-05-18 22:10:29] [INFO ] Computing symmetric may disable matrix : 158 transitions.
[2022-05-18 22:10:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:10:29] [INFO ] Computing symmetric may enable matrix : 158 transitions.
[2022-05-18 22:10:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:10:29] [INFO ] Computing Do-Not-Accords matrix : 158 transitions.
[2022-05-18 22:10:29] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:10:29] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4827127126753629073
Running compilation step : cd /tmp/ltsmin4827127126753629073;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 847 ms.
Running link step : cd /tmp/ltsmin4827127126753629073;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin4827127126753629073;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7572375341500425570.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, 158/158 transitions.
Applied a total of 0 rules in 10 ms. Remains 118 /118 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2022-05-18 22:10:44] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2022-05-18 22:10:44] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-18 22:10:44] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-18 22:10:44] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2022-05-18 22:10:44] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-18 22:10:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-18 22:10:44] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2022-05-18 22:10:44] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-18 22:10:44] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2022-05-18 22:10:44] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-18 22:10:44] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 118/118 places, 158/158 transitions.
Built C files in :
/tmp/ltsmin6782328192195926137
[2022-05-18 22:10:45] [INFO ] Computing symmetric may disable matrix : 158 transitions.
[2022-05-18 22:10:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:10:45] [INFO ] Computing symmetric may enable matrix : 158 transitions.
[2022-05-18 22:10:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:10:45] [INFO ] Computing Do-Not-Accords matrix : 158 transitions.
[2022-05-18 22:10:45] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:10:45] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6782328192195926137
Running compilation step : cd /tmp/ltsmin6782328192195926137;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 584 ms.
Running link step : cd /tmp/ltsmin6782328192195926137;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6782328192195926137;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10590520706038731600.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 22:11:00] [INFO ] Flatten gal took : 21 ms
[2022-05-18 22:11:00] [INFO ] Flatten gal took : 19 ms
[2022-05-18 22:11:00] [INFO ] Time to serialize gal into /tmp/LTL5347081246654519514.gal : 5 ms
[2022-05-18 22:11:00] [INFO ] Time to serialize properties into /tmp/LTL7956019820588799754.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5347081246654519514.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7956019820588799754.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5347081...266
Read 1 LTL properties
Checking formula 0 : !((F(G(X(G(F(X("(((((((((P_negotiation_82>=1)&&(P_network_990>=1))&&(P_poll__handlingMessage_4>=1))||(((P_negotiation_103>=1)&&(P_netw...3306
Formula 0 simplified : !FGXGFX"(((((((((P_negotiation_82>=1)&&(P_network_990>=1))&&(P_poll__handlingMessage_4>=1))||(((P_negotiation_103>=1)&&(P_network_11...3292
Detected timeout of ITS tools.
[2022-05-18 22:11:15] [INFO ] Flatten gal took : 18 ms
[2022-05-18 22:11:15] [INFO ] Applying decomposition
[2022-05-18 22:11:15] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2129436327071335184.txt' '-o' '/tmp/graph2129436327071335184.bin' '-w' '/tmp/graph2129436327071335184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2129436327071335184.bin' '-l' '-1' '-v' '-w' '/tmp/graph2129436327071335184.weights' '-q' '0' '-e' '0.001'
[2022-05-18 22:11:15] [INFO ] Decomposing Gal with order
[2022-05-18 22:11:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 22:11:15] [INFO ] Removed a total of 33 redundant transitions.
[2022-05-18 22:11:15] [INFO ] Flatten gal took : 51 ms
[2022-05-18 22:11:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 7 ms.
[2022-05-18 22:11:15] [INFO ] Time to serialize gal into /tmp/LTL13488743336135746567.gal : 4 ms
[2022-05-18 22:11:15] [INFO ] Time to serialize properties into /tmp/LTL5284719357845063025.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13488743336135746567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5284719357845063025.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1348874...246
Read 1 LTL properties
Checking formula 0 : !((F(G(X(G(F(X("(((((((((i4.u7.P_negotiation_82>=1)&&(i4.u7.P_network_990>=1))&&(i4.u7.P_poll__handlingMessage_4>=1))||(((i2.u8.P_nego...3994
Formula 0 simplified : !FGXGFX"(((((((((i4.u7.P_negotiation_82>=1)&&(i4.u7.P_network_990>=1))&&(i4.u7.P_poll__handlingMessage_4>=1))||(((i2.u8.P_negotiatio...3980
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9548032622064430966
[2022-05-18 22:11:30] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9548032622064430966
Running compilation step : cd /tmp/ltsmin9548032622064430966;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 395 ms.
Running link step : cd /tmp/ltsmin9548032622064430966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin9548032622064430966;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](X([](<>(X((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NeoElection-COL-5-LTLFireability-03 finished in 86844 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(F(p0))) U p1)))'
Support contains 35 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 182/182 transitions.
Applied a total of 0 rules in 7 ms. Remains 143 /143 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2022-05-18 22:11:45] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 143 cols
[2022-05-18 22:11:45] [INFO ] Computed 13 place invariants in 9 ms
[2022-05-18 22:11:45] [INFO ] Implicit Places using invariants in 120 ms returned []
[2022-05-18 22:11:45] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 143 cols
[2022-05-18 22:11:45] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-18 22:11:45] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-18 22:11:45] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2022-05-18 22:11:45] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 143 cols
[2022-05-18 22:11:45] [INFO ] Computed 13 place invariants in 9 ms
[2022-05-18 22:11:46] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 182/182 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p1), (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s122 1) (GEQ s137 1) (GEQ s132 1) (GEQ s142 1) (GEQ s127 1)), p0:(OR (AND (GEQ s23 1) (GEQ s82 1) (GEQ s106 1)) (AND (GEQ s28 1) (GEQ s94 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1094 reset in 1202 ms.
Product exploration explored 100000 steps with 1079 reset in 790 ms.
Computed a total of 143 stabilizing places and 182 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 143 transition count 182
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 233 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Finished random walk after 59 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 337 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
[2022-05-18 22:11:49] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 143 cols
[2022-05-18 22:11:49] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-18 22:11:49] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2022-05-18 22:11:49] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-18 22:11:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 22:11:49] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-05-18 22:11:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 22:11:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-18 22:11:50] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 4 ms returned sat
[2022-05-18 22:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 22:11:50] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2022-05-18 22:11:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-18 22:11:50] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2022-05-18 22:11:50] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 6 ms to minimize.
[2022-05-18 22:11:50] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2022-05-18 22:11:50] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 3 ms to minimize.
[2022-05-18 22:11:50] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 3 ms to minimize.
[2022-05-18 22:11:50] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2022-05-18 22:11:51] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2022-05-18 22:11:51] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
[2022-05-18 22:11:51] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2022-05-18 22:11:51] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2022-05-18 22:11:51] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-05-18 22:11:51] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2022-05-18 22:11:51] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-18 22:11:51] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2022-05-18 22:11:52] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2022-05-18 22:11:52] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2022-05-18 22:11:52] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2022-05-18 22:11:52] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2022-05-18 22:11:52] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2022-05-18 22:11:52] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2021 ms
[2022-05-18 22:11:52] [INFO ] Computed and/alt/rep : 172/514/156 causal constraints (skipped 5 transitions) in 23 ms.
[2022-05-18 22:11:52] [INFO ] Added : 32 causal constraints over 7 iterations in 218 ms. Result :sat
Could not prove EG (NOT p1)
[2022-05-18 22:11:52] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 143 cols
[2022-05-18 22:11:52] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-18 22:11:53] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-18 22:11:53] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 4 ms returned sat
[2022-05-18 22:11:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 22:11:53] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2022-05-18 22:11:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 22:11:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-18 22:11:53] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-18 22:11:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 22:11:53] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2022-05-18 22:11:53] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-18 22:11:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 9 ms returned sat
[2022-05-18 22:11:54] [INFO ] Computed and/alt/rep : 172/514/156 causal constraints (skipped 5 transitions) in 25 ms.
[2022-05-18 22:11:54] [INFO ] Added : 90 causal constraints over 18 iterations in 534 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 35 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2022-05-18 22:11:54] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 143 cols
[2022-05-18 22:11:54] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-18 22:11:54] [INFO ] Implicit Places using invariants in 164 ms returned []
[2022-05-18 22:11:54] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 143 cols
[2022-05-18 22:11:54] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-18 22:11:54] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-18 22:11:55] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2022-05-18 22:11:55] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 143 cols
[2022-05-18 22:11:55] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-18 22:11:55] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 182/182 transitions.
Computed a total of 143 stabilizing places and 182 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 143 transition count 182
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 392 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Finished random walk after 82 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 578 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
[2022-05-18 22:11:56] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 143 cols
[2022-05-18 22:11:56] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-18 22:11:57] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-18 22:11:57] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-18 22:11:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 22:11:57] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2022-05-18 22:11:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 22:11:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-18 22:11:57] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 4 ms returned sat
[2022-05-18 22:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 22:11:57] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2022-05-18 22:11:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-18 22:11:57] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2022-05-18 22:11:57] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2022-05-18 22:11:57] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2022-05-18 22:11:57] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2022-05-18 22:11:58] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2022-05-18 22:11:58] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2022-05-18 22:11:58] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2022-05-18 22:11:58] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2022-05-18 22:11:58] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2022-05-18 22:11:58] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2022-05-18 22:11:58] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2022-05-18 22:11:58] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2022-05-18 22:11:58] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2022-05-18 22:11:58] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2022-05-18 22:11:59] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2022-05-18 22:11:59] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2022-05-18 22:11:59] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2022-05-18 22:11:59] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2022-05-18 22:11:59] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2022-05-18 22:11:59] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1794 ms
[2022-05-18 22:11:59] [INFO ] Computed and/alt/rep : 172/514/156 causal constraints (skipped 5 transitions) in 23 ms.
[2022-05-18 22:11:59] [INFO ] Added : 32 causal constraints over 7 iterations in 199 ms. Result :sat
Could not prove EG (NOT p1)
[2022-05-18 22:11:59] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 143 cols
[2022-05-18 22:11:59] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-18 22:12:00] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-18 22:12:00] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-18 22:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 22:12:00] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2022-05-18 22:12:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 22:12:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-18 22:12:00] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-18 22:12:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 22:12:00] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2022-05-18 22:12:00] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-18 22:12:00] [INFO ] [Nat]Added 13 Read/Feed constraints in 11 ms returned sat
[2022-05-18 22:12:01] [INFO ] Computed and/alt/rep : 172/514/156 causal constraints (skipped 5 transitions) in 25 ms.
[2022-05-18 22:12:01] [INFO ] Added : 90 causal constraints over 18 iterations in 539 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1080 reset in 1041 ms.
Product exploration explored 100000 steps with 1081 reset in 710 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Support contains 35 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 182/182 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 143 transition count 182
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 1 place count 143 transition count 182
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 143 transition count 182
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 13 place count 143 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 142 transition count 181
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 142 transition count 181
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 15 rules in 39 ms. Remains 142 /143 variables (removed 1) and now considering 181/182 (removed 1) transitions.
[2022-05-18 22:12:03] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-18 22:12:03] [INFO ] Flow matrix only has 165 transitions (discarded 16 similar events)
// Phase 1: matrix 165 rows 142 cols
[2022-05-18 22:12:03] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-18 22:12:04] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/143 places, 181/182 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/143 places, 181/182 transitions.
Product exploration explored 100000 steps with 2065 reset in 1179 ms.
Product exploration explored 100000 steps with 2055 reset in 778 ms.
Built C files in :
/tmp/ltsmin15374105472139683285
[2022-05-18 22:12:06] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15374105472139683285
Running compilation step : cd /tmp/ltsmin15374105472139683285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 467 ms.
Running link step : cd /tmp/ltsmin15374105472139683285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin15374105472139683285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13521311773822131285.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 35 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 182/182 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2022-05-18 22:12:21] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 143 cols
[2022-05-18 22:12:21] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-18 22:12:21] [INFO ] Implicit Places using invariants in 100 ms returned []
[2022-05-18 22:12:21] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 143 cols
[2022-05-18 22:12:21] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-18 22:12:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-18 22:12:21] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2022-05-18 22:12:21] [INFO ] Flow matrix only has 166 transitions (discarded 16 similar events)
// Phase 1: matrix 166 rows 143 cols
[2022-05-18 22:12:21] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-18 22:12:21] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 182/182 transitions.
Built C files in :
/tmp/ltsmin1591791195714803640
[2022-05-18 22:12:21] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1591791195714803640
Running compilation step : cd /tmp/ltsmin1591791195714803640;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 738 ms.
Running link step : cd /tmp/ltsmin1591791195714803640;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1591791195714803640;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7750718650592877543.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 22:12:36] [INFO ] Flatten gal took : 19 ms
[2022-05-18 22:12:36] [INFO ] Flatten gal took : 18 ms
[2022-05-18 22:12:36] [INFO ] Time to serialize gal into /tmp/LTL6603224128437557881.gal : 2 ms
[2022-05-18 22:12:36] [INFO ] Time to serialize properties into /tmp/LTL16602542524886857063.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6603224128437557881.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16602542524886857063.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6603224...267
Read 1 LTL properties
Checking formula 0 : !((X((F(X(F("(((((((((P_negotiation_82>=1)&&(P_network_990>=1))&&(P_poll__handlingMessage_4>=1))||(((P_negotiation_103>=1)&&(P_network...3482
Formula 0 simplified : !X(FXF"(((((((((P_negotiation_82>=1)&&(P_network_990>=1))&&(P_poll__handlingMessage_4>=1))||(((P_negotiation_103>=1)&&(P_network_117...3472
Detected timeout of ITS tools.
[2022-05-18 22:12:51] [INFO ] Flatten gal took : 18 ms
[2022-05-18 22:12:51] [INFO ] Applying decomposition
[2022-05-18 22:12:51] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13556694445386427756.txt' '-o' '/tmp/graph13556694445386427756.bin' '-w' '/tmp/graph13556694445386427756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13556694445386427756.bin' '-l' '-1' '-v' '-w' '/tmp/graph13556694445386427756.weights' '-q' '0' '-e' '0.001'
[2022-05-18 22:12:51] [INFO ] Decomposing Gal with order
[2022-05-18 22:12:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 22:12:51] [INFO ] Removed a total of 23 redundant transitions.
[2022-05-18 22:12:51] [INFO ] Flatten gal took : 28 ms
[2022-05-18 22:12:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 4 ms.
[2022-05-18 22:12:52] [INFO ] Time to serialize gal into /tmp/LTL2105064295106420634.gal : 4 ms
[2022-05-18 22:12:52] [INFO ] Time to serialize properties into /tmp/LTL948719260680002882.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2105064295106420634.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL948719260680002882.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2105064...244
Read 1 LTL properties
Checking formula 0 : !((X((F(X(F("(((((((((u6.P_negotiation_82>=1)&&(u6.P_network_990>=1))&&(u6.P_poll__handlingMessage_4>=1))||(((i1.u7.P_negotiation_103>...4118
Formula 0 simplified : !X(FXF"(((((((((u6.P_negotiation_82>=1)&&(u6.P_network_990>=1))&&(u6.P_poll__handlingMessage_4>=1))||(((i1.u7.P_negotiation_103>=1)&...4108
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18378325497314072054
[2022-05-18 22:13:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18378325497314072054
Running compilation step : cd /tmp/ltsmin18378325497314072054;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 449 ms.
Running link step : cd /tmp/ltsmin18378325497314072054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18378325497314072054;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(X(<>((LTLAPp0==true)))) U (LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NeoElection-COL-5-LTLFireability-10 finished in 96530 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 182/182 transitions.
Reduce places removed 5 places and 5 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 138 transition count 172
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 133 transition count 172
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 28 place count 115 transition count 118
Iterating global reduction 0 with 18 rules applied. Total rules applied 46 place count 115 transition count 118
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 86 place count 95 transition count 98
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 91 place count 90 transition count 93
Applied a total of 91 rules in 23 ms. Remains 90 /143 variables (removed 53) and now considering 93/182 (removed 89) transitions.
[2022-05-18 22:13:22] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 90 cols
[2022-05-18 22:13:22] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-18 22:13:22] [INFO ] Implicit Places using invariants in 105 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 106 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/143 places, 93/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 86/143 places, 93/182 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s80 1) (GEQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-5-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-5-LTLFireability-13 finished in 186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 25 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 182/182 transitions.
Reduce places removed 5 places and 5 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 138 transition count 172
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 133 transition count 172
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 33 place count 110 transition count 113
Iterating global reduction 0 with 23 rules applied. Total rules applied 56 place count 110 transition count 113
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 86 place count 95 transition count 98
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 91 place count 90 transition count 93
Applied a total of 91 rules in 20 ms. Remains 90 /143 variables (removed 53) and now considering 93/182 (removed 89) transitions.
[2022-05-18 22:13:22] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 90 cols
[2022-05-18 22:13:22] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-18 22:13:22] [INFO ] Implicit Places using invariants in 72 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 74 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/143 places, 93/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 86/143 places, 93/182 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s14 1) (GEQ s76 1)) (AND (GEQ s41 1) (GEQ s78 1)) (AND (GEQ s48 1) (GEQ s78 1)) (AND (GEQ s75 1) (GEQ s80 1)) (AND (GEQ s65 1) (GEQ s80 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5299 reset in 836 ms.
Product exploration explored 100000 steps with 5262 reset in 748 ms.
Computed a total of 86 stabilizing places and 93 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 93
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 226 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 60 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 22:13:24] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2022-05-18 22:13:24] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 22:13:24] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 430 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2022-05-18 22:13:25] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2022-05-18 22:13:25] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 22:13:25] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-18 22:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 22:13:25] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2022-05-18 22:13:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 22:13:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-18 22:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 22:13:25] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-18 22:13:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-18 22:13:25] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2022-05-18 22:13:25] [INFO ] Computed and/alt/rep : 88/178/72 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-18 22:13:25] [INFO ] Added : 34 causal constraints over 7 iterations in 120 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 25 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 93/93 transitions.
Applied a total of 0 rules in 10 ms. Remains 86 /86 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2022-05-18 22:13:25] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2022-05-18 22:13:25] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-18 22:13:25] [INFO ] Implicit Places using invariants in 93 ms returned []
[2022-05-18 22:13:25] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2022-05-18 22:13:25] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 22:13:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-18 22:13:26] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2022-05-18 22:13:26] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-18 22:13:26] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2022-05-18 22:13:26] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-18 22:13:26] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 93/93 transitions.
Computed a total of 86 stabilizing places and 93 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 93
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 195 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
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 216 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2022-05-18 22:13:26] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2022-05-18 22:13:26] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-18 22:13:27] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-18 22:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 22:13:27] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2022-05-18 22:13:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 22:13:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-18 22:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 22:13:27] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2022-05-18 22:13:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-18 22:13:27] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2022-05-18 22:13:27] [INFO ] Computed and/alt/rep : 88/178/72 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-18 22:13:27] [INFO ] Added : 34 causal constraints over 7 iterations in 115 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 86 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5243 reset in 752 ms.
Product exploration explored 100000 steps with 5267 reset in 521 ms.
Built C files in :
/tmp/ltsmin2930947655600038904
[2022-05-18 22:13:28] [INFO ] Computing symmetric may disable matrix : 93 transitions.
[2022-05-18 22:13:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:13:28] [INFO ] Computing symmetric may enable matrix : 93 transitions.
[2022-05-18 22:13:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:13:28] [INFO ] Computing Do-Not-Accords matrix : 93 transitions.
[2022-05-18 22:13:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:13:28] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2930947655600038904
Running compilation step : cd /tmp/ltsmin2930947655600038904;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 341 ms.
Running link step : cd /tmp/ltsmin2930947655600038904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2930947655600038904;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8727320352764300040.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 25 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 93/93 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2022-05-18 22:13:44] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2022-05-18 22:13:44] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-18 22:13:44] [INFO ] Implicit Places using invariants in 71 ms returned []
[2022-05-18 22:13:44] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2022-05-18 22:13:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 22:13:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-18 22:13:44] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-05-18 22:13:44] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-18 22:13:44] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2022-05-18 22:13:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-18 22:13:44] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 93/93 transitions.
Built C files in :
/tmp/ltsmin9648855078203417720
[2022-05-18 22:13:44] [INFO ] Computing symmetric may disable matrix : 93 transitions.
[2022-05-18 22:13:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:13:44] [INFO ] Computing symmetric may enable matrix : 93 transitions.
[2022-05-18 22:13:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:13:44] [INFO ] Computing Do-Not-Accords matrix : 93 transitions.
[2022-05-18 22:13:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:13:44] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9648855078203417720
Running compilation step : cd /tmp/ltsmin9648855078203417720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 283 ms.
Running link step : cd /tmp/ltsmin9648855078203417720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin9648855078203417720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6508081850986466710.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 22:13:59] [INFO ] Flatten gal took : 8 ms
[2022-05-18 22:13:59] [INFO ] Flatten gal took : 8 ms
[2022-05-18 22:13:59] [INFO ] Time to serialize gal into /tmp/LTL6742088516457620152.gal : 2 ms
[2022-05-18 22:13:59] [INFO ] Time to serialize properties into /tmp/LTL9785253499078706152.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6742088516457620152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9785253499078706152.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6742088...266
Read 1 LTL properties
Checking formula 0 : !((F((((((G("(((((((P_network_336>=1)&&(P_poll__handlingMessage_1>=1))||((P_network_732>=1)&&(P_poll__handlingMessage_3>=1)))||(((P_ne...2300
Formula 0 simplified : !F("(((((P_network_480>=1)&&(P_poll__handlingMessage_2>=1))||((P_network_408>=1)&&(P_poll__handlingMessage_1>=1)))||(((P_network_588...2281
Detected timeout of ITS tools.
[2022-05-18 22:14:14] [INFO ] Flatten gal took : 8 ms
[2022-05-18 22:14:14] [INFO ] Applying decomposition
[2022-05-18 22:14:14] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15784379136062892176.txt' '-o' '/tmp/graph15784379136062892176.bin' '-w' '/tmp/graph15784379136062892176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15784379136062892176.bin' '-l' '-1' '-v' '-w' '/tmp/graph15784379136062892176.weights' '-q' '0' '-e' '0.001'
[2022-05-18 22:14:14] [INFO ] Decomposing Gal with order
[2022-05-18 22:14:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 22:14:14] [INFO ] Removed a total of 22 redundant transitions.
[2022-05-18 22:14:14] [INFO ] Flatten gal took : 14 ms
[2022-05-18 22:14:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 1 ms.
[2022-05-18 22:14:14] [INFO ] Time to serialize gal into /tmp/LTL5179314814002133167.gal : 2 ms
[2022-05-18 22:14:14] [INFO ] Time to serialize properties into /tmp/LTL4246922175658781852.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5179314814002133167.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4246922175658781852.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5179314...245
Read 1 LTL properties
Checking formula 0 : !((F((((((G("(((((((u0.P_network_336>=1)&&(u0.P_poll__handlingMessage_1>=1))||((u3.P_network_732>=1)&&(u1.P_poll__handlingMessage_3>=1...2540
Formula 0 simplified : !F("(((((u0.P_network_480>=1)&&(u3.P_poll__handlingMessage_2>=1))||((u4.P_network_408>=1)&&(u0.P_poll__handlingMessage_1>=1)))||(((u...2521
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9766314692836210960
[2022-05-18 22:14:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9766314692836210960
Running compilation step : cd /tmp/ltsmin9766314692836210960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 256 ms.
Running link step : cd /tmp/ltsmin9766314692836210960;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin9766314692836210960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NeoElection-COL-5-LTLFireability-15 finished in 82312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(F(X(p0)))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(F(p0))) U p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
[2022-05-18 22:14:44] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin88079334924804026
[2022-05-18 22:14:44] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2022-05-18 22:14:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:14:44] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2022-05-18 22:14:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:14:45] [INFO ] Applying decomposition
[2022-05-18 22:14:45] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2022-05-18 22:14:45] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 22:14:45] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin88079334924804026
Running compilation step : cd /tmp/ltsmin88079334924804026;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 22:14:45] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2772014198355551393.txt' '-o' '/tmp/graph2772014198355551393.bin' '-w' '/tmp/graph2772014198355551393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2772014198355551393.bin' '-l' '-1' '-v' '-w' '/tmp/graph2772014198355551393.weights' '-q' '0' '-e' '0.001'
[2022-05-18 22:14:45] [INFO ] Decomposing Gal with order
[2022-05-18 22:14:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 22:14:45] [INFO ] Removed a total of 23 redundant transitions.
[2022-05-18 22:14:45] [INFO ] Flatten gal took : 50 ms
[2022-05-18 22:14:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 5 ms.
[2022-05-18 22:14:45] [INFO ] Time to serialize gal into /tmp/LTLFireability9454229368438825749.gal : 4 ms
[2022-05-18 22:14:45] [INFO ] Time to serialize properties into /tmp/LTLFireability11061428009151391152.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9454229368438825749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11061428009151391152.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((F(G(X(G(F(X("(((((((((u5.P_negotiation_82>=1)&&(u5.P_network_990>=1))&&(u5.P_poll__handlingMessage_4>=1))||(((i6.u6.P_negotiation_1...3918
Formula 0 simplified : !FGXGFX"(((((((((u5.P_negotiation_82>=1)&&(u5.P_network_990>=1))&&(u5.P_poll__handlingMessage_4>=1))||(((i6.u6.P_negotiation_103>=1)...3904
Compilation finished in 809 ms.
Running link step : cd /tmp/ltsmin88079334924804026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin88079334924804026;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](X([](<>(X((LTLAPp0==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: <>([](X([](<>(X((LTLAPp0==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: "<>([](X([](<>(X((LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.059: DFS-FIFO for weak LTL, using special progress label 187
pins2lts-mc-linux64( 0/ 8), 0.059: There are 188 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.059: State length is 144, there are 185 groups
pins2lts-mc-linux64( 0/ 8), 0.059: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.059: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.059: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.059: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.199: ~116 levels ~960 states ~5872 transitions
pins2lts-mc-linux64( 0/ 8), 0.247: ~147 levels ~1920 states ~7792 transitions
pins2lts-mc-linux64( 1/ 8), 0.284: ~183 levels ~3840 states ~11984 transitions
pins2lts-mc-linux64( 1/ 8), 0.338: ~183 levels ~7680 states ~16720 transitions
pins2lts-mc-linux64( 3/ 8), 0.457: ~156 levels ~15360 states ~26488 transitions
pins2lts-mc-linux64( 3/ 8), 0.684: ~156 levels ~30720 states ~48560 transitions
pins2lts-mc-linux64( 3/ 8), 1.053: ~156 levels ~61440 states ~95200 transitions
pins2lts-mc-linux64( 7/ 8), 1.852: ~204 levels ~122880 states ~168912 transitions
pins2lts-mc-linux64( 4/ 8), 3.025: ~189 levels ~245760 states ~370360 transitions
pins2lts-mc-linux64( 4/ 8), 4.651: ~189 levels ~491520 states ~749696 transitions
pins2lts-mc-linux64( 4/ 8), 7.421: ~189 levels ~983040 states ~1515912 transitions
pins2lts-mc-linux64( 4/ 8), 11.623: ~189 levels ~1966080 states ~3117560 transitions
pins2lts-mc-linux64( 4/ 8), 19.707: ~189 levels ~3932160 states ~6375792 transitions
pins2lts-mc-linux64( 7/ 8), 35.774: ~219 levels ~7864320 states ~12588400 transitions
pins2lts-mc-linux64( 7/ 8), 67.809: ~219 levels ~15728640 states ~25928424 transitions
pins2lts-mc-linux64( 7/ 8), 133.807: ~225 levels ~31457280 states ~55141728 transitions
pins2lts-mc-linux64( 7/ 8), 271.728: ~225 levels ~62914560 states ~119396080 transitions
pins2lts-mc-linux64( 7/ 8), 548.464: ~225 levels ~125829120 states ~245290128 transitions
pins2lts-mc-linux64( 4/ 8), 617.581: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 617.644:
pins2lts-mc-linux64( 0/ 8), 617.644: mean standard work distribution: 2.4% (states) 4.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 617.644:
pins2lts-mc-linux64( 0/ 8), 617.644: Explored 134210335 states 279629576 transitions, fanout: 2.084
pins2lts-mc-linux64( 0/ 8), 617.644: Total exploration time 617.580 sec (617.510 sec minimum, 617.538 sec on average)
pins2lts-mc-linux64( 0/ 8), 617.644: States per second: 217317, Transitions per second: 452783
pins2lts-mc-linux64( 0/ 8), 617.644:
pins2lts-mc-linux64( 0/ 8), 617.644: Progress states detected: 5
pins2lts-mc-linux64( 0/ 8), 617.644: Redundant explorations: -0.0052
pins2lts-mc-linux64( 0/ 8), 617.644:
pins2lts-mc-linux64( 0/ 8), 617.644: Queue width: 8B, total height: 1598, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 617.644: Tree memory: 1053.2MB, 8.2 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 617.644: Tree fill ratio (roots/leafs): 99.0%/11.0%
pins2lts-mc-linux64( 0/ 8), 617.644: Stored 185 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 617.644: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 617.644: Est. total memory use: 1053.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin88079334924804026;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](X([](<>(X((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin88079334924804026;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](X([](<>(X((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-18 22:36:15] [INFO ] Applying decomposition
[2022-05-18 22:36:15] [INFO ] Flatten gal took : 16 ms
[2022-05-18 22:36:15] [INFO ] Decomposing Gal with order
[2022-05-18 22:36:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 22:36:15] [INFO ] Removed a total of 330 redundant transitions.
[2022-05-18 22:36:15] [INFO ] Flatten gal took : 52 ms
[2022-05-18 22:36:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-18 22:36:15] [INFO ] Time to serialize gal into /tmp/LTLFireability6037921216142879212.gal : 4 ms
[2022-05-18 22:36:15] [INFO ] Time to serialize properties into /tmp/LTLFireability11325023012911624421.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6037921216142879212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11325023012911624421.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((F(G(X(G(F(X("(((((((((MMNEGSTEP82.P_negotiation_82>=1)&&(MMMTM990.P_network_990>=1))&&(M4.P_poll__handlingMessage_4>=1))||(((MMNEGS...4290
Formula 0 simplified : !FGXGFX"(((((((((MMNEGSTEP82.P_negotiation_82>=1)&&(MMMTM990.P_network_990>=1))&&(M4.P_poll__handlingMessage_4>=1))||(((MMNEGSTEP103...4276
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...566
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2022-05-18 22:57:46] [INFO ] Flatten gal took : 13 ms
[2022-05-18 22:57:46] [INFO ] Input system was already deterministic with 182 transitions.
[2022-05-18 22:57:46] [INFO ] Transformed 143 places.
[2022-05-18 22:57:46] [INFO ] Transformed 182 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-18 22:57:46] [INFO ] Time to serialize gal into /tmp/LTLFireability15420307649402041006.gal : 3 ms
[2022-05-18 22:57:46] [INFO ] Time to serialize properties into /tmp/LTLFireability17547953602225967311.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15420307649402041006.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17547953602225967311.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(X(G(F(X("(((((((((P_negotiation_82>=1)&&(P_network_990>=1))&&(P_poll__handlingMessage_4>=1))||(((P_negotiation_103>=1)&&(P_netw...3306
Formula 0 simplified : !FGXGFX"(((((((((P_negotiation_82>=1)&&(P_network_990>=1))&&(P_poll__handlingMessage_4>=1))||(((P_negotiation_103>=1)&&(P_network_11...3292

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-COL-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-4028"
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 r150-smll-165276998300028"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;