Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.7K Apr 13 04:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 04:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 13 04:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716762536949

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-26 22:28:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 22:28:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:28:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 22:28:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 22:28:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 693 ms
[2024-05-26 22:28:59] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 22:28:59] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-26 22:28:59] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 603 steps, including 16 resets, run visited all 16 properties in 26 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-26 22:28:59] [INFO ] Flatten gal took : 19 ms
[2024-05-26 22:28:59] [INFO ] Flatten gal took : 4 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2024-05-26 22:28:59] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 31 ms.
[2024-05-26 22:28:59] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 811 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 163 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-26 22:28:59] [INFO ] Computed 1562 invariants in 129 ms
[2024-05-26 22:29:01] [INFO ] Implicit Places using invariants in 1370 ms returned []
[2024-05-26 22:29:01] [INFO ] Invariant cache hit.
[2024-05-26 22:29:04] [INFO ] Implicit Places using invariants and state equation in 3073 ms returned []
Implicit Place search using SMT with State Equation took 4448 ms to find 0 implicit places.
[2024-05-26 22:29:04] [INFO ] Invariant cache hit.
[2024-05-26 22:29:04] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5238 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 811 out of 1916 places after structural reductions.
[2024-05-26 22:29:05] [INFO ] Flatten gal took : 138 ms
[2024-05-26 22:29:05] [INFO ] Flatten gal took : 94 ms
[2024-05-26 22:29:05] [INFO ] Input system was already deterministic with 356 transitions.
Incomplete random walk after 10000 steps, including 372 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 20) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-05-26 22:29:06] [INFO ] Invariant cache hit.
[2024-05-26 22:29:07] [INFO ] [Real]Absence check using 0 positive and 1562 generalized place invariants in 275 ms returned sat
[2024-05-26 22:29:08] [INFO ] After 1359ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:15
[2024-05-26 22:29:09] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 290 ms returned sat
[2024-05-26 22:29:11] [INFO ] After 2179ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :14
[2024-05-26 22:29:13] [INFO ] After 4224ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :14
Attempting to minimize the solution found.
Minimization took 1728 ms.
[2024-05-26 22:29:15] [INFO ] After 7443ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :14
Fused 16 Parikh solutions to 13 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 14 properties in 7 ms. (steps per millisecond=17 )
Parikh walk visited 12 properties in 11 ms.
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 1892 transition count 348
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 1890 transition count 348
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 32 place count 1890 transition count 325
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 55 place count 1867 transition count 325
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 1866 transition count 324
Applied a total of 56 rules in 440 ms. Remains 1866 /1916 variables (removed 50) and now considering 324/356 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 1866/1916 places, 324/356 transitions.
Incomplete random walk after 10000 steps, including 358 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3385 steps, run visited all 2 properties in 41 ms. (steps per millisecond=82 )
Probabilistic random walk after 3385 steps, saw 3293 distinct states, run finished after 42 ms. (steps per millisecond=80 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (X(G(!p0))||(X(!p0)&&(X(p1) U (X(G(p1))||(X(p1)&&(p2 U (p3||G(p2))))))))))'
Support contains 577 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 39 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-26 22:29:16] [INFO ] Invariant cache hit.
[2024-05-26 22:29:18] [INFO ] Implicit Places using invariants in 1707 ms returned []
[2024-05-26 22:29:18] [INFO ] Invariant cache hit.
[2024-05-26 22:29:21] [INFO ] Implicit Places using invariants and state equation in 3147 ms returned []
Implicit Place search using SMT with State Equation took 4871 ms to find 0 implicit places.
[2024-05-26 22:29:21] [INFO ] Invariant cache hit.
[2024-05-26 22:29:22] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5564 ms. Remains : 1916/1916 places, 356/356 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 722 ms :[true, (NOT p1), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0 (NOT p3) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p2) (NOT p3)), p0, p0, p0, (AND (NOT p3) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=p3, acceptance={} source=2 dest: 11}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 12}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 13}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 13}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p3 p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=4 dest: 8}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 13}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=5 dest: 9}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 13}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 12}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=6 dest: 14}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=7 dest: 9}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=(AND p3 p1), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=9 dest: 14}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=10 dest: 14}], [{ cond=p0, acceptance={} source=11 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=11 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=11 dest: 13}], [{ cond=p0, acceptance={} source=12 dest: 0}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=12 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=12 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=12 dest: 5}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=12 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=12 dest: 13}], [{ cond=p0, acceptance={} source=13 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=13 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=13 dest: 6}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=13 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=14 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=14 dest: 14}]], initial=2, aps=[p1:(GEQ s1915 1), p3:(AND (NOT (OR (LT s1915 1) (GEQ s1915 1))) (OR (AND (GEQ s1064 1) (GEQ s1087 1) (GEQ s1110 1) (GEQ s1133 1) (GEQ s1156 1) (GEQ s1179 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3707 reset in 1143 ms.
Product exploration explored 100000 steps with 3717 reset in 1082 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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 p1 (NOT p3) (NOT p2) (NOT p0)), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p0) p1))), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p3) p2 p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 p0 p1)))), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p3) (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 22 factoid took 464 ms. Reduced automaton from 15 states, 71 edges and 4 AP (stutter sensitive) to 15 states, 69 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 527 ms :[true, (NOT p1), p0, (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) p0 (NOT p3) (NOT p2)), (AND p0 (NOT p2) (NOT p3)), p0, p0, p0]
Incomplete random walk after 10000 steps, including 374 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 23) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-26 22:29:27] [INFO ] Invariant cache hit.
[2024-05-26 22:29:29] [INFO ] [Real]Absence check using 0 positive and 1562 generalized place invariants in 261 ms returned sat
[2024-05-26 22:29:30] [INFO ] After 1887ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:13
[2024-05-26 22:29:31] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 285 ms returned sat
[2024-05-26 22:29:40] [INFO ] After 8616ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :8
[2024-05-26 22:29:45] [INFO ] After 13222ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :8
Attempting to minimize the solution found.
Minimization took 4663 ms.
[2024-05-26 22:29:49] [INFO ] After 19397ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :8
Fused 18 Parikh solutions to 7 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 8 properties in 9 ms. (steps per millisecond=13 )
Parikh walk visited 2 properties in 9 ms.
Support contains 577 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.3 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 1363 transition count 325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 1361 transition count 325
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 54 place count 1339 transition count 303
Iterating global reduction 2 with 22 rules applied. Total rules applied 76 place count 1339 transition count 303
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 99 place count 1339 transition count 280
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 122 place count 1316 transition count 280
Applied a total of 122 rules in 103 ms. Remains 1316 /1916 variables (removed 600) and now considering 280/356 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 1316/1916 places, 280/356 transitions.
Incomplete random walk after 10000 steps, including 385 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Finished probabilistic random walk after 3709 steps, run visited all 6 properties in 101 ms. (steps per millisecond=36 )
Probabilistic random walk after 3709 steps, saw 3616 distinct states, run finished after 102 ms. (steps per millisecond=36 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p3) (NOT p2) (NOT p0)), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p0) p1))), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p3) p2 p0 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 p0 p1)))), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p0))), (G (NOT (AND (NOT p0) p1 (NOT p3) p2))), (G (NOT (AND p0 p1 (NOT p3) p2))), (G (NOT (AND p0 (NOT p1) (NOT p3) p2))), (G (NOT (AND p0 (NOT p3) p2)))]
False Knowledge obtained : [(X (AND (NOT p3) (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (F (AND p0 p1 p3)), (F (AND p1 (NOT p3) p2)), (F (AND (NOT p0) p1 p3)), (F (AND (NOT p0) (NOT p1) (NOT p3) p2)), (F (AND (NOT p3) p2)), (F (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT (AND p1 (NOT p3) (NOT p2)))), (F (AND p1 p3)), (F (NOT p1)), (F (AND p0 (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p1) p3)), (F (AND (NOT p1) (NOT p3) p2)), (F (AND (NOT p1) (NOT p3) (NOT p2))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (F p0), (F (AND p0 p1 (NOT p3) (NOT p2))), (F (AND p0 (NOT p3) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (AND p1 (NOT p3) p2))
Knowledge based reduction with 26 factoid took 534 ms. Reduced automaton from 15 states, 69 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-00 finished in 35456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.15 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Applied a total of 3 rules in 234 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2024-05-26 22:29:52] [INFO ] Computed 1540 invariants in 43 ms
[2024-05-26 22:29:54] [INFO ] Implicit Places using invariants in 2174 ms returned []
[2024-05-26 22:29:54] [INFO ] Invariant cache hit.
[2024-05-26 22:29:58] [INFO ] Implicit Places using invariants and state equation in 3893 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 6073 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/1916 places, 353/356 transitions.
Applied a total of 0 rules in 126 ms. Remains 1845 /1845 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6434 ms. Remains : 1845/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LT s1842 1), p0:(OR (AND (GEQ s1596 1) (GEQ s1757 1)) (AND (GEQ s1599 1) (GEQ s1760 1)) (AND (GEQ s1604 1) (GEQ s1765 1)) (AND (GEQ s1588 1) (GEQ s174...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-01 finished in 6553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&X(p1)))))))'
Support contains 70 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-26 22:29:58] [INFO ] Computed 1562 invariants in 29 ms
[2024-05-26 22:30:00] [INFO ] Implicit Places using invariants in 2128 ms returned []
[2024-05-26 22:30:00] [INFO ] Invariant cache hit.
[2024-05-26 22:30:04] [INFO ] Implicit Places using invariants and state equation in 3574 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5726 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 78 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5872 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s1719 1) (GEQ s1765 1)) (AND (GEQ s1711 1) (GEQ s1757 1)) (AND (GEQ s1724 1) (GEQ s1770 1)) (AND (GEQ s1713 1) (GEQ s1759 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-02 finished in 6084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 96 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-26 22:30:04] [INFO ] Invariant cache hit.
[2024-05-26 22:30:07] [INFO ] Implicit Places using invariants in 2245 ms returned []
[2024-05-26 22:30:07] [INFO ] Invariant cache hit.
[2024-05-26 22:30:10] [INFO ] Implicit Places using invariants and state equation in 3961 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6214 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 86 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6397 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s1619 1) (GEQ s1803 1)) (AND (GEQ s1622 1) (GEQ s1806 1)) (AND (GEQ s1627 1) (GEQ s1811 1)) (AND (GEQ s1611 1) (GEQ s1795 1)) (AND (GEQ s...], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 847 ms.
Product exploration explored 100000 steps with 33333 reset in 765 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-03 finished in 8437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U (X(X(X(p1)))&&F(p2))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-26 22:30:13] [INFO ] Invariant cache hit.
[2024-05-26 22:30:15] [INFO ] Implicit Places using invariants in 2129 ms returned []
[2024-05-26 22:30:15] [INFO ] Invariant cache hit.
[2024-05-26 22:30:18] [INFO ] Implicit Places using invariants and state equation in 3485 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5621 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5748 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 569 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 9}, { cond=p0, acceptance={} source=5 dest: 10}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 11}], [{ cond=(NOT p0), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 12}, { cond=p0, acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=11 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=12 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=13 dest: 8}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=13 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={0} source=13 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={0} source=13 dest: 14}], [{ cond=(NOT p0), acceptance={} source=14 dest: 8}, { cond=p0, acceptance={} source=14 dest: 14}]], initial=0, aps=[p0:(GEQ s1890 1), p2:(OR (AND (GEQ s0 1) (GEQ s1781 1)) (AND (GEQ s0 1) (GEQ s1780 1)) (AND (GEQ s0 1) (GEQ s1779 1)) (AND (GEQ s0 1) (GEQ s1778 1)) (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 51 steps with 2 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-04 finished in 6348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X((F(!p1)&&X(X(G(!p2)))))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 3 place count 1891 transition count 353
Applied a total of 3 rules in 177 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2024-05-26 22:30:19] [INFO ] Computed 1540 invariants in 31 ms
[2024-05-26 22:30:21] [INFO ] Implicit Places using invariants in 2253 ms returned []
[2024-05-26 22:30:21] [INFO ] Invariant cache hit.
[2024-05-26 22:30:25] [INFO ] Implicit Places using invariants and state equation in 3952 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6211 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1868/1916 places, 353/356 transitions.
Applied a total of 0 rules in 81 ms. Remains 1868 /1868 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6470 ms. Remains : 1868/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 603 ms :[(OR p1 p2), (OR p1 p2), (OR p1 p2), p2, p2, p1, p2, p2, p2, (AND p1 p2), p2, p2, p2, p2]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 3}, { cond=true, acceptance={1} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}, { cond=p0, acceptance={0, 1} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}, { cond=p0, acceptance={0, 1} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 7}, { cond=true, acceptance={1} source=3 dest: 8}, { cond=p1, acceptance={} source=3 dest: 9}, { cond=p0, acceptance={0, 1} source=3 dest: 10}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 11}, { cond=true, acceptance={1} source=4 dest: 12}, { cond=p0, acceptance={0, 1} source=4 dest: 13}], [{ cond=p1, acceptance={0, 1} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=6 dest: 7}, { cond=p1, acceptance={} source=6 dest: 9}, { cond=p0, acceptance={0, 1} source=6 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=7 dest: 7}, { cond=(NOT p2), acceptance={} source=7 dest: 8}, { cond=p2, acceptance={1} source=7 dest: 8}, { cond=p1, acceptance={} source=7 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 10}, { cond=(AND p0 p2), acceptance={0, 1} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 11}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=8 dest: 11}, { cond=(NOT p2), acceptance={} source=8 dest: 12}, { cond=p2, acceptance={1} source=8 dest: 12}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 13}, { cond=(AND p0 p2), acceptance={0, 1} source=8 dest: 13}], [{ cond=(AND p1 p2), acceptance={} source=9 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=10 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=10 dest: 7}, { cond=p1, acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=10 dest: 10}, { cond=(AND p0 p2), acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=11 dest: 3}, { cond=p2, acceptance={1} source=11 dest: 4}, { cond=(AND p1 p2), acceptance={} source=11 dest: 5}, { cond=(AND p0 p2), acceptance={0, 1} source=11 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=11 dest: 7}, { cond=(NOT p2), acceptance={} source=11 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=11 dest: 10}], [{ cond=p2, acceptance={1} source=12 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=12 dest: 1}, { cond=(AND p0 p2), acceptance={0, 1} source=12 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=12 dest: 11}, { cond=(NOT p2), acceptance={} source=12 dest: 12}, { cond=(AND p0 (NOT p2)), acceptance={0} source=12 dest: 13}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=13 dest: 3}, { cond=(AND p1 p2), acceptance={} source=13 dest: 5}, { cond=(AND p0 p2), acceptance={0, 1} source=13 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=13 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=13 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=13 dest: 10}]], initial=0, aps=[p0:(OR (AND (GEQ s1696 1) (GEQ s1742 1)) (AND (GEQ s1688 1) (GEQ s1734 1)) (AND (GEQ s1701 1) (GEQ s1747 1)) (AND (GEQ s1690 1) (GEQ s1736 1)) (AND (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 3714 reset in 449 ms.
Product exploration explored 100000 steps with 3715 reset in 503 ms.
Computed a total of 1868 stabilizing places and 353 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1868 transition count 353
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) (NOT p2)), (X (NOT p1)), true, (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 14 states, 61 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-05 finished in 8344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 69 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-26 22:30:27] [INFO ] Computed 1562 invariants in 36 ms
[2024-05-26 22:30:30] [INFO ] Implicit Places using invariants in 2213 ms returned []
[2024-05-26 22:30:30] [INFO ] Invariant cache hit.
[2024-05-26 22:30:34] [INFO ] Implicit Places using invariants and state equation in 3990 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6219 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 60 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6348 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1680 1) (GEQ s1681 1) (GEQ s1682 1) (GEQ s1683 1) (GEQ s1684 1) (GEQ s1685 1) (GEQ s1686 1) (GEQ s1687 1) (GEQ s1688 1) (GEQ s1689 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-06 finished in 6495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1890 transition count 352
Applied a total of 5 rules in 155 ms. Remains 1890 /1916 variables (removed 26) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1890 cols
[2024-05-26 22:30:34] [INFO ] Computed 1540 invariants in 25 ms
[2024-05-26 22:30:36] [INFO ] Implicit Places using invariants in 2176 ms returned []
[2024-05-26 22:30:36] [INFO ] Invariant cache hit.
[2024-05-26 22:30:40] [INFO ] Implicit Places using invariants and state equation in 3948 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6128 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1867/1916 places, 352/356 transitions.
Applied a total of 0 rules in 103 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6386 ms. Remains : 1867/1916 places, 352/356 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-07 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 (AND (GEQ s1696 1) (GEQ s1742 1)) (AND (GEQ s1688 1) (GEQ s1734 1)) (AND (GEQ s1701 1) (GEQ s1747 1)) (AND (GEQ s1690 1) (GEQ s1736 1)) (AND (GEQ s...], 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 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-07 finished in 6439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(!p0))&&(G(F(p2))||p1))))'
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.6 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1889 transition count 351
Applied a total of 5 rules in 85 ms. Remains 1889 /1916 variables (removed 27) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2024-05-26 22:30:40] [INFO ] Computed 1540 invariants in 29 ms
[2024-05-26 22:30:42] [INFO ] Implicit Places using invariants in 1771 ms returned []
[2024-05-26 22:30:42] [INFO ] Invariant cache hit.
[2024-05-26 22:30:45] [INFO ] Implicit Places using invariants and state equation in 2902 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 4690 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1866/1916 places, 351/356 transitions.
Applied a total of 0 rules in 45 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4821 ms. Remains : 1866/1916 places, 351/356 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s1064 1) (GEQ s1087 1) (GEQ s1110 1) (GEQ s1133 1) (GEQ s1156 1) (GEQ s1179 1) (GEQ s1202 1) (GEQ s1225 1) (GEQ s1248 1) (GEQ s1271 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3477 reset in 530 ms.
Product exploration explored 100000 steps with 3471 reset in 565 ms.
Computed a total of 1866 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1866 transition count 351
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) p2 (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 16 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-08 finished in 6416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(X(p1) U p2))))'
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 34 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-26 22:30:47] [INFO ] Computed 1562 invariants in 33 ms
[2024-05-26 22:30:48] [INFO ] Implicit Places using invariants in 1752 ms returned []
[2024-05-26 22:30:48] [INFO ] Invariant cache hit.
[2024-05-26 22:30:52] [INFO ] Implicit Places using invariants and state equation in 3545 ms returned []
Implicit Place search using SMT with State Equation took 5300 ms to find 0 implicit places.
[2024-05-26 22:30:52] [INFO ] Invariant cache hit.
[2024-05-26 22:30:53] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5969 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (AND (GEQ s1719 1) (GEQ s1788 1)) (AND (GEQ s1711 1) (GEQ s1780 1)) (AND (GEQ s1724 1) (GEQ s1793 1)) (AND (GEQ s1713 1) (GEQ s1782 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-10 finished in 6150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||G(!p1)))&&X(X(G(!p2)))))'
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 36 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-26 22:30:53] [INFO ] Invariant cache hit.
[2024-05-26 22:30:55] [INFO ] Implicit Places using invariants in 1730 ms returned []
[2024-05-26 22:30:55] [INFO ] Invariant cache hit.
[2024-05-26 22:30:58] [INFO ] Implicit Places using invariants and state equation in 3604 ms returned []
Implicit Place search using SMT with State Equation took 5340 ms to find 0 implicit places.
[2024-05-26 22:30:58] [INFO ] Invariant cache hit.
[2024-05-26 22:30:59] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5985 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (OR p2 p1), (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND p0 p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(GEQ s1911 1), p2:(OR (AND (GEQ s1064 1) (GEQ s1087 1) (GEQ s1110 1) (GEQ s1133 1) (GEQ s1156 1) (GEQ s1179 1) (GEQ s1202 1) (GEQ s1225 1) (GEQ s1248 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3709 reset in 539 ms.
Product exploration explored 100000 steps with 3722 reset in 549 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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 p2) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 10 factoid took 566 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (OR p1 p2), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 22:31:02] [INFO ] Invariant cache hit.
[2024-05-26 22:31:02] [INFO ] [Real]Absence check using 0 positive and 1562 generalized place invariants in 281 ms returned sat
[2024-05-26 22:31:03] [INFO ] After 640ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 22:31:03] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 277 ms returned sat
[2024-05-26 22:31:05] [INFO ] After 1815ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 22:31:06] [INFO ] After 2771ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1656 ms.
[2024-05-26 22:31:08] [INFO ] After 5087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 98 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=49 )
Parikh walk visited 3 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) (NOT p1) p0)), (F p0), (F (OR p2 p1)), (F (OR p2 (AND p1 p0))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 1020 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (OR p1 p2), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 170 ms :[true, (OR p1 p2), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 33 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-26 22:31:09] [INFO ] Invariant cache hit.
[2024-05-26 22:31:11] [INFO ] Implicit Places using invariants in 1724 ms returned []
[2024-05-26 22:31:11] [INFO ] Invariant cache hit.
[2024-05-26 22:31:14] [INFO ] Implicit Places using invariants and state equation in 3555 ms returned []
Implicit Place search using SMT with State Equation took 5280 ms to find 0 implicit places.
[2024-05-26 22:31:14] [INFO ] Invariant cache hit.
[2024-05-26 22:31:15] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5939 ms. Remains : 1916/1916 places, 356/356 transitions.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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 p2) (NOT p1) (NOT p0)), (X (X (NOT (OR p2 (AND p1 p0))))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
Knowledge based reduction with 7 factoid took 387 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 22:31:16] [INFO ] Invariant cache hit.
[2024-05-26 22:31:17] [INFO ] [Real]Absence check using 0 positive and 1562 generalized place invariants in 268 ms returned sat
[2024-05-26 22:31:18] [INFO ] After 785ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-26 22:31:19] [INFO ] After 1501ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-05-26 22:31:19] [INFO ] After 2320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2024-05-26 22:31:19] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 283 ms returned sat
[2024-05-26 22:31:21] [INFO ] After 1347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 22:31:22] [INFO ] After 2072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 625 ms.
[2024-05-26 22:31:22] [INFO ] After 3395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 98 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=24 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT (OR p2 (AND p1 p0))))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) (NOT p2) p0)), (F p0), (F (OR p1 p2)), (F (OR (AND p1 p0) p2)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 667 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 150 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 227 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Product exploration explored 100000 steps with 3714 reset in 510 ms.
Product exploration explored 100000 steps with 3713 reset in 543 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 141 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.9 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1892 transition count 355
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 285 ms. Remains 1892 /1916 variables (removed 24) and now considering 355/356 (removed 1) transitions.
[2024-05-26 22:31:25] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 355 rows 1892 cols
[2024-05-26 22:31:25] [INFO ] Computed 1540 invariants in 23 ms
[2024-05-26 22:31:26] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1892/1916 places, 355/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 954 ms. Remains : 1892/1916 places, 355/356 transitions.
Built C files in :
/tmp/ltsmin14788778020984178914
[2024-05-26 22:31:26] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14788778020984178914
Running compilation step : cd /tmp/ltsmin14788778020984178914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1361 ms.
Running link step : cd /tmp/ltsmin14788778020984178914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14788778020984178914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4996714074616039200.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 35 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-26 22:31:41] [INFO ] Computed 1562 invariants in 32 ms
[2024-05-26 22:31:43] [INFO ] Implicit Places using invariants in 1838 ms returned []
[2024-05-26 22:31:43] [INFO ] Invariant cache hit.
[2024-05-26 22:31:46] [INFO ] Implicit Places using invariants and state equation in 3581 ms returned []
Implicit Place search using SMT with State Equation took 5421 ms to find 0 implicit places.
[2024-05-26 22:31:46] [INFO ] Invariant cache hit.
[2024-05-26 22:31:47] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6115 ms. Remains : 1916/1916 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin15465880622653280393
[2024-05-26 22:31:47] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15465880622653280393
Running compilation step : cd /tmp/ltsmin15465880622653280393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1224 ms.
Running link step : cd /tmp/ltsmin15465880622653280393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15465880622653280393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7408078431294157842.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 22:32:02] [INFO ] Flatten gal took : 63 ms
[2024-05-26 22:32:02] [INFO ] Flatten gal took : 70 ms
[2024-05-26 22:32:02] [INFO ] Time to serialize gal into /tmp/LTL4087154648414184811.gal : 12 ms
[2024-05-26 22:32:02] [INFO ] Time to serialize properties into /tmp/LTL6807344944158234153.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4087154648414184811.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7417083018575583245.hoa' '-atoms' '/tmp/LTL6807344944158234153.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6807344944158234153.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7417083018575583245.hoa
Detected timeout of ITS tools.
[2024-05-26 22:32:18] [INFO ] Flatten gal took : 60 ms
[2024-05-26 22:32:18] [INFO ] Flatten gal took : 55 ms
[2024-05-26 22:32:18] [INFO ] Time to serialize gal into /tmp/LTL2329470044527226546.gal : 7 ms
[2024-05-26 22:32:18] [INFO ] Time to serialize properties into /tmp/LTL5358406312744621585.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2329470044527226546.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5358406312744621585.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(("(((((((n1_16<1)||(Sstart_16<1))&&((n1_8<1)||(Sstart_8<1)))&&(((n1_21<1)||(Sstart_21<1))&&((n1_10<1)||(Sstart_10<1))))&&((((n1_...8406
Formula 0 simplified : F(!"(((((((n1_16<1)||(Sstart_16<1))&&((n1_8<1)||(Sstart_8<1)))&&(((n1_21<1)||(Sstart_21<1))&&((n1_10<1)||(Sstart_10<1))))&&((((n1_14...8392
Detected timeout of ITS tools.
[2024-05-26 22:32:33] [INFO ] Flatten gal took : 54 ms
[2024-05-26 22:32:33] [INFO ] Applying decomposition
[2024-05-26 22:32:33] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15197449037083569895.txt' '-o' '/tmp/graph15197449037083569895.bin' '-w' '/tmp/graph15197449037083569895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15197449037083569895.bin' '-l' '-1' '-v' '-w' '/tmp/graph15197449037083569895.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:32:33] [INFO ] Decomposing Gal with order
[2024-05-26 22:32:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:32:33] [INFO ] Removed a total of 229 redundant transitions.
[2024-05-26 22:32:33] [INFO ] Flatten gal took : 234 ms
[2024-05-26 22:32:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 89 ms.
[2024-05-26 22:32:34] [INFO ] Time to serialize gal into /tmp/LTL5822400996490925986.gal : 21 ms
[2024-05-26 22:32:34] [INFO ] Time to serialize properties into /tmp/LTL11200297904675212783.ltl : 73 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5822400996490925986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11200297904675212783.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(("(((((((i38.i0.u64.n1_16<1)||(i38.i0.u102.Sstart_16<1))&&((i8.i1.u50.n1_8<1)||(i8.i1.u95.Sstart_8<1)))&&(((i26.u114.n1_21<1)||(...14773
Formula 0 simplified : F(!"(((((((i38.i0.u64.n1_16<1)||(i38.i0.u102.Sstart_16<1))&&((i8.i1.u50.n1_8<1)||(i8.i1.u95.Sstart_8<1)))&&(((i26.u114.n1_21<1)||(i2...14759
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13836684014080037420
[2024-05-26 22:32:49] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13836684014080037420
Running compilation step : cd /tmp/ltsmin13836684014080037420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1342 ms.
Running link step : cd /tmp/ltsmin13836684014080037420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13836684014080037420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](((LTLAPp0==true)||[]((LTLAPp1==true))))&&X(X([]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-11 finished in 131012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(F(!p1)||X(!p2))))'
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 37 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-26 22:33:04] [INFO ] Invariant cache hit.
[2024-05-26 22:33:05] [INFO ] Implicit Places using invariants in 1583 ms returned []
[2024-05-26 22:33:05] [INFO ] Invariant cache hit.
[2024-05-26 22:33:09] [INFO ] Implicit Places using invariants and state equation in 3621 ms returned []
Implicit Place search using SMT with State Equation took 5206 ms to find 0 implicit places.
[2024-05-26 22:33:09] [INFO ] Invariant cache hit.
[2024-05-26 22:33:10] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5861 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), (AND p1 p2), p1]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s1619 1) (GEQ s1826 1)) (AND (GEQ s1622 1) (GEQ s1829 1)) (AND (GEQ s1627 1) (GEQ s1834 1)) (AND (GEQ s1611 1) (GEQ s1818 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-12 finished in 6069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(((!p1||F(!p2)) U (!p2||G((!p1||F(!p2))))))))))'
Support contains 94 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-26 22:33:10] [INFO ] Invariant cache hit.
[2024-05-26 22:33:12] [INFO ] Implicit Places using invariants in 2066 ms returned []
[2024-05-26 22:33:12] [INFO ] Invariant cache hit.
[2024-05-26 22:33:16] [INFO ] Implicit Places using invariants and state equation in 3982 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6051 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6173 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), true, (AND p2 p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1892 1), p2:(OR (AND (GEQ s1677 1) (GEQ s1792 1)) (AND (GEQ s1661 1) (GEQ s1776 1)) (AND (GEQ s1664 1) (GEQ s1779 1)) (AND (GEQ s1669 1) (GEQ s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 82 steps with 27 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-13 finished in 6315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(G(p1)))))))'
Support contains 24 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 66 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-26 22:33:16] [INFO ] Invariant cache hit.
[2024-05-26 22:33:18] [INFO ] Implicit Places using invariants in 2087 ms returned []
[2024-05-26 22:33:18] [INFO ] Invariant cache hit.
[2024-05-26 22:33:23] [INFO ] Implicit Places using invariants and state equation in 4153 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6251 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6379 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1888 1), p1:(AND (LT s1825 1) (LT s1824 1) (LT s1823 1) (LT s1822 1) (LT s1829 1) (LT s1828 1) (LT s1827 1) (LT s1826 1) (LT s1821 1) (LT s1820 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-14 finished in 6537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(p0) U (X(G(!p2))||p1)))))'
Support contains 48 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-26 22:33:23] [INFO ] Invariant cache hit.
[2024-05-26 22:33:25] [INFO ] Implicit Places using invariants in 2089 ms returned []
[2024-05-26 22:33:25] [INFO ] Invariant cache hit.
[2024-05-26 22:33:29] [INFO ] Implicit Places using invariants and state equation in 3654 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5751 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5874 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s1892 1), p1:(OR (AND (GEQ s0 1) (GEQ s1739 1)) (AND (GEQ s0 1) (GEQ s1740 1)) (AND (GEQ s0 1) (GEQ s1737 1)) (AND (GEQ s0 1) (GEQ s1738 1)) (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 31645 reset in 806 ms.
Product exploration explored 100000 steps with 31359 reset in 825 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 356 rows 1893 cols
[2024-05-26 22:33:31] [INFO ] Computed 1540 invariants in 124 ms
[2024-05-26 22:33:32] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 275 ms returned sat
[2024-05-26 22:33:32] [INFO ] After 1096ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 22:33:33] [INFO ] [Nat]Absence check using 0 positive and 1540 generalized place invariants in 277 ms returned sat
[2024-05-26 22:33:33] [INFO ] After 617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 22:33:34] [INFO ] After 769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 106 ms.
[2024-05-26 22:33:34] [INFO ] After 1350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F p2)]
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 48 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-26 22:33:34] [INFO ] Invariant cache hit.
[2024-05-26 22:33:36] [INFO ] Implicit Places using invariants in 2092 ms returned []
[2024-05-26 22:33:36] [INFO ] Invariant cache hit.
[2024-05-26 22:33:40] [INFO ] Implicit Places using invariants and state equation in 3754 ms returned []
Implicit Place search using SMT with State Equation took 5852 ms to find 0 implicit places.
[2024-05-26 22:33:40] [INFO ] Invariant cache hit.
[2024-05-26 22:33:41] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6502 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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 p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 22:33:41] [INFO ] Invariant cache hit.
[2024-05-26 22:33:42] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 267 ms returned sat
[2024-05-26 22:33:42] [INFO ] After 1049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 22:33:43] [INFO ] [Nat]Absence check using 0 positive and 1540 generalized place invariants in 264 ms returned sat
[2024-05-26 22:33:43] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 22:33:44] [INFO ] After 726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2024-05-26 22:33:44] [INFO ] After 1316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F p2)]
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2]
Product exploration explored 100000 steps with 31844 reset in 801 ms.
Product exploration explored 100000 steps with 31999 reset in 813 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 220 ms :[true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 48 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 1869 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1869 transition count 356
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 149 ms. Remains 1869 /1893 variables (removed 24) and now considering 356/356 (removed 0) transitions.
[2024-05-26 22:33:46] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 356 rows 1869 cols
[2024-05-26 22:33:47] [INFO ] Computed 1518 invariants in 154 ms
[2024-05-26 22:33:47] [INFO ] Dead Transitions using invariants and state equation in 749 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1893 places, 356/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 948 ms. Remains : 1869/1893 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin1561748144787596280
[2024-05-26 22:33:47] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1561748144787596280
Running compilation step : cd /tmp/ltsmin1561748144787596280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1187 ms.
Running link step : cd /tmp/ltsmin1561748144787596280;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1561748144787596280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7630495226308420020.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 48 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 57 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2024-05-26 22:34:02] [INFO ] Computed 1540 invariants in 115 ms
[2024-05-26 22:34:04] [INFO ] Implicit Places using invariants in 2113 ms returned []
[2024-05-26 22:34:04] [INFO ] Invariant cache hit.
[2024-05-26 22:34:08] [INFO ] Implicit Places using invariants and state equation in 3918 ms returned []
Implicit Place search using SMT with State Equation took 6035 ms to find 0 implicit places.
[2024-05-26 22:34:08] [INFO ] Invariant cache hit.
[2024-05-26 22:34:09] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6708 ms. Remains : 1893/1893 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin2823523667356996632
[2024-05-26 22:34:09] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2823523667356996632
Running compilation step : cd /tmp/ltsmin2823523667356996632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1212 ms.
Running link step : cd /tmp/ltsmin2823523667356996632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2823523667356996632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4895675319157127981.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 22:34:24] [INFO ] Flatten gal took : 43 ms
[2024-05-26 22:34:24] [INFO ] Flatten gal took : 44 ms
[2024-05-26 22:34:24] [INFO ] Time to serialize gal into /tmp/LTL6247942612904174815.gal : 6 ms
[2024-05-26 22:34:24] [INFO ] Time to serialize properties into /tmp/LTL4645457853272317972.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6247942612904174815.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8763079845838116008.hoa' '-atoms' '/tmp/LTL4645457853272317972.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4645457853272317972.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8763079845838116008.hoa
Detected timeout of ITS tools.
[2024-05-26 22:34:39] [INFO ] Flatten gal took : 40 ms
[2024-05-26 22:34:39] [INFO ] Flatten gal took : 39 ms
[2024-05-26 22:34:39] [INFO ] Time to serialize gal into /tmp/LTL1635318663179605759.gal : 6 ms
[2024-05-26 22:34:39] [INFO ] Time to serialize properties into /tmp/LTL9128472245247716499.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1635318663179605759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9128472245247716499.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("(Astart_0>=1)")||((G("(Astart_0>=1)"))U(("((((((malicious_reservoir_0>=1)&&(c1_13>=1))||((malicious_reservoir_0>=1)&&(c1_14>=1)...2100
Formula 0 simplified : X(!"(Astart_0>=1)" & (F!"(Astart_0>=1)" R (!"((((((malicious_reservoir_0>=1)&&(c1_13>=1))||((malicious_reservoir_0>=1)&&(c1_14>=1)))...2081
Detected timeout of ITS tools.
[2024-05-26 22:34:54] [INFO ] Flatten gal took : 39 ms
[2024-05-26 22:34:54] [INFO ] Applying decomposition
[2024-05-26 22:34:54] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14161164463693813535.txt' '-o' '/tmp/graph14161164463693813535.bin' '-w' '/tmp/graph14161164463693813535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14161164463693813535.bin' '-l' '-1' '-v' '-w' '/tmp/graph14161164463693813535.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:34:55] [INFO ] Decomposing Gal with order
[2024-05-26 22:34:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:34:55] [INFO ] Removed a total of 229 redundant transitions.
[2024-05-26 22:34:55] [INFO ] Flatten gal took : 247 ms
[2024-05-26 22:34:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 51 ms.
[2024-05-26 22:34:55] [INFO ] Time to serialize gal into /tmp/LTL8798482744528417091.gal : 38 ms
[2024-05-26 22:34:55] [INFO ] Time to serialize properties into /tmp/LTL17079092846705205801.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8798482744528417091.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17079092846705205801.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(("(i8.i2.u138.Astart_0>=1)")||((G("(i8.i2.u138.Astart_0>=1)"))U(("((((((u0.malicious_reservoir_0>=1)&&(i6.u112.c1_13>=1))||((u0.m...2608
Formula 0 simplified : X(!"(i8.i2.u138.Astart_0>=1)" & (F!"(i8.i2.u138.Astart_0>=1)" R (!"((((((u0.malicious_reservoir_0>=1)&&(i6.u112.c1_13>=1))||((u0.mal...2589
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9856892630707119351
[2024-05-26 22:35:10] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9856892630707119351
Running compilation step : cd /tmp/ltsmin9856892630707119351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1201 ms.
Running link step : cd /tmp/ltsmin9856892630707119351;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9856892630707119351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)||([]((LTLAPp0==true)) U (X([](!(LTLAPp2==true)))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-15 finished in 122511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||G(!p1)))&&X(X(G(!p2)))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-22-LTLFireability-11
Stuttering acceptance computed with spot in 230 ms :[true, (OR p2 p1), (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Applied a total of 3 rules in 82 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2024-05-26 22:35:26] [INFO ] Computed 1540 invariants in 28 ms
[2024-05-26 22:35:27] [INFO ] Implicit Places using invariants in 1741 ms returned []
[2024-05-26 22:35:27] [INFO ] Invariant cache hit.
[2024-05-26 22:35:31] [INFO ] Implicit Places using invariants and state equation in 3334 ms returned []
Implicit Place search using SMT with State Equation took 5077 ms to find 0 implicit places.
[2024-05-26 22:35:31] [INFO ] Invariant cache hit.
[2024-05-26 22:35:31] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1891/1916 places, 353/356 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5775 ms. Remains : 1891/1916 places, 353/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND p0 p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(GEQ s1887 1), p2:(OR (AND (GEQ s1064 1) (GEQ s1087 1) (GEQ s1110 1) (GEQ s1133 1) (GEQ s1156 1) (GEQ s1179 1) (GEQ s1202 1) (GEQ s1225 1) (GEQ s1248 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3715 reset in 523 ms.
Product exploration explored 100000 steps with 3709 reset in 548 ms.
Computed a total of 1891 stabilizing places and 353 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1891 transition count 353
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 p2) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 10 factoid took 586 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (OR p1 p2), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 22:35:34] [INFO ] Invariant cache hit.
[2024-05-26 22:35:35] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 263 ms returned sat
[2024-05-26 22:35:35] [INFO ] After 612ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 22:35:35] [INFO ] [Nat]Absence check using 0 positive and 1540 generalized place invariants in 271 ms returned sat
[2024-05-26 22:35:37] [INFO ] After 1097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 22:35:37] [INFO ] After 1981ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1302 ms.
[2024-05-26 22:35:39] [INFO ] After 3940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 98 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=32 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) (NOT p1) p0)), (F p0), (F (OR p2 p1)), (F (OR p2 (AND p1 p0))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 998 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (OR p1 p2), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 179 ms :[true, (OR p1 p2), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1891/1891 places, 353/353 transitions.
Applied a total of 0 rules in 34 ms. Remains 1891 /1891 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2024-05-26 22:35:40] [INFO ] Invariant cache hit.
[2024-05-26 22:35:42] [INFO ] Implicit Places using invariants in 1746 ms returned []
[2024-05-26 22:35:42] [INFO ] Invariant cache hit.
[2024-05-26 22:35:45] [INFO ] Implicit Places using invariants and state equation in 3380 ms returned []
Implicit Place search using SMT with State Equation took 5128 ms to find 0 implicit places.
[2024-05-26 22:35:45] [INFO ] Invariant cache hit.
[2024-05-26 22:35:46] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5792 ms. Remains : 1891/1891 places, 353/353 transitions.
Computed a total of 1891 stabilizing places and 353 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1891 transition count 353
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 p2) (NOT p1) (NOT p0)), (X (X (NOT (OR p2 (AND p1 p0))))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
Knowledge based reduction with 7 factoid took 407 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 22:35:48] [INFO ] Invariant cache hit.
[2024-05-26 22:35:48] [INFO ] [Real]Absence check using 0 positive and 1540 generalized place invariants in 273 ms returned sat
[2024-05-26 22:35:48] [INFO ] After 628ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 22:35:49] [INFO ] [Nat]Absence check using 0 positive and 1540 generalized place invariants in 278 ms returned sat
[2024-05-26 22:35:50] [INFO ] After 1127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 22:35:51] [INFO ] After 2140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1526 ms.
[2024-05-26 22:35:53] [INFO ] After 4323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 96 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=32 )
Parikh walk visited 3 properties in 2 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT (OR p2 (AND p1 p0))))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) (NOT p2) p0)), (F p0), (F (OR p1 p2)), (F (OR (AND p1 p0) p2)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 709 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 179 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 164 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Product exploration explored 100000 steps with 3715 reset in 515 ms.
Product exploration explored 100000 steps with 3721 reset in 541 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 163 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1891 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1891/1891 places, 353/353 transitions.
Applied a total of 0 rules in 44 ms. Remains 1891 /1891 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2024-05-26 22:35:55] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-26 22:35:55] [INFO ] Invariant cache hit.
[2024-05-26 22:35:56] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 704 ms. Remains : 1891/1891 places, 353/353 transitions.
Built C files in :
/tmp/ltsmin4098247704148464969
[2024-05-26 22:35:56] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4098247704148464969
Running compilation step : cd /tmp/ltsmin4098247704148464969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1274 ms.
Running link step : cd /tmp/ltsmin4098247704148464969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4098247704148464969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11799184955651717621.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 599 out of 1891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1891/1891 places, 353/353 transitions.
Applied a total of 0 rules in 27 ms. Remains 1891 /1891 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2024-05-26 22:36:11] [INFO ] Invariant cache hit.
[2024-05-26 22:36:13] [INFO ] Implicit Places using invariants in 1693 ms returned []
[2024-05-26 22:36:13] [INFO ] Invariant cache hit.
[2024-05-26 22:36:16] [INFO ] Implicit Places using invariants and state equation in 3366 ms returned []
Implicit Place search using SMT with State Equation took 5062 ms to find 0 implicit places.
[2024-05-26 22:36:16] [INFO ] Invariant cache hit.
[2024-05-26 22:36:17] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5693 ms. Remains : 1891/1891 places, 353/353 transitions.
Built C files in :
/tmp/ltsmin14540571282279589316
[2024-05-26 22:36:17] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14540571282279589316
Running compilation step : cd /tmp/ltsmin14540571282279589316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1244 ms.
Running link step : cd /tmp/ltsmin14540571282279589316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14540571282279589316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9146498905744732606.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 22:36:32] [INFO ] Flatten gal took : 37 ms
[2024-05-26 22:36:32] [INFO ] Flatten gal took : 37 ms
[2024-05-26 22:36:32] [INFO ] Time to serialize gal into /tmp/LTL3489602089802263438.gal : 5 ms
[2024-05-26 22:36:32] [INFO ] Time to serialize properties into /tmp/LTL2402165766921600145.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3489602089802263438.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3505342618807204575.hoa' '-atoms' '/tmp/LTL2402165766921600145.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2402165766921600145.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3505342618807204575.hoa
Detected timeout of ITS tools.
[2024-05-26 22:36:47] [INFO ] Flatten gal took : 39 ms
[2024-05-26 22:36:47] [INFO ] Flatten gal took : 39 ms
[2024-05-26 22:36:47] [INFO ] Time to serialize gal into /tmp/LTL7767241846179506217.gal : 5 ms
[2024-05-26 22:36:47] [INFO ] Time to serialize properties into /tmp/LTL16238325795105575635.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7767241846179506217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16238325795105575635.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(("(((((((n1_16<1)||(Sstart_16<1))&&((n1_8<1)||(Sstart_8<1)))&&(((n1_21<1)||(Sstart_21<1))&&((n1_10<1)||(Sstart_10<1))))&&((((n1_...8406
Formula 0 simplified : F(!"(((((((n1_16<1)||(Sstart_16<1))&&((n1_8<1)||(Sstart_8<1)))&&(((n1_21<1)||(Sstart_21<1))&&((n1_10<1)||(Sstart_10<1))))&&((((n1_14...8392
Detected timeout of ITS tools.
[2024-05-26 22:37:02] [INFO ] Flatten gal took : 40 ms
[2024-05-26 22:37:02] [INFO ] Applying decomposition
[2024-05-26 22:37:02] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4143549818013627690.txt' '-o' '/tmp/graph4143549818013627690.bin' '-w' '/tmp/graph4143549818013627690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4143549818013627690.bin' '-l' '-1' '-v' '-w' '/tmp/graph4143549818013627690.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:37:02] [INFO ] Decomposing Gal with order
[2024-05-26 22:37:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:37:02] [INFO ] Removed a total of 230 redundant transitions.
[2024-05-26 22:37:02] [INFO ] Flatten gal took : 109 ms
[2024-05-26 22:37:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 49 ms.
[2024-05-26 22:37:02] [INFO ] Time to serialize gal into /tmp/LTL8248564561424645425.gal : 17 ms
[2024-05-26 22:37:03] [INFO ] Time to serialize properties into /tmp/LTL2085230738896128846.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8248564561424645425.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2085230738896128846.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G(("(((((((i6.u87.n1_16<1)||(i6.u40.Sstart_16<1))&&((i28.u92.n1_8<1)||(i28.u81.Sstart_8<1)))&&(((i32.u44.n1_21<1)||(i32.u89.Sstart...13259
Formula 0 simplified : F(!"(((((((i6.u87.n1_16<1)||(i6.u40.Sstart_16<1))&&((i28.u92.n1_8<1)||(i28.u81.Sstart_8<1)))&&(((i32.u44.n1_21<1)||(i32.u89.Sstart_2...13245
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12820146659514066967
[2024-05-26 22:37:18] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12820146659514066967
Running compilation step : cd /tmp/ltsmin12820146659514066967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1285 ms.
Running link step : cd /tmp/ltsmin12820146659514066967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12820146659514066967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](((LTLAPp0==true)||[]((LTLAPp1==true))))&&X(X([]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-11 finished in 127418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(p0) U (X(G(!p2))||p1)))))'
[2024-05-26 22:37:33] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8737529028590158187
[2024-05-26 22:37:33] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2024-05-26 22:37:33] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:37:33] [INFO ] Applying decomposition
[2024-05-26 22:37:33] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2024-05-26 22:37:33] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:37:33] [INFO ] Flatten gal took : 41 ms
[2024-05-26 22:37:33] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2024-05-26 22:37:33] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:37:33] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8737529028590158187
Running compilation step : cd /tmp/ltsmin8737529028590158187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1539469645546616634.txt' '-o' '/tmp/graph1539469645546616634.bin' '-w' '/tmp/graph1539469645546616634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1539469645546616634.bin' '-l' '-1' '-v' '-w' '/tmp/graph1539469645546616634.weights' '-q' '0' '-e' '0.001'
[2024-05-26 22:37:33] [INFO ] Decomposing Gal with order
[2024-05-26 22:37:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:37:33] [INFO ] Removed a total of 229 redundant transitions.
[2024-05-26 22:37:33] [INFO ] Flatten gal took : 107 ms
[2024-05-26 22:37:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 40 ms.
[2024-05-26 22:37:33] [INFO ] Time to serialize gal into /tmp/LTLFireability10798313123624343541.gal : 16 ms
[2024-05-26 22:37:33] [INFO ] Time to serialize properties into /tmp/LTLFireability4552829187031835667.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10798313123624343541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4552829187031835667.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((G((!("(((((((i4.i1.u59.n1_16>=1)&&(i4.i1.u107.Sstart_16>=1))||((i17.u66.n1_8>=1)&&(i17.u55.Sstart_8>=1)))||(((i21.u73.n1_21>=1)&&(...15177
Formula 0 simplified : F("(((((((i4.i1.u59.n1_16>=1)&&(i4.i1.u107.Sstart_16>=1))||((i17.u66.n1_8>=1)&&(i17.u55.Sstart_8>=1)))||(((i21.u73.n1_21>=1)&&(i21.u...15155
Compilation finished in 1497 ms.
Running link step : cd /tmp/ltsmin8737529028590158187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8737529028590158187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((!(LTLAPp0==true)||[](!(LTLAPp1==true))))&&X(X([](!(LTLAPp2==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.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 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( 2/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: LTL layer: formula: ([]((!(LTLAPp0==true)||[](!(LTLAPp1==true))))&&X(X([](!(LTLAPp2==true)))))
pins2lts-mc-linux64( 1/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.029: "([]((!(LTLAPp0==true)||[](!(LTLAPp1==true))))&&X(X([](!(LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.029: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.054: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.311: DFS-FIFO for weak LTL, using special progress label 363
pins2lts-mc-linux64( 0/ 8), 0.312: There are 364 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.312: State length is 1917, there are 372 groups
pins2lts-mc-linux64( 0/ 8), 0.312: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.312: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.312: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.312: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.533: ~1 levels ~960 states ~22680 transitions
pins2lts-mc-linux64( 1/ 8), 0.725: ~1 levels ~1920 states ~51080 transitions
pins2lts-mc-linux64( 5/ 8), 0.935: ~1 levels ~3840 states ~93976 transitions
pins2lts-mc-linux64( 1/ 8), 1.411: ~1 levels ~7680 states ~216240 transitions
pins2lts-mc-linux64( 1/ 8), 2.405: ~1 levels ~15360 states ~462856 transitions
pins2lts-mc-linux64( 5/ 8), 3.842: ~1 levels ~30720 states ~872408 transitions
pins2lts-mc-linux64( 5/ 8), 6.889: ~1 levels ~61440 states ~1864472 transitions
pins2lts-mc-linux64( 2/ 8), 12.566: ~1 levels ~122880 states ~3678008 transitions
pins2lts-mc-linux64( 2/ 8), 23.075: ~1 levels ~245760 states ~7668848 transitions
pins2lts-mc-linux64( 5/ 8), 44.640: ~1 levels ~491520 states ~15963264 transitions
pins2lts-mc-linux64( 2/ 8), 90.147: ~1 levels ~983040 states ~32503792 transitions
pins2lts-mc-linux64( 6/ 8), 101.360: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 101.827:
pins2lts-mc-linux64( 0/ 8), 101.827: mean standard work distribution: 9.0% (states) 5.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 101.827:
pins2lts-mc-linux64( 0/ 8), 101.827: Explored 955950 states 35987198 transitions, fanout: 37.645
pins2lts-mc-linux64( 0/ 8), 101.827: Total exploration time 101.490 sec (101.030 sec minimum, 101.253 sec on average)
pins2lts-mc-linux64( 0/ 8), 101.827: States per second: 9419, Transitions per second: 354589
pins2lts-mc-linux64( 0/ 8), 101.827:
pins2lts-mc-linux64( 0/ 8), 101.827: Progress states detected: 9139044
pins2lts-mc-linux64( 0/ 8), 101.827: Redundant explorations: -89.5401
pins2lts-mc-linux64( 0/ 8), 101.827:
pins2lts-mc-linux64( 0/ 8), 101.828: Queue width: 8B, total height: 10140040, memory: 77.36MB
pins2lts-mc-linux64( 0/ 8), 101.828: Tree memory: 325.7MB, 37.4 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 101.828: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 101.828: Stored 359 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 101.828: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 101.828: Est. total memory use: 403.1MB (~1101.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8737529028590158187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((!(LTLAPp0==true)||[](!(LTLAPp1==true))))&&X(X([](!(LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8737529028590158187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((!(LTLAPp0==true)||[](!(LTLAPp1==true))))&&X(X([](!(LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
ITS-tools command line returned an error code 137
[2024-05-26 22:51:45] [INFO ] Applying decomposition
[2024-05-26 22:51:46] [INFO ] Flatten gal took : 250 ms
[2024-05-26 22:51:46] [INFO ] Decomposing Gal with order
[2024-05-26 22:51:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 22:51:47] [INFO ] Removed a total of 206 redundant transitions.
[2024-05-26 22:51:47] [INFO ] Flatten gal took : 599 ms
[2024-05-26 22:51:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 164 ms.
[2024-05-26 22:51:47] [INFO ] Time to serialize gal into /tmp/LTLFireability17748991407437515252.gal : 44 ms
[2024-05-26 22:51:47] [INFO ] Time to serialize properties into /tmp/LTLFireability1801979014467773253.ltl : 24 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17748991407437515252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1801979014467773253.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((G((!("(((((((tsid16.n1_16>=1)&&(tsid16.Sstart_16>=1))||((tsid8.n1_8>=1)&&(tsid8.Sstart_8>=1)))||(((tsid21.n1_21>=1)&&(tsid21.Sstar...15704
Formula 0 simplified : F("(((((((tsid16.n1_16>=1)&&(tsid16.Sstart_16>=1))||((tsid8.n1_8>=1)&&(tsid8.Sstart_8>=1)))||(((tsid21.n1_21>=1)&&(tsid21.Sstart_21>...15682
ITS-tools command line returned an error code 137
[2024-05-26 23:02:36] [INFO ] Flatten gal took : 265 ms
[2024-05-26 23:02:37] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-26 23:02:37] [INFO ] Transformed 1916 places.
[2024-05-26 23:02:37] [INFO ] Transformed 356 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 23:02:37] [INFO ] Time to serialize gal into /tmp/LTLFireability9921714246063762245.gal : 22 ms
[2024-05-26 23:02:37] [INFO ] Time to serialize properties into /tmp/LTLFireability5577821656256333277.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9921714246063762245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5577821656256333277.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G((!("(((((((n1_16>=1)&&(Sstart_16>=1))||((n1_8>=1)&&(Sstart_8>=1)))||(((n1_21>=1)&&(Sstart_21>=1))||((n1_10>=1)&&(Sstart_10>=1)))...9010
Formula 0 simplified : F("(((((((n1_16>=1)&&(Sstart_16>=1))||((n1_8>=1)&&(Sstart_8>=1)))||(((n1_21>=1)&&(Sstart_21>=1))||((n1_10>=1)&&(Sstart_10>=1))))||((...8988
Detected timeout of ITS tools.
Total runtime 3401748 ms.

BK_STOP 1716765944512

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-22"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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