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-171662361300018.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-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361300018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.9K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 04:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:00 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 4.0K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 04:10 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 93K 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-18-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716762285937

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-18
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-26 22:24:47] [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:24:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:24:47] [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:24:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 22:24:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 839 ms
[2024-05-26 22:24:48] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 22:24:48] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-26 22:24:48] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 11 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).
Incomplete random walk after 10000 steps, including 367 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 19) seen :7
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 131 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 26 rows 30 cols
[2024-05-26 22:24:49] [INFO ] Computed 5 invariants in 7 ms
[2024-05-26 22:24:49] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-26 22:24:49] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:10
[2024-05-26 22:24:49] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:10
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-26 22:24:49] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:10
[2024-05-26 22:24:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-26 22:24:50] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2024-05-26 22:24:50] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-26 22:24:50] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
Fused 12 Parikh solutions to 9 different solutions.
Finished Parikh walk after 74 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=74 )
Parikh walk visited 10 properties in 7 ms.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 26/26 transitions.
Graph (complete) has 50 edges and 30 vertex of which 24 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 24 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 23 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 23 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 22 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 22 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 21 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 20 transition count 18
Applied a total of 12 rules in 14 ms. Remains 20 /30 variables (removed 10) and now considering 18/26 (removed 8) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-26 22:24:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-26 22:24:50] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 20/30 places, 18/26 transitions.
Finished random walk after 298 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=149 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-26 22:24:50] [INFO ] Flatten gal took : 35 ms
[2024-05-26 22:24:50] [INFO ] Flatten gal took : 5 ms
Domain [tsid(19), tsid(19)] of place n9 breaks symmetries in sort tsid
[2024-05-26 22:24:50] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 51 ms.
[2024-05-26 22:24:50] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 955 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1356 transition count 296
Applied a total of 42 rules in 69 ms. Remains 1356 /1398 variables (removed 42) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-05-26 22:24:50] [INFO ] Computed 1062 invariants in 73 ms
[2024-05-26 22:24:51] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2024-05-26 22:24:51] [INFO ] Invariant cache hit.
[2024-05-26 22:24:53] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 2462 ms to find 0 implicit places.
[2024-05-26 22:24:53] [INFO ] Invariant cache hit.
[2024-05-26 22:24:53] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1356/1398 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2979 ms. Remains : 1356/1398 places, 296/296 transitions.
Support contains 955 out of 1356 places after structural reductions.
[2024-05-26 22:24:53] [INFO ] Flatten gal took : 92 ms
[2024-05-26 22:24:53] [INFO ] Flatten gal took : 72 ms
[2024-05-26 22:24:53] [INFO ] Input system was already deterministic with 296 transitions.
Incomplete random walk after 10000 steps, including 440 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) seen :0
Running SMT prover for 17 properties.
[2024-05-26 22:24:54] [INFO ] Invariant cache hit.
[2024-05-26 22:24:55] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 168 ms returned sat
[2024-05-26 22:24:55] [INFO ] After 771ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-26 22:24:56] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 165 ms returned sat
[2024-05-26 22:24:59] [INFO ] After 2743ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2024-05-26 22:25:02] [INFO ] After 5554ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 1768 ms.
[2024-05-26 22:25:04] [INFO ] After 8484ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 15 different solutions.
Finished Parikh walk after 140 steps, including 0 resets, run visited all 16 properties in 6 ms. (steps per millisecond=23 )
Parikh walk visited 15 properties in 5 ms.
Support contains 40 out of 1356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1356 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 1355 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 1355 transition count 290
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1354 transition count 290
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 2 with 19 rules applied. Total rules applied 27 place count 1354 transition count 271
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 46 place count 1335 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 1334 transition count 270
Applied a total of 47 rules in 298 ms. Remains 1334 /1356 variables (removed 22) and now considering 270/296 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 1334/1356 places, 270/296 transitions.
Incomplete random walk after 10000 steps, including 439 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2313 steps, run visited all 1 properties in 20 ms. (steps per millisecond=115 )
Probabilistic random walk after 2313 steps, saw 2240 distinct states, run finished after 21 ms. (steps per millisecond=110 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1356 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1356 transition count 296
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((F(p0)||X(G(p1))||(X(p3)&&p2))))'
Support contains 761 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-26 22:25:04] [INFO ] Invariant cache hit.
[2024-05-26 22:25:05] [INFO ] Implicit Places using invariants in 755 ms returned []
[2024-05-26 22:25:05] [INFO ] Invariant cache hit.
[2024-05-26 22:25:07] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 2208 ms to find 0 implicit places.
[2024-05-26 22:25:07] [INFO ] Invariant cache hit.
[2024-05-26 22:25:07] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2657 ms. Remains : 1356/1356 places, 296/296 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 312 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s23 1) (GEQ s42 1) (GEQ s61 1) (GEQ s80 1) (GEQ s99 1) (GEQ s118 1) (GEQ s137 1) (GEQ s156 1) (GEQ s175 1) (GEQ s194 1) (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, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-00 finished in 3069 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((p1||X(p2)))||p0)))'
Support contains 22 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-26 22:25:08] [INFO ] Invariant cache hit.
[2024-05-26 22:25:09] [INFO ] Implicit Places using invariants in 1229 ms returned []
[2024-05-26 22:25:09] [INFO ] Invariant cache hit.
[2024-05-26 22:25:11] [INFO ] Implicit Places using invariants and state equation in 2308 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3557 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3636 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s1216 1)) (AND (GEQ s0 1) (GEQ s1215 1)) (AND (GEQ s0 1) (GEQ s1214 1)) (AND (GEQ s0 1) (GEQ s1213 1)) (AND (GEQ s0 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-01 finished in 3971 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) U p1))'
Support contains 39 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.10 ms
Discarding 20 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1333 transition count 291
Applied a total of 5 rules in 180 ms. Remains 1333 /1356 variables (removed 23) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1333 cols
[2024-05-26 22:25:12] [INFO ] Computed 1044 invariants in 43 ms
[2024-05-26 22:25:13] [INFO ] Implicit Places using invariants in 1502 ms returned []
[2024-05-26 22:25:13] [INFO ] Invariant cache hit.
[2024-05-26 22:25:15] [INFO ] Implicit Places using invariants and state equation in 1989 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3517 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1356 places, 291/296 transitions.
Applied a total of 0 rules in 49 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3749 ms. Remains : 1295/1356 places, 291/296 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s1252 1)) (AND (GEQ s0 1) (GEQ s1253 1)) (AND (GEQ s0 1) (GEQ s1254 1)) (AND (GEQ s0 1) (GEQ s1244 1)) (AND (GEQ s0 1) (GEQ s1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-04 finished in 3888 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(F(p0)))'
Support contains 20 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 30 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-05-26 22:25:15] [INFO ] Computed 1062 invariants in 33 ms
[2024-05-26 22:25:17] [INFO ] Implicit Places using invariants in 1406 ms returned []
[2024-05-26 22:25:17] [INFO ] Invariant cache hit.
[2024-05-26 22:25:19] [INFO ] Implicit Places using invariants and state equation in 2353 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3770 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 31 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3832 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1084 1) (LT s1085 1) (LT s1086 1) (LT s1087 1) (LT s1088 1) (LT s1089 1) (LT s1090 1) (LT s1091 1) (LT s1092 1) (LT s1093 1) (LT s1094 1) (LT ...], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 753 ms.
Product exploration explored 100000 steps with 50000 reset in 742 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-05 finished in 5659 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)&&X((p1||X(!p0)))))'
Support contains 59 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 36 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-26 22:25:21] [INFO ] Invariant cache hit.
[2024-05-26 22:25:22] [INFO ] Implicit Places using invariants in 1184 ms returned []
[2024-05-26 22:25:22] [INFO ] Invariant cache hit.
[2024-05-26 22:25:24] [INFO ] Implicit Places using invariants and state equation in 2173 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3381 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3469 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0), p0, true]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s1216 1)) (OR (LT s0 1) (LT s1215 1)) (OR (LT s0 1) (LT s1214 1)) (OR (LT s0 1) (LT s1213 1)) (OR (LT s0 1) (LT s1204 1)) (OR (L...], nbAcceptance=0, 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-06 finished in 3679 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 21 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Discarding 20 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 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1334 transition count 292
Applied a total of 5 rules in 161 ms. Remains 1334 /1356 variables (removed 22) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1334 cols
[2024-05-26 22:25:25] [INFO ] Computed 1044 invariants in 23 ms
[2024-05-26 22:25:26] [INFO ] Implicit Places using invariants in 1220 ms returned []
[2024-05-26 22:25:26] [INFO ] Invariant cache hit.
[2024-05-26 22:25:28] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned [1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3236 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1315/1356 places, 292/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1315 /1315 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3439 ms. Remains : 1315/1356 places, 292/296 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-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:(AND (LT s1313 1) (OR (AND (GEQ s0 1) (GEQ s1247 1)) (AND (GEQ s0 1) (GEQ s1248 1)) (AND (GEQ s0 1) (GEQ s1249 1)) (AND (GEQ s0 1) (GEQ s1250 1)) (AND ...], 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 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-07 finished in 3501 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||G(p2))))))'
Support contains 439 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 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 2 place count 1355 transition count 295
Applied a total of 2 rules in 60 ms. Remains 1355 /1356 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 1355 cols
[2024-05-26 22:25:28] [INFO ] Computed 1062 invariants in 16 ms
[2024-05-26 22:25:29] [INFO ] Implicit Places using invariants in 1012 ms returned []
[2024-05-26 22:25:29] [INFO ] Invariant cache hit.
[2024-05-26 22:25:31] [INFO ] Implicit Places using invariants and state equation in 1891 ms returned [1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2912 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1336/1356 places, 295/296 transitions.
Applied a total of 0 rules in 27 ms. Remains 1336 /1336 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3000 ms. Remains : 1336/1356 places, 295/296 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s1157 1) (GEQ s1252 1)) (AND (GEQ s1141 1) (GEQ s1236 1)) (AND (GEQ s1144 1) (GEQ s1239 1)) (AND (GEQ s1149 1) (GEQ s1244 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-08 finished in 3171 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(G(p0))&&F(p1))))'
Support contains 39 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 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 1334 transition count 292
Applied a total of 5 rules in 124 ms. Remains 1334 /1356 variables (removed 22) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1334 cols
[2024-05-26 22:25:31] [INFO ] Computed 1044 invariants in 15 ms
[2024-05-26 22:25:33] [INFO ] Implicit Places using invariants in 1455 ms returned []
[2024-05-26 22:25:33] [INFO ] Invariant cache hit.
[2024-05-26 22:25:35] [INFO ] Implicit Places using invariants and state equation in 2219 ms returned [1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3694 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1315/1356 places, 292/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1315 /1315 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3855 ms. Remains : 1315/1356 places, 292/296 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s1173 1) (LT s1211 1)) (OR (LT s1165 1) (LT s1203 1)) (OR (LT s1170 1) (LT s1208 1)) (OR (LT s1172 1) (LT s1210 1)) (OR (LT s1174 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4948 reset in 343 ms.
Product exploration explored 100000 steps with 4941 reset in 424 ms.
Computed a total of 1315 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1315 transition count 292
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 p1), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-09 finished in 4980 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)))'
Support contains 20 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 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 1333 transition count 291
Applied a total of 5 rules in 85 ms. Remains 1333 /1356 variables (removed 23) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1333 cols
[2024-05-26 22:25:36] [INFO ] Computed 1044 invariants in 15 ms
[2024-05-26 22:25:37] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2024-05-26 22:25:37] [INFO ] Invariant cache hit.
[2024-05-26 22:25:39] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3146 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1356 places, 291/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3271 ms. Remains : 1295/1356 places, 291/296 transitions.
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s1178 1)) (OR (LT s0 1) (LT s1177 1)) (OR (LT s0 1) (LT s1176 1)) (OR (LT s0 1) (LT s1175 1)) (OR (LT s0 1) (LT s1166 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-10 finished in 3358 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||X(F(p1))))))'
Support contains 76 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 30 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-05-26 22:25:40] [INFO ] Computed 1062 invariants in 24 ms
[2024-05-26 22:25:41] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2024-05-26 22:25:41] [INFO ] Invariant cache hit.
[2024-05-26 22:25:43] [INFO ] Implicit Places using invariants and state equation in 2237 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3484 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 27 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3541 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s1157 1) (GEQ s1252 1)) (AND (GEQ s1141 1) (GEQ s1236 1)) (AND (GEQ s1144 1) (GEQ s1239 1)) (AND (GEQ s1149 1) (GEQ s1244 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][false, false, false]]
Product exploration explored 100000 steps with 4416 reset in 254 ms.
Product exploration explored 100000 steps with 4418 reset in 265 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
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) p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-11 finished in 4462 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 20 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 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 1333 transition count 291
Applied a total of 5 rules in 80 ms. Remains 1333 /1356 variables (removed 23) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1333 cols
[2024-05-26 22:25:44] [INFO ] Computed 1044 invariants in 15 ms
[2024-05-26 22:25:45] [INFO ] Implicit Places using invariants in 1280 ms returned []
[2024-05-26 22:25:45] [INFO ] Invariant cache hit.
[2024-05-26 22:25:47] [INFO ] Implicit Places using invariants and state equation in 1960 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3281 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1356 places, 291/296 transitions.
Applied a total of 0 rules in 36 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3397 ms. Remains : 1295/1356 places, 291/296 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s1195 1)) (OR (LT s0 1) (LT s1194 1)) (OR (LT s0 1) (LT s1193 1)) (OR (LT s0 1) (LT s1192 1)) (OR (LT s0 1) (LT s1191 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4216 reset in 274 ms.
Product exploration explored 100000 steps with 4205 reset in 295 ms.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-12 finished in 4290 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 U (G(p0)||(X(F(p0))&&p1)))))'
Support contains 40 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 28 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-05-26 22:25:48] [INFO ] Computed 1062 invariants in 24 ms
[2024-05-26 22:25:50] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2024-05-26 22:25:50] [INFO ] Invariant cache hit.
[2024-05-26 22:25:52] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3336 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 28 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3393 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s1084 1) (GEQ s1085 1) (GEQ s1086 1) (GEQ s1087 1) (GEQ s1088 1) (GEQ s1089 1) (GEQ s1090 1) (GEQ s1091 1) (GEQ s1092 1) (GEQ s1093...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 875 ms.
Product exploration explored 100000 steps with 50000 reset in 874 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
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 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-13 finished in 5453 ms.
All properties solved by simple procedures.
Total runtime 66848 ms.

BK_STOP 1716762355632

--------------------
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-18"
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-18, 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-171662361300018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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