Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.6K Feb 26 01:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 26 01:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 61K Mar 5 18:23 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-06-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678912516880

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 20:35:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 20:35:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 20:35:18] [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.
[2023-03-15 20:35:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 20:35:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 658 ms
[2023-03-15 20:35:19] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 20:35:19] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-15 20:35:19] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-10 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 10 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 766 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 19) seen :5
Incomplete Best-First random walk after 10001 steps, including 345 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 263 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 351 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 350 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 346 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 341 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 350 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 338 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 260 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 348 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-15 20:35:20] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-15 20:35:20] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 20:35:20] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-15 20:35:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 20:35:20] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-15 20:35:20] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 20:35:20] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 11 different solutions.
Finished Parikh walk after 34 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 14 properties in 5 ms.
[2023-03-15 20:35:21] [INFO ] Flatten gal took : 22 ms
[2023-03-15 20:35:21] [INFO ] Flatten gal took : 4 ms
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2023-03-15 20:35:21] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 9 ms.
[2023-03-15 20:35:21] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 245 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 7 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-15 20:35:21] [INFO ] Computed 138 place invariants in 11 ms
[2023-03-15 20:35:21] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-15 20:35:21] [INFO ] Invariant cache hit.
[2023-03-15 20:35:21] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-15 20:35:21] [INFO ] Invariant cache hit.
[2023-03-15 20:35:21] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 252/270 places, 116/116 transitions.
Support contains 245 out of 252 places after structural reductions.
[2023-03-15 20:35:21] [INFO ] Flatten gal took : 21 ms
[2023-03-15 20:35:21] [INFO ] Flatten gal took : 27 ms
[2023-03-15 20:35:21] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 244 out of 252 places (down from 245) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 982 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 25) seen :8
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 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 15 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 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 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 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 16 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 17 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 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 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 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-15 20:35:21] [INFO ] Invariant cache hit.
[2023-03-15 20:35:22] [INFO ] [Real]Absence check using 0 positive and 138 generalized place invariants in 17 ms returned sat
[2023-03-15 20:35:22] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-15 20:35:22] [INFO ] [Nat]Absence check using 0 positive and 138 generalized place invariants in 28 ms returned sat
[2023-03-15 20:35:22] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-15 20:35:23] [INFO ] After 673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 234 ms.
[2023-03-15 20:35:23] [INFO ] After 1128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Finished Parikh walk after 54 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 17 properties in 16 ms.
Computed a total of 252 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 252 transition count 116
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||((!p0||G(!p1)) U p2)))'
Support contains 65 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 11 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-15 20:35:23] [INFO ] Invariant cache hit.
[2023-03-15 20:35:23] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-15 20:35:23] [INFO ] Invariant cache hit.
[2023-03-15 20:35:24] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-15 20:35:24] [INFO ] Invariant cache hit.
[2023-03-15 20:35:24] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 434 ms. Remains : 252/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 393 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), true, (NOT p2), p1]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s249 1), p0:(OR (AND (GEQ s99 1) (GEQ s106 1) (GEQ s113 1) (GEQ s120 1) (GEQ s127 1) (GEQ s134 1) (GEQ s141 1) (GEQ s197 1)) (AND (GEQ s105 1) (GE...], 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][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 4 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-00 finished in 887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(!p1 U (p2||G(!p1))))))'
Support contains 29 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 17 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-15 20:35:24] [INFO ] Invariant cache hit.
[2023-03-15 20:35:24] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-15 20:35:24] [INFO ] Invariant cache hit.
[2023-03-15 20:35:24] [INFO ] Implicit Places using invariants and state equation in 216 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 353 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 375 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NOT (OR (AND (GEQ s186 1) (GEQ s200 1)) (AND (GEQ s184 1) (GEQ s198 1)) (AND (GEQ s188 1) (GEQ s202 1)) (AND (GEQ s183 1) (GEQ s197 1)) (AND (GEQ...], 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]]
Product exploration explored 100000 steps with 28798 reset in 264 ms.
Product exploration explored 100000 steps with 28959 reset in 213 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
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 p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (F (G p2)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 418 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 985 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 173 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 116 rows 245 cols
[2023-03-15 20:35:26] [INFO ] Computed 132 place invariants in 15 ms
[2023-03-15 20:35:26] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 15 ms returned sat
[2023-03-15 20:35:26] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 20:35:26] [INFO ] After 59ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 20:35:26] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 20:35:26] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 15 ms returned sat
[2023-03-15 20:35:26] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 20:35:26] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-15 20:35:26] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (F (G p2)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 9 factoid took 486 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 22 out of 245 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 9 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-15 20:35:27] [INFO ] Invariant cache hit.
[2023-03-15 20:35:27] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-15 20:35:27] [INFO ] Invariant cache hit.
[2023-03-15 20:35:27] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-15 20:35:27] [INFO ] Invariant cache hit.
[2023-03-15 20:35:27] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 245/245 places, 116/116 transitions.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
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 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 982 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 20:35:28] [INFO ] Invariant cache hit.
[2023-03-15 20:35:28] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 17 ms returned sat
[2023-03-15 20:35:28] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 20:35:28] [INFO ] After 62ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 20:35:28] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 20:35:28] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 17 ms returned sat
[2023-03-15 20:35:28] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 20:35:28] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-15 20:35:28] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 4 factoid took 300 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 32630 reset in 153 ms.
Product exploration explored 100000 steps with 32693 reset in 163 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 22 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 245 transition count 117
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 35 ms. Remains 245 /245 variables (removed 0) and now considering 117/116 (removed -1) transitions.
[2023-03-15 20:35:29] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 117 rows 245 cols
[2023-03-15 20:35:29] [INFO ] Computed 132 place invariants in 11 ms
[2023-03-15 20:35:29] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/245 places, 117/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 245/245 places, 117/116 transitions.
Support contains 22 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2023-03-15 20:35:29] [INFO ] Computed 132 place invariants in 4 ms
[2023-03-15 20:35:30] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-15 20:35:30] [INFO ] Invariant cache hit.
[2023-03-15 20:35:30] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-15 20:35:30] [INFO ] Invariant cache hit.
[2023-03-15 20:35:30] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 245/245 places, 116/116 transitions.
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-01 finished in 5930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((X(!p0)&&G(p1)))))'
Support contains 15 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-15 20:35:30] [INFO ] Computed 138 place invariants in 4 ms
[2023-03-15 20:35:30] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-15 20:35:30] [INFO ] Invariant cache hit.
[2023-03-15 20:35:30] [INFO ] Implicit Places using invariants and state equation in 199 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 339 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 345 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s238 1)) (AND (GEQ s0 1) (GEQ s232 1)) (AND (GEQ s0 1) (GEQ s233 1)) (AND (GEQ s0 1) (GEQ s234 1)) (AND (GEQ s0 1) (GEQ s235 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 40 steps with 3 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-02 finished in 574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0&&(p1 U p2))) U (p3&&F(G(p4))))))'
Support contains 121 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Reduce places removed 1 places and 1 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 2 place count 250 transition count 114
Applied a total of 2 rules in 19 ms. Remains 250 /252 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 250 cols
[2023-03-15 20:35:31] [INFO ] Computed 138 place invariants in 3 ms
[2023-03-15 20:35:31] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-15 20:35:31] [INFO ] Invariant cache hit.
[2023-03-15 20:35:31] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [183, 184, 185, 186, 187, 188, 189]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 270 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/252 places, 114/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 295 ms. Remains : 243/252 places, 114/116 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p3) (NOT p4)), true, (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p4), (OR (NOT p4) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p3 (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p4)), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=3 dest: 3}], [{ cond=p4, acceptance={} source=4 dest: 4}, { cond=(NOT p4), acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(LT s239 1), p0:(OR (AND (GEQ s1 1) (GEQ s8 1) (GEQ s15 1) (GEQ s22 1) (GEQ s29 1) (GEQ s36 1) (GEQ s43 1) (GEQ s183 1)) (AND (GEQ s7 1) (GEQ s14 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-03 finished in 600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 242 transition count 112
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 242 transition count 112
Applied a total of 4 rules in 25 ms. Remains 242 /252 variables (removed 10) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 242 cols
[2023-03-15 20:35:31] [INFO ] Computed 132 place invariants in 5 ms
[2023-03-15 20:35:31] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-15 20:35:31] [INFO ] Invariant cache hit.
[2023-03-15 20:35:32] [INFO ] Implicit Places using invariants and state equation in 278 ms returned [176, 177, 178, 179, 180, 181, 182, 190, 191, 192, 193, 194, 195, 196]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 544 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/252 places, 112/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 575 ms. Remains : 228/252 places, 112/116 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-04 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 s148 1) (GEQ s197 1)) (AND (GEQ s152 1) (GEQ s201 1)) (AND (GEQ s149 1) (GEQ s198 1)) (AND (GEQ s151 1) (GEQ s200 1)) (AND (GEQ s153 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-04 finished in 640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p1)||p0)))'
Support contains 71 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 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 241 transition count 111
Applied a total of 5 rules in 11 ms. Remains 241 /252 variables (removed 11) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2023-03-15 20:35:32] [INFO ] Computed 132 place invariants in 2 ms
[2023-03-15 20:35:32] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-15 20:35:32] [INFO ] Invariant cache hit.
[2023-03-15 20:35:32] [INFO ] Implicit Places using invariants and state equation in 173 ms returned [176, 177, 178, 179, 180, 181, 182]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 285 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/252 places, 111/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 234 /234 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 304 ms. Remains : 234/252 places, 111/116 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s214 1) (GEQ s213 1) (GEQ s212 1) (GEQ s211 1) (GEQ s217 1) (GEQ s216 1) (GEQ s215 1)), p1:(OR (AND (GEQ s99 1) (GEQ s106 1) (GEQ s113 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14796 reset in 282 ms.
Product exploration explored 100000 steps with 14782 reset in 258 ms.
Computed a total of 234 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 234 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-05 finished in 1109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-15 20:35:33] [INFO ] Computed 138 place invariants in 2 ms
[2023-03-15 20:35:33] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-15 20:35:33] [INFO ] Invariant cache hit.
[2023-03-15 20:35:33] [INFO ] Implicit Places using invariants and state equation in 193 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 330 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 336 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-07 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 (AND (GEQ s0 1) (GEQ s222 1)) (AND (GEQ s0 1) (GEQ s223 1)) (AND (GEQ s0 1) (GEQ s224 1)) (AND (GEQ s0 1) (GEQ s218 1)) (AND (GEQ s0 1) (GEQ s219 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-07 finished in 430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||((p1||G(p0))&&p2))))'
Support contains 16 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 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 242 transition count 112
Applied a total of 5 rules in 25 ms. Remains 242 /252 variables (removed 10) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 242 cols
[2023-03-15 20:35:33] [INFO ] Computed 132 place invariants in 4 ms
[2023-03-15 20:35:33] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-15 20:35:33] [INFO ] Invariant cache hit.
[2023-03-15 20:35:34] [INFO ] Implicit Places using invariants and state equation in 173 ms returned [190, 191, 192, 193, 194, 195, 196]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 313 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/252 places, 112/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 344 ms. Remains : 235/252 places, 112/116 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p2:(AND (OR (LT s0 1) (LT s190 1)) (OR (LT s0 1) (LT s191 1)) (OR (LT s0 1) (LT s192 1)) (OR (LT s0 1) (LT s193 1)) (OR (LT s0 1) (LT s194 1)) (OR (LT s0 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-08 finished in 398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G((!p0||G(p1)))||(!p2&&(!p0||G(p1)))))))'
Support contains 65 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-15 20:35:34] [INFO ] Computed 138 place invariants in 2 ms
[2023-03-15 20:35:34] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-15 20:35:34] [INFO ] Invariant cache hit.
[2023-03-15 20:35:34] [INFO ] Implicit Places using invariants and state equation in 172 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 285 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 290 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GEQ s234 1) (GEQ s235 1) (GEQ s236 1) (GEQ s237 1) (GEQ s232 1) (GEQ s233 1) (GEQ s238 1)), p1:(AND (GEQ s239 1) (OR (AND (GEQ s57 1) (GEQ s58 1) ...], 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 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
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 (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1) (NOT p2))
Knowledge based reduction with 12 factoid took 328 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-09 finished in 1179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F(p1)&&X(p0))))'
Support contains 22 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-15 20:35:35] [INFO ] Invariant cache hit.
[2023-03-15 20:35:35] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-15 20:35:35] [INFO ] Invariant cache hit.
[2023-03-15 20:35:35] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 330 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 338 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, true, true, (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s186 1) (LT s200 1)) (OR (LT s184 1) (LT s198 1)) (OR (LT s188 1) (LT s202 1)) (OR (LT s183 1) (LT s197 1)) (OR (LT s185 1) (LT s199 1)) (...], 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]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-11 finished in 601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(!p1)))'
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-15 20:35:35] [INFO ] Invariant cache hit.
[2023-03-15 20:35:36] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-15 20:35:36] [INFO ] Invariant cache hit.
[2023-03-15 20:35:36] [INFO ] Implicit Places using invariants and state equation in 184 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 346 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 349 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) p1), p1, (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s239 1), p1:(OR (AND (GEQ s0 1) (GEQ s197 1)) (AND (GEQ s0 1) (GEQ s198 1)) (AND (GEQ s0 1) (GEQ s199 1)) (AND (GEQ s0 1) (GEQ s200 1)) (AND (GEQ s...], nbAcceptance=0, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-12 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U !p0))'
Support contains 8 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 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 241 transition count 111
Applied a total of 5 rules in 22 ms. Remains 241 /252 variables (removed 11) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2023-03-15 20:35:36] [INFO ] Computed 132 place invariants in 2 ms
[2023-03-15 20:35:36] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-15 20:35:36] [INFO ] Invariant cache hit.
[2023-03-15 20:35:36] [INFO ] Implicit Places using invariants and state equation in 176 ms returned [176, 177, 178, 179, 180, 181, 182, 190, 191, 192, 193, 194, 195, 196]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 302 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/252 places, 111/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 329 ms. Remains : 227/252 places, 111/116 transitions.
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s192 1)) (OR (LT s0 1) (LT s193 1)) (OR (LT s0 1) (LT s194 1)) (OR (LT s0 1) (LT s195 1)) (OR (LT s0 1) (LT s196 1)) (OR (LT s0 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-13 finished in 406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p0&&G(F(!p1))))))'
Support contains 16 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-15 20:35:36] [INFO ] Computed 138 place invariants in 5 ms
[2023-03-15 20:35:36] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-15 20:35:36] [INFO ] Invariant cache hit.
[2023-03-15 20:35:37] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 307 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 311 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) p1), p1, p1]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-14 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=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s162 1) (LT s163 1) (LT s164 1) (LT s165 1) (LT s166 1) (LT s167 1) (LT s168 1) (LT s241 1)), p1:(AND (OR (LT s0 1) (LT s206 1)) (OR (LT s0 1) ...], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9826 reset in 106 ms.
Product exploration explored 100000 steps with 9831 reset in 109 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
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), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 982 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 171 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 195 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 116 rows 245 cols
[2023-03-15 20:35:38] [INFO ] Computed 132 place invariants in 9 ms
[2023-03-15 20:35:38] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 16 ms returned sat
[2023-03-15 20:35:38] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-15 20:35:38] [INFO ] After 86ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 20:35:38] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 20:35:38] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 14 ms returned sat
[2023-03-15 20:35:38] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 20:35:38] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-15 20:35:38] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 18 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 322 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Support contains 16 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-15 20:35:39] [INFO ] Invariant cache hit.
[2023-03-15 20:35:39] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-15 20:35:39] [INFO ] Invariant cache hit.
[2023-03-15 20:35:39] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-15 20:35:39] [INFO ] Invariant cache hit.
[2023-03-15 20:35:39] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 245/245 places, 116/116 transitions.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
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), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 290 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 983 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 174 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 194 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 20:35:40] [INFO ] Invariant cache hit.
[2023-03-15 20:35:40] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 15 ms returned sat
[2023-03-15 20:35:40] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-15 20:35:40] [INFO ] After 80ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 20:35:40] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 20:35:40] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 14 ms returned sat
[2023-03-15 20:35:40] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 20:35:40] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-15 20:35:40] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 19 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 509 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 9835 reset in 100 ms.
Product exploration explored 100000 steps with 9836 reset in 140 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Support contains 16 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Graph (complete) has 677 edges and 245 vertex of which 237 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 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 237 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 15 ms. Remains 237 /245 variables (removed 8) and now considering 115/116 (removed 1) transitions.
[2023-03-15 20:35:41] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 115 rows 237 cols
[2023-03-15 20:35:41] [INFO ] Computed 126 place invariants in 8 ms
[2023-03-15 20:35:41] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 237/245 places, 115/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 237/245 places, 115/116 transitions.
Support contains 16 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2023-03-15 20:35:41] [INFO ] Computed 132 place invariants in 5 ms
[2023-03-15 20:35:42] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-15 20:35:42] [INFO ] Invariant cache hit.
[2023-03-15 20:35:42] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-15 20:35:42] [INFO ] Invariant cache hit.
[2023-03-15 20:35:42] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 245/245 places, 116/116 transitions.
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-14 finished in 5520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))&&F(G(!p2)))))'
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-15 20:35:42] [INFO ] Computed 138 place invariants in 2 ms
[2023-03-15 20:35:42] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-15 20:35:42] [INFO ] Invariant cache hit.
[2023-03-15 20:35:42] [INFO ] Implicit Places using invariants and state equation in 208 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 342 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 351 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1)), p2, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s240 1), p2:(LT s239 1), p1:(OR (GEQ s234 1) (GEQ s235 1) (GEQ s236 1) (GEQ s237 1) (GEQ s232 1) (GEQ s233 1) (GEQ s238 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-15 finished in 492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(!p1 U (p2||G(!p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p0&&G(F(!p1))))))'
[2023-03-15 20:35:43] [INFO ] Flatten gal took : 13 ms
[2023-03-15 20:35:43] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 20:35:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 252 places, 116 transitions and 590 arcs took 2 ms.
Total runtime 24769 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-COL-06
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/363
LTLFireability

FORMULA QuasiCertifProtocol-COL-06-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-LTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678912544771

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/363/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/363/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/363/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 8 (type EXCL) for 7 QuasiCertifProtocol-COL-06-LTLFireability-14
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for QuasiCertifProtocol-COL-06-LTLFireability-14
lola: result : false
lola: markings : 64
lola: fired transitions : 64
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 5 (type EXCL) for 0 QuasiCertifProtocol-COL-06-LTLFireability-01
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 5 (type EXCL) for QuasiCertifProtocol-COL-06-LTLFireability-01
lola: result : true
lola: markings : 16392
lola: fired transitions : 83855
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 3 (type EXCL) for 0 QuasiCertifProtocol-COL-06-LTLFireability-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 3 (type EXCL) for QuasiCertifProtocol-COL-06-LTLFireability-01
lola: result : true
lola: markings : 45
lola: fired transitions : 72
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-06-LTLFireability-01: CONJ true CONJ
QuasiCertifProtocol-COL-06-LTLFireability-14: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is QuasiCertifProtocol-COL-06, 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 r295-tall-167873948400812"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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