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.r297-tall-167873951000836.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 ltsminxred
Input is QuasiCertifProtocol-COL-22, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873951000836
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:26 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.9K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K 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 104K 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-22-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679660960298

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 12:29:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 12:29:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 12:29:22] [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-24 12:29:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 12:29:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 600 ms
[2023-03-24 12:29:22] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-24 12:29:23] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-24 12:29:23] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-09 TRUE 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 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 296 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 12:29:23] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-24 12:29:23] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-24 12:29:24] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-24 12:29:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-24 12:29:24] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-24 12:29:24] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-24 12:29:24] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=20 )
Parikh walk visited 3 properties in 3 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2023-03-24 12:29:24] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-24 12:29:24] [INFO ] Flatten gal took : 32 ms
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 12:29:24] [INFO ] Flatten gal took : 6 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2023-03-24 12:29:24] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 24 ms.
[2023-03-24 12:29:24] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 1824 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 23 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-24 12:29:24] [INFO ] Computed 1562 place invariants in 96 ms
[2023-03-24 12:29:25] [INFO ] Implicit Places using invariants in 780 ms returned []
[2023-03-24 12:29:25] [INFO ] Invariant cache hit.
[2023-03-24 12:29:26] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
[2023-03-24 12:29:26] [INFO ] Invariant cache hit.
[2023-03-24 12:29:27] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2784 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 1824 out of 1916 places after structural reductions.
[2023-03-24 12:29:27] [INFO ] Flatten gal took : 126 ms
[2023-03-24 12:29:27] [INFO ] Flatten gal took : 90 ms
[2023-03-24 12:29:27] [INFO ] Input system was already deterministic with 356 transitions.
Incomplete random walk after 10000 steps, including 370 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-24 12:29:29] [INFO ] Invariant cache hit.
[2023-03-24 12:29:30] [INFO ] [Real]Absence check using 0 positive and 1562 generalized place invariants in 322 ms returned sat
[2023-03-24 12:29:30] [INFO ] After 1312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-24 12:29:31] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 326 ms returned sat
[2023-03-24 12:29:37] [INFO ] After 5056ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-03-24 12:29:40] [INFO ] After 8572ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 2899 ms.
[2023-03-24 12:29:43] [INFO ] After 12893ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
Fused 13 Parikh solutions to 12 different solutions.
Finished Parikh walk after 173 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=34 )
Parikh walk visited 12 properties in 37 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))&&(F(p0) U p2)))))'
Support contains 25 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 263 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-24 12:29:44] [INFO ] Invariant cache hit.
[2023-03-24 12:29:46] [INFO ] Implicit Places using invariants in 2508 ms returned []
[2023-03-24 12:29:46] [INFO ] Invariant cache hit.
[2023-03-24 12:29:51] [INFO ] Implicit Places using invariants and state equation in 4499 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7017 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 73 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7357 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (LT s1825 1) (LT s1824 1) (LT s1823 1) (LT s1822 1) (LT s1829 1) (LT s1828 1) (LT s1827 1) (LT s1826 1) (LT s1821 1) (LT s1820 1) (LT s1819 1) (LT...], 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 25 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-00 finished in 7867 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' '!((p0 U (G(p1) U p2)))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.21 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
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 1891 transition count 353
Applied a total of 4 rules in 323 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2023-03-24 12:29:52] [INFO ] Computed 1540 place invariants in 54 ms
[2023-03-24 12:29:54] [INFO ] Implicit Places using invariants in 2498 ms returned []
[2023-03-24 12:29:54] [INFO ] Invariant cache hit.
[2023-03-24 12:29:58] [INFO ] Implicit Places using invariants and state equation in 4188 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6690 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1868/1916 places, 353/356 transitions.
Applied a total of 0 rules in 97 ms. Remains 1868 /1868 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7111 ms. Remains : 1868/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(AND (GEQ s1611 1) (GEQ s1612 1) (GEQ s1613 1) (GEQ s1614 1) (GEQ s1615 1) (GEQ s1616 1) (GEQ s1617 1) (GEQ s1618 1) (GEQ s1619 1) (GEQ s1620 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-01 finished in 7273 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)))'
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 42 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-24 12:29:59] [INFO ] Computed 1562 place invariants in 42 ms
[2023-03-24 12:30:01] [INFO ] Implicit Places using invariants in 2007 ms returned []
[2023-03-24 12:30:01] [INFO ] Invariant cache hit.
[2023-03-24 12:30:04] [INFO ] Implicit Places using invariants and state equation in 3557 ms returned []
Implicit Place search using SMT with State Equation took 5567 ms to find 0 implicit places.
[2023-03-24 12:30:04] [INFO ] Invariant cache hit.
[2023-03-24 12:30:05] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6366 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (OR (LT s0 1) (LT s1841 1)) (OR (LT s0 1) (LT s1842 1)) (OR (LT s0 1) (LT s1843 1)) (OR (LT s0 1) (LT s1844 1)) (OR (LT s0 1) (LT s1845 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3715 reset in 597 ms.
Product exploration explored 100000 steps with 3717 reset in 582 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1855 steps, run visited all 1 properties in 17 ms. (steps per millisecond=109 )
Probabilistic random walk after 1855 steps, saw 1806 distinct states, run finished after 18 ms. (steps per millisecond=103 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 39 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-24 12:30:07] [INFO ] Invariant cache hit.
[2023-03-24 12:30:09] [INFO ] Implicit Places using invariants in 1944 ms returned []
[2023-03-24 12:30:09] [INFO ] Invariant cache hit.
[2023-03-24 12:30:13] [INFO ] Implicit Places using invariants and state equation in 3524 ms returned []
Implicit Place search using SMT with State Equation took 5473 ms to find 0 implicit places.
[2023-03-24 12:30:13] [INFO ] Invariant cache hit.
[2023-03-24 12:30:14] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6251 ms. Remains : 1916/1916 places, 356/356 transitions.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1855 steps, run visited all 1 properties in 12 ms. (steps per millisecond=154 )
Probabilistic random walk after 1855 steps, saw 1806 distinct states, run finished after 12 ms. (steps per millisecond=154 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3718 reset in 512 ms.
Product exploration explored 100000 steps with 3713 reset in 551 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.11 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1892 transition count 356
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 219 ms. Remains 1892 /1916 variables (removed 24) and now considering 356/356 (removed 0) transitions.
[2023-03-24 12:30:17] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 356 rows 1892 cols
[2023-03-24 12:30:17] [INFO ] Computed 1540 place invariants in 24 ms
[2023-03-24 12:30:17] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1892/1916 places, 356/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1059 ms. Remains : 1892/1916 places, 356/356 transitions.
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 39 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-24 12:30:17] [INFO ] Computed 1562 place invariants in 25 ms
[2023-03-24 12:30:19] [INFO ] Implicit Places using invariants in 1994 ms returned []
[2023-03-24 12:30:19] [INFO ] Invariant cache hit.
[2023-03-24 12:30:23] [INFO ] Implicit Places using invariants and state equation in 3605 ms returned []
Implicit Place search using SMT with State Equation took 5609 ms to find 0 implicit places.
[2023-03-24 12:30:23] [INFO ] Invariant cache hit.
[2023-03-24 12:30:24] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6358 ms. Remains : 1916/1916 places, 356/356 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-03 finished in 25315 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)))'
Support contains 1 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 86 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-24 12:30:24] [INFO ] Invariant cache hit.
[2023-03-24 12:30:27] [INFO ] Implicit Places using invariants in 2560 ms returned []
[2023-03-24 12:30:27] [INFO ] Invariant cache hit.
[2023-03-24 12:30:31] [INFO ] Implicit Places using invariants and state equation in 4694 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7260 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 76 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7439 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s1888 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3716 reset in 335 ms.
Product exploration explored 100000 steps with 3710 reset in 288 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1803 steps, run visited all 1 properties in 7 ms. (steps per millisecond=257 )
Probabilistic random walk after 1803 steps, saw 1756 distinct states, run finished after 7 ms. (steps per millisecond=257 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0]
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 75 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2023-03-24 12:30:33] [INFO ] Computed 1540 place invariants in 140 ms
[2023-03-24 12:30:36] [INFO ] Implicit Places using invariants in 2513 ms returned []
[2023-03-24 12:30:36] [INFO ] Invariant cache hit.
[2023-03-24 12:30:40] [INFO ] Implicit Places using invariants and state equation in 4759 ms returned []
Implicit Place search using SMT with State Equation took 7281 ms to find 0 implicit places.
[2023-03-24 12:30:40] [INFO ] Invariant cache hit.
[2023-03-24 12:30:41] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8057 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1803 steps, run visited all 1 properties in 8 ms. (steps per millisecond=225 )
Probabilistic random walk after 1803 steps, saw 1756 distinct states, run finished after 8 ms. (steps per millisecond=225 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 100 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Product exploration explored 100000 steps with 3717 reset in 249 ms.
Product exploration explored 100000 steps with 3711 reset in 270 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 88 ms :[true, p0, p0]
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 144 are kept as prefixes of interest. Removing 1749 places using SCC suffix rule.5 ms
Discarding 1749 places :
Also discarding 140 output transitions
Drop transitions removed 140 transitions
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 144 transition count 101
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 1 with 1 rules applied. Total rules applied 117 place count 144 transition count 102
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 117 rules in 19 ms. Remains 144 /1893 variables (removed 1749) and now considering 102/356 (removed 254) transitions.
[2023-03-24 12:30:43] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 102 rows 144 cols
[2023-03-24 12:30:43] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-24 12:30:43] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/1893 places, 102/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 144/1893 places, 102/356 transitions.
Support contains 1 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 264 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2023-03-24 12:30:44] [INFO ] Computed 1540 place invariants in 126 ms
[2023-03-24 12:30:46] [INFO ] Implicit Places using invariants in 2609 ms returned []
[2023-03-24 12:30:46] [INFO ] Invariant cache hit.
[2023-03-24 12:30:50] [INFO ] Implicit Places using invariants and state equation in 4416 ms returned []
Implicit Place search using SMT with State Equation took 7031 ms to find 0 implicit places.
[2023-03-24 12:30:51] [INFO ] Invariant cache hit.
[2023-03-24 12:30:51] [INFO ] Dead Transitions using invariants and state equation in 779 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8076 ms. Remains : 1893/1893 places, 356/356 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-04 finished in 27482 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 p1))'
Support contains 25 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 143 are kept as prefixes of interest. Removing 1773 places using SCC suffix rule.4 ms
Discarding 1773 places :
Also discarding 142 output transitions
Drop transitions removed 142 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 142 transition count 99
Applied a total of 115 rules in 13 ms. Remains 142 /1916 variables (removed 1774) and now considering 99/356 (removed 257) transitions.
// Phase 1: matrix 99 rows 142 cols
[2023-03-24 12:30:51] [INFO ] Computed 44 place invariants in 0 ms
[2023-03-24 12:30:51] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-24 12:30:51] [INFO ] Invariant cache hit.
[2023-03-24 12:30:52] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 220 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/1916 places, 99/356 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 236 ms. Remains : 119/1916 places, 99/356 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s117 1) (AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-06 finished in 332 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((G((F(p0)||X(F(p1))))||(p2&&X((F(p0)||X(F(p1))))))))))'
Support contains 48 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 71 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-24 12:30:52] [INFO ] Computed 1562 place invariants in 32 ms
[2023-03-24 12:30:54] [INFO ] Implicit Places using invariants in 2457 ms returned []
[2023-03-24 12:30:54] [INFO ] Invariant cache hit.
[2023-03-24 12:30:58] [INFO ] Implicit Places using invariants and state equation in 4062 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6522 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 65 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6659 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(LT s1891 1), p0:(AND (OR (LT s0 1) (LT s1781 1)) (OR (LT s0 1) (LT s1780 1)) (OR (LT s0 1) (LT s1779 1)) (OR (LT s0 1) (LT s1778 1)) (OR (LT s0 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23782 reset in 707 ms.
Product exploration explored 100000 steps with 23835 reset in 677 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p0 p1), (F (G p2)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-08 finished in 8772 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((p0||X((F(p2)||p1))))))'
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 39 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-24 12:31:00] [INFO ] Invariant cache hit.
[2023-03-24 12:31:02] [INFO ] Implicit Places using invariants in 1888 ms returned []
[2023-03-24 12:31:02] [INFO ] Invariant cache hit.
[2023-03-24 12:31:05] [INFO ] Implicit Places using invariants and state equation in 2994 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 4887 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 34 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4961 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p0:(AND (GEQ s1634 1) (GEQ s1635 1) (GEQ s1636 1) (GEQ s1637 1) (GEQ s1638 1) (GEQ s1639 1) (GEQ s1640 1) (GEQ s1641 1) (GEQ s1642 1) (GEQ s1643 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 25 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-11 finished in 5176 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)&&F(G(p1)))) U p2))'
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Applied a total of 3 rules in 90 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2023-03-24 12:31:06] [INFO ] Computed 1540 place invariants in 21 ms
[2023-03-24 12:31:07] [INFO ] Implicit Places using invariants in 1717 ms returned []
[2023-03-24 12:31:07] [INFO ] Invariant cache hit.
[2023-03-24 12:31:10] [INFO ] Implicit Places using invariants and state equation in 2619 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 4339 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1868/1916 places, 353/356 transitions.
Applied a total of 0 rules in 57 ms. Remains 1868 /1868 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4486 ms. Remains : 1868/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), p0, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s1696 1) (GEQ s1742 1)) (AND (GEQ s1688 1) (GEQ s1734 1)) (AND (GEQ s1701 1) (GEQ s1747 1)) (AND (GEQ s1690 1) (GEQ s1736 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-12 finished in 4650 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(X(X(F(p0))))))'
Support contains 24 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 66 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-24 12:31:10] [INFO ] Computed 1562 place invariants in 30 ms
[2023-03-24 12:31:13] [INFO ] Implicit Places using invariants in 2493 ms returned []
[2023-03-24 12:31:13] [INFO ] Invariant cache hit.
[2023-03-24 12:31:17] [INFO ] Implicit Places using invariants and state equation in 3901 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6397 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 66 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6529 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (OR (LT s0 1) (LT s1739 1)) (OR (LT s0 1) (LT s1740 1)) (OR (LT s0 1) (LT s1737 1)) (OR (LT s0 1) (LT s1738 1)) (OR (LT s0 1) (LT s1735 1)) (OR (L...], 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]]
Product exploration explored 100000 steps with 20000 reset in 571 ms.
Product exploration explored 100000 steps with 20000 reset in 583 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-13 finished in 8284 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)&&G((X(p1)&&F((!p2&&X(G((!p2||G(!p3))))))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 63 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-24 12:31:19] [INFO ] Invariant cache hit.
[2023-03-24 12:31:21] [INFO ] Implicit Places using invariants in 2467 ms returned []
[2023-03-24 12:31:21] [INFO ] Invariant cache hit.
[2023-03-24 12:31:26] [INFO ] Implicit Places using invariants and state equation in 4522 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6995 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 73 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7132 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p1) p2 p0), p0, (OR (NOT p1) p2), p2, (AND p2 p3), true, (AND p2 p3), (AND p2 p3)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={0, 1} source=3 dest: 3}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND p2 p3), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={1} source=4 dest: 6}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND p2 p3), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={1} source=6 dest: 7}], [{ cond=(AND p2 p3), acceptance={0, 1} source=7 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0} source=7 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s1677 1) (GEQ s1792 1)) (AND (GEQ s1661 1) (GEQ s1776 1)) (AND (GEQ s1664 1) (GEQ s1779 1)) (AND (GEQ s1669 1) (GEQ s1784 1)) (AND (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3710 reset in 341 ms.
Product exploration explored 100000 steps with 3711 reset in 346 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1041 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1855 steps, run visited all 1 properties in 9 ms. (steps per millisecond=206 )
Probabilistic random walk after 1855 steps, saw 1806 distinct states, run finished after 9 ms. (steps per millisecond=206 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p3)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 24 factoid took 895 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (NOT p1)]
Support contains 23 out of 1893 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2023-03-24 12:31:29] [INFO ] Computed 1540 place invariants in 127 ms
[2023-03-24 12:31:32] [INFO ] Implicit Places using invariants in 2465 ms returned []
[2023-03-24 12:31:32] [INFO ] Invariant cache hit.
[2023-03-24 12:31:36] [INFO ] Implicit Places using invariants and state equation in 4552 ms returned []
Implicit Place search using SMT with State Equation took 7019 ms to find 0 implicit places.
[2023-03-24 12:31:36] [INFO ] Invariant cache hit.
[2023-03-24 12:31:37] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7794 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X p1), (X (X p1)), true, (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1855 steps, run visited all 1 properties in 9 ms. (steps per millisecond=206 )
Probabilistic random walk after 1855 steps, saw 1806 distinct states, run finished after 9 ms. (steps per millisecond=206 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1)), true, (F (G p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3717 reset in 369 ms.
Product exploration explored 100000 steps with 3711 reset in 381 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (NOT p1)]
Support contains 23 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 1869 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1869 transition count 356
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 149 ms. Remains 1869 /1893 variables (removed 24) and now considering 356/356 (removed 0) transitions.
[2023-03-24 12:31:39] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 356 rows 1869 cols
[2023-03-24 12:31:39] [INFO ] Computed 1518 place invariants in 164 ms
[2023-03-24 12:31:40] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1893 places, 356/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1072 ms. Remains : 1869/1893 places, 356/356 transitions.
Support contains 23 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2023-03-24 12:31:40] [INFO ] Computed 1540 place invariants in 115 ms
[2023-03-24 12:31:43] [INFO ] Implicit Places using invariants in 2591 ms returned []
[2023-03-24 12:31:43] [INFO ] Invariant cache hit.
[2023-03-24 12:31:47] [INFO ] Implicit Places using invariants and state equation in 4466 ms returned []
Implicit Place search using SMT with State Equation took 7059 ms to find 0 implicit places.
[2023-03-24 12:31:47] [INFO ] Invariant cache hit.
[2023-03-24 12:31:48] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7836 ms. Remains : 1893/1893 places, 356/356 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-14 finished in 29526 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||G(p1))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Applied a total of 3 rules in 165 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2023-03-24 12:31:48] [INFO ] Computed 1540 place invariants in 22 ms
[2023-03-24 12:31:51] [INFO ] Implicit Places using invariants in 2434 ms returned []
[2023-03-24 12:31:51] [INFO ] Invariant cache hit.
[2023-03-24 12:31:55] [INFO ] Implicit Places using invariants and state equation in 4086 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6525 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1868/1916 places, 353/356 transitions.
Applied a total of 0 rules in 80 ms. Remains 1868 /1868 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6772 ms. Remains : 1868/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s1696 1) (GEQ s1742 1)) (AND (GEQ s1688 1) (GEQ s1734 1)) (AND (GEQ s1701 1) (GEQ s1747 1)) (AND (GEQ s1690 1) (GEQ s1736 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-15 finished in 6816 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)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-22-LTLFireability-03
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1889 transition count 351
Applied a total of 5 rules in 91 ms. Remains 1889 /1916 variables (removed 27) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2023-03-24 12:31:55] [INFO ] Computed 1540 place invariants in 31 ms
[2023-03-24 12:31:57] [INFO ] Implicit Places using invariants in 1977 ms returned []
[2023-03-24 12:31:57] [INFO ] Invariant cache hit.
[2023-03-24 12:32:00] [INFO ] Implicit Places using invariants and state equation in 3315 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5298 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1866/1916 places, 351/356 transitions.
Applied a total of 0 rules in 58 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 5450 ms. Remains : 1866/1916 places, 351/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (OR (LT s0 1) (LT s1795 1)) (OR (LT s0 1) (LT s1796 1)) (OR (LT s0 1) (LT s1797 1)) (OR (LT s0 1) (LT s1798 1)) (OR (LT s0 1) (LT s1799 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3474 reset in 590 ms.
Product exploration explored 100000 steps with 3472 reset in 607 ms.
Computed a total of 1866 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1866 transition count 351
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 348 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1779 steps, run visited all 1 properties in 12 ms. (steps per millisecond=148 )
Probabilistic random walk after 1779 steps, saw 1733 distinct states, run finished after 12 ms. (steps per millisecond=148 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1866/1866 places, 351/351 transitions.
Applied a total of 0 rules in 34 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
// Phase 1: matrix 351 rows 1866 cols
[2023-03-24 12:32:03] [INFO ] Computed 1518 place invariants in 30 ms
[2023-03-24 12:32:05] [INFO ] Implicit Places using invariants in 1981 ms returned []
[2023-03-24 12:32:05] [INFO ] Invariant cache hit.
[2023-03-24 12:32:08] [INFO ] Implicit Places using invariants and state equation in 3189 ms returned []
Implicit Place search using SMT with State Equation took 5172 ms to find 0 implicit places.
[2023-03-24 12:32:08] [INFO ] Invariant cache hit.
[2023-03-24 12:32:09] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5922 ms. Remains : 1866/1866 places, 351/351 transitions.
Computed a total of 1866 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1866 transition count 351
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 349 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1779 steps, run visited all 1 properties in 10 ms. (steps per millisecond=177 )
Probabilistic random walk after 1779 steps, saw 1733 distinct states, run finished after 10 ms. (steps per millisecond=177 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3470 reset in 598 ms.
Product exploration explored 100000 steps with 3469 reset in 601 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Support contains 576 out of 1866 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1866/1866 places, 351/351 transitions.
Applied a total of 0 rules in 46 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2023-03-24 12:32:12] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-24 12:32:12] [INFO ] Invariant cache hit.
[2023-03-24 12:32:12] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 784 ms. Remains : 1866/1866 places, 351/351 transitions.
Support contains 576 out of 1866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1866/1866 places, 351/351 transitions.
Applied a total of 0 rules in 30 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2023-03-24 12:32:12] [INFO ] Invariant cache hit.
[2023-03-24 12:32:14] [INFO ] Implicit Places using invariants in 1745 ms returned []
[2023-03-24 12:32:14] [INFO ] Invariant cache hit.
[2023-03-24 12:32:18] [INFO ] Implicit Places using invariants and state equation in 3380 ms returned []
Implicit Place search using SMT with State Equation took 5137 ms to find 0 implicit places.
[2023-03-24 12:32:18] [INFO ] Invariant cache hit.
[2023-03-24 12:32:18] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5879 ms. Remains : 1866/1866 places, 351/351 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-03 finished in 23392 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)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-22-LTLFireability-04
Stuttering acceptance computed with spot in 81 ms :[true, p0, p0]
Support contains 1 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 144 are kept as prefixes of interest. Removing 1772 places using SCC suffix rule.7 ms
Discarding 1772 places :
Also discarding 140 output transitions
Drop transitions removed 140 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 143 transition count 100
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 1 with 2 rules applied. Total rules applied 118 place count 142 transition count 99
Applied a total of 118 rules in 14 ms. Remains 142 /1916 variables (removed 1774) and now considering 99/356 (removed 257) transitions.
// Phase 1: matrix 99 rows 142 cols
[2023-03-24 12:32:18] [INFO ] Computed 44 place invariants in 0 ms
[2023-03-24 12:32:19] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-24 12:32:19] [INFO ] Invariant cache hit.
[2023-03-24 12:32:19] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 246 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 119/1916 places, 99/356 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 262 ms. Remains : 119/1916 places, 99/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3437 reset in 262 ms.
Product exploration explored 100000 steps with 3433 reset in 276 ms.
Computed a total of 119 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 119 transition count 99
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)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 314 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1525 steps, run visited all 1 properties in 6 ms. (steps per millisecond=254 )
Probabilistic random walk after 1525 steps, saw 1480 distinct states, run finished after 7 ms. (steps per millisecond=217 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 77 ms :[true, p0, p0]
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 119 cols
[2023-03-24 12:32:20] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-24 12:32:20] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-24 12:32:20] [INFO ] Invariant cache hit.
[2023-03-24 12:32:20] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-24 12:32:20] [INFO ] Invariant cache hit.
[2023-03-24 12:32:20] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 119/119 places, 99/99 transitions.
Computed a total of 119 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 119 transition count 99
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)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 314 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1525 steps, run visited all 1 properties in 7 ms. (steps per millisecond=217 )
Probabilistic random walk after 1525 steps, saw 1480 distinct states, run finished after 7 ms. (steps per millisecond=217 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 81 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 85 ms :[true, p0, p0]
Product exploration explored 100000 steps with 3436 reset in 265 ms.
Product exploration explored 100000 steps with 3433 reset in 268 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 77 ms :[true, p0, p0]
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 119 /119 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-24 12:32:22] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-24 12:32:22] [INFO ] Invariant cache hit.
[2023-03-24 12:32:22] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 119/119 places, 99/99 transitions.
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 99/99 transitions.
Applied a total of 0 rules in 0 ms. Remains 119 /119 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-24 12:32:22] [INFO ] Invariant cache hit.
[2023-03-24 12:32:22] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-24 12:32:22] [INFO ] Invariant cache hit.
[2023-03-24 12:32:22] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-24 12:32:22] [INFO ] Invariant cache hit.
[2023-03-24 12:32:22] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 119/119 places, 99/99 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-04 finished in 3838 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)&&G((X(p1)&&F((!p2&&X(G((!p2||G(!p3))))))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-22-LTLFireability-14
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) p2 p0), p0, (OR (NOT p1) p2), p2, (AND p2 p3), true, (AND p2 p3), (AND p2 p3)]
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1915 transition count 355
Applied a total of 1 rules in 155 ms. Remains 1915 /1916 variables (removed 1) and now considering 355/356 (removed 1) transitions.
// Phase 1: matrix 355 rows 1915 cols
[2023-03-24 12:32:23] [INFO ] Computed 1562 place invariants in 29 ms
[2023-03-24 12:32:25] [INFO ] Implicit Places using invariants in 2354 ms returned []
[2023-03-24 12:32:25] [INFO ] Invariant cache hit.
[2023-03-24 12:32:29] [INFO ] Implicit Places using invariants and state equation in 4138 ms returned [1703, 1704, 1705, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 6497 ms to find 46 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1869/1916 places, 355/356 transitions.
Applied a total of 0 rules in 72 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 6725 ms. Remains : 1869/1916 places, 355/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={0, 1} source=3 dest: 3}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND p2 p3), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={1} source=4 dest: 6}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND p2 p3), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={1} source=6 dest: 7}], [{ cond=(AND p2 p3), acceptance={0, 1} source=7 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0} source=7 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s1677 1) (GEQ s1769 1)) (AND (GEQ s1661 1) (GEQ s1753 1)) (AND (GEQ s1664 1) (GEQ s1756 1)) (AND (GEQ s1669 1) (GEQ s1761 1)) (AND (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3474 reset in 280 ms.
Product exploration explored 100000 steps with 3479 reset in 298 ms.
Computed a total of 1869 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1869 transition count 355
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 p2) p1 (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1134 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 346 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1648076 steps, run timeout after 3001 ms. (steps per millisecond=549 ) properties seen :{}
Probabilistic random walk after 1648076 steps, saw 216455 distinct states, run finished after 3002 ms. (steps per millisecond=548 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 355 rows 1869 cols
[2023-03-24 12:32:35] [INFO ] Computed 1518 place invariants in 116 ms
[2023-03-24 12:32:35] [INFO ] [Real]Absence check using 0 positive and 1518 generalized place invariants in 303 ms returned sat
[2023-03-24 12:32:35] [INFO ] After 580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 12:32:36] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 300 ms returned sat
[2023-03-24 12:32:36] [INFO ] After 586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 12:32:36] [INFO ] After 662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-24 12:32:36] [INFO ] After 1276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p3)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 24 factoid took 837 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Support contains 23 out of 1869 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1869/1869 places, 355/355 transitions.
Applied a total of 0 rules in 60 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2023-03-24 12:32:37] [INFO ] Invariant cache hit.
[2023-03-24 12:32:40] [INFO ] Implicit Places using invariants in 2333 ms returned []
[2023-03-24 12:32:40] [INFO ] Invariant cache hit.
[2023-03-24 12:32:44] [INFO ] Implicit Places using invariants and state equation in 3791 ms returned []
Implicit Place search using SMT with State Equation took 6124 ms to find 0 implicit places.
[2023-03-24 12:32:44] [INFO ] Invariant cache hit.
[2023-03-24 12:32:44] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6888 ms. Remains : 1869/1869 places, 355/355 transitions.
Computed a total of 1869 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1869 transition count 355
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 : [p1, (X p1), (X (X p1)), true, (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 347 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1738760 steps, run timeout after 3001 ms. (steps per millisecond=579 ) properties seen :{}
Probabilistic random walk after 1738760 steps, saw 226657 distinct states, run finished after 3001 ms. (steps per millisecond=579 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 12:32:48] [INFO ] Invariant cache hit.
[2023-03-24 12:32:48] [INFO ] [Real]Absence check using 0 positive and 1518 generalized place invariants in 268 ms returned sat
[2023-03-24 12:32:48] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 12:32:49] [INFO ] [Nat]Absence check using 0 positive and 1518 generalized place invariants in 300 ms returned sat
[2023-03-24 12:32:50] [INFO ] After 581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 12:32:50] [INFO ] After 665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-24 12:32:50] [INFO ] After 1261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 53 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=53 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), true, (F (G p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3475 reset in 370 ms.
Product exploration explored 100000 steps with 3469 reset in 384 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Support contains 23 out of 1869 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1869/1869 places, 355/355 transitions.
Graph (complete) has 14655 edges and 1869 vertex of which 1845 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 353
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1845 transition count 354
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 149 ms. Remains 1845 /1869 variables (removed 24) and now considering 354/355 (removed 1) transitions.
[2023-03-24 12:32:51] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 354 rows 1845 cols
[2023-03-24 12:32:51] [INFO ] Computed 1496 place invariants in 124 ms
[2023-03-24 12:32:52] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/1869 places, 354/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1030 ms. Remains : 1845/1869 places, 354/355 transitions.
Support contains 23 out of 1869 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1869/1869 places, 355/355 transitions.
Applied a total of 0 rules in 62 ms. Remains 1869 /1869 variables (removed 0) and now considering 355/355 (removed 0) transitions.
// Phase 1: matrix 355 rows 1869 cols
[2023-03-24 12:32:52] [INFO ] Computed 1518 place invariants in 117 ms
[2023-03-24 12:32:55] [INFO ] Implicit Places using invariants in 2472 ms returned []
[2023-03-24 12:32:55] [INFO ] Invariant cache hit.
[2023-03-24 12:32:59] [INFO ] Implicit Places using invariants and state equation in 4085 ms returned []
Implicit Place search using SMT with State Equation took 6559 ms to find 0 implicit places.
[2023-03-24 12:32:59] [INFO ] Invariant cache hit.
[2023-03-24 12:32:59] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7334 ms. Remains : 1869/1869 places, 355/355 transitions.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-14 finished in 37389 ms.
[2023-03-24 12:33:00] [INFO ] Flatten gal took : 77 ms
[2023-03-24 12:33:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 22 ms.
[2023-03-24 12:33:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1916 places, 356 transitions and 4110 arcs took 5 ms.
Total runtime 217906 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2222/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2222/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2222/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : QuasiCertifProtocol-COL-22-LTLFireability-03
Could not compute solution for formula : QuasiCertifProtocol-COL-22-LTLFireability-04
Could not compute solution for formula : QuasiCertifProtocol-COL-22-LTLFireability-14

BK_STOP 1679661607780

--------------------
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
mcc2023
ltl formula name QuasiCertifProtocol-COL-22-LTLFireability-03
ltl formula formula --ltl=/tmp/2222/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1916 places, 356 transitions and 4110 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2222/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2222/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2222/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2222/ltl_0_
ltl formula name QuasiCertifProtocol-COL-22-LTLFireability-04
ltl formula formula --ltl=/tmp/2222/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1916 places, 356 transitions and 4110 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2222/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2222/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2222/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2222/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name QuasiCertifProtocol-COL-22-LTLFireability-14
ltl formula formula --ltl=/tmp/2222/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1916 places, 356 transitions and 4110 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2222/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2222/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2222/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2222/ltl_2_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-22"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is QuasiCertifProtocol-COL-22, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873951000836"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-22.tgz
mv QuasiCertifProtocol-COL-22 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;