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.r293-tall-167873945900812.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 itstools
Input is QuasiCertifProtocol-COL-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945900812
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.6K Feb 26 01:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 26 01:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 61K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678978136798

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-06
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-16 14:48:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 14:48:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:48:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-16 14:48:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 14:48:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 463 ms
[2023-03-16 14:48:58] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 14:48:59] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2023-03-16 14:48:59] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 746 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 19) seen :13
Incomplete Best-First random walk after 10000 steps, including 263 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 349 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 264 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 348 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-16 14:48:59] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-16 14:48:59] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-16 14:48:59] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 14:48:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 14:48:59] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 14:48:59] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-16 14:48:59] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 29 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=29 )
Parikh walk visited 6 properties in 4 ms.
[2023-03-16 14:49:00] [INFO ] Flatten gal took : 32 ms
[2023-03-16 14:49:00] [INFO ] Flatten gal took : 4 ms
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2023-03-16 14:49:00] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 9 ms.
[2023-03-16 14:49:00] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 245 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 8 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-16 14:49:00] [INFO ] Computed 138 place invariants in 11 ms
[2023-03-16 14:49:00] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-16 14:49:00] [INFO ] Invariant cache hit.
[2023-03-16 14:49:00] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-16 14:49:00] [INFO ] Invariant cache hit.
[2023-03-16 14:49:00] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 252/270 places, 116/116 transitions.
Support contains 245 out of 252 places after structural reductions.
[2023-03-16 14:49:00] [INFO ] Flatten gal took : 22 ms
[2023-03-16 14:49:00] [INFO ] Flatten gal took : 25 ms
[2023-03-16 14:49:00] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 244 out of 252 places (down from 245) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 980 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 25) seen :8
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-16 14:49:01] [INFO ] Invariant cache hit.
[2023-03-16 14:49:01] [INFO ] [Real]Absence check using 0 positive and 138 generalized place invariants in 18 ms returned sat
[2023-03-16 14:49:01] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-16 14:49:01] [INFO ] [Nat]Absence check using 0 positive and 138 generalized place invariants in 17 ms returned sat
[2023-03-16 14:49:01] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-16 14:49:02] [INFO ] After 650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 243 ms.
[2023-03-16 14:49:02] [INFO ] After 1092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Finished Parikh walk after 54 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=54 )
Parikh walk visited 17 properties in 12 ms.
Computed a total of 252 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 252 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||((!p0||G(!p1)) U p2)))'
Support contains 65 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 10 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-16 14:49:02] [INFO ] Invariant cache hit.
[2023-03-16 14:49:02] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-16 14:49:02] [INFO ] Invariant cache hit.
[2023-03-16 14:49:03] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-16 14:49:03] [INFO ] Invariant cache hit.
[2023-03-16 14:49:03] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 252/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), true, (NOT p2), p1]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s249 1), p0:(OR (AND (GEQ s99 1) (GEQ s106 1) (GEQ s113 1) (GEQ s120 1) (GEQ s127 1) (GEQ s134 1) (GEQ s141 1) (GEQ s197 1)) (AND (GEQ s105 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-00 finished in 805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(!p1 U (p2||G(!p1))))))'
Support contains 29 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 16 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-16 14:49:03] [INFO ] Invariant cache hit.
[2023-03-16 14:49:03] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-16 14:49:03] [INFO ] Invariant cache hit.
[2023-03-16 14:49:03] [INFO ] Implicit Places using invariants and state equation in 208 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 340 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 363 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NOT (OR (AND (GEQ s186 1) (GEQ s200 1)) (AND (GEQ s184 1) (GEQ s198 1)) (AND (GEQ s188 1) (GEQ s202 1)) (AND (GEQ s183 1) (GEQ s197 1)) (AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 28880 reset in 328 ms.
Product exploration explored 100000 steps with 28812 reset in 215 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (F (G p2)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 437 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 983 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 116 rows 245 cols
[2023-03-16 14:49:05] [INFO ] Computed 132 place invariants in 15 ms
[2023-03-16 14:49:05] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 15 ms returned sat
[2023-03-16 14:49:05] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 14:49:05] [INFO ] After 56ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:49:05] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:49:05] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 14 ms returned sat
[2023-03-16 14:49:05] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 14:49:05] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-16 14:49:05] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (F (G p2)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 9 factoid took 531 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 22 out of 245 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 11 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-16 14:49:06] [INFO ] Invariant cache hit.
[2023-03-16 14:49:06] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-16 14:49:06] [INFO ] Invariant cache hit.
[2023-03-16 14:49:06] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-16 14:49:06] [INFO ] Invariant cache hit.
[2023-03-16 14:49:06] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 245/245 places, 116/116 transitions.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 983 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 172 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 14:49:07] [INFO ] Invariant cache hit.
[2023-03-16 14:49:07] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 15 ms returned sat
[2023-03-16 14:49:07] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 14:49:07] [INFO ] After 58ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:49:07] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:49:07] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 15 ms returned sat
[2023-03-16 14:49:07] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 14:49:07] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-16 14:49:07] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 4 factoid took 321 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 32418 reset in 159 ms.
Product exploration explored 100000 steps with 32854 reset in 238 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 22 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 245 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 27 ms. Remains 245 /245 variables (removed 0) and now considering 117/116 (removed -1) transitions.
[2023-03-16 14:49:08] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 117 rows 245 cols
[2023-03-16 14:49:08] [INFO ] Computed 132 place invariants in 9 ms
[2023-03-16 14:49:08] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/245 places, 117/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 245/245 places, 117/116 transitions.
Built C files in :
/tmp/ltsmin13623301853114890886
[2023-03-16 14:49:08] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13623301853114890886
Running compilation step : cd /tmp/ltsmin13623301853114890886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 331 ms.
Running link step : cd /tmp/ltsmin13623301853114890886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13623301853114890886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16227095570089423967.hoa' '--buchi-type=spotba'
LTSmin run took 387 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-01 finished in 6153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((X(!p0)&&G(p1)))))'
Support contains 15 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-16 14:49:09] [INFO ] Computed 138 place invariants in 3 ms
[2023-03-16 14:49:09] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-16 14:49:09] [INFO ] Invariant cache hit.
[2023-03-16 14:49:10] [INFO ] Implicit Places using invariants and state equation in 188 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 332 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 345 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s238 1)) (AND (GEQ s0 1) (GEQ s232 1)) (AND (GEQ s0 1) (GEQ s233 1)) (AND (GEQ s0 1) (GEQ s234 1)) (AND (GEQ s0 1) (GEQ s235 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-02 finished in 448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0&&(p1 U p2))) U (p3&&F(G(p4))))))'
Support contains 121 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 250 transition count 114
Applied a total of 2 rules in 17 ms. Remains 250 /252 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 250 cols
[2023-03-16 14:49:10] [INFO ] Computed 138 place invariants in 6 ms
[2023-03-16 14:49:10] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-16 14:49:10] [INFO ] Invariant cache hit.
[2023-03-16 14:49:10] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [183, 184, 185, 186, 187, 188, 189]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 254 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/252 places, 114/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 278 ms. Remains : 243/252 places, 114/116 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p3) (NOT p4)), true, (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p4), (OR (NOT p4) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p3 (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p4)), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=3 dest: 3}], [{ cond=p4, acceptance={} source=4 dest: 4}, { cond=(NOT p4), acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(LT s239 1), p0:(OR (AND (GEQ s1 1) (GEQ s8 1) (GEQ s15 1) (GEQ s22 1) (GEQ s29 1) (GEQ s36 1) (GEQ s43 1) (GEQ s183 1)) (AND (GEQ s7 1) (GEQ s14 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-03 finished in 626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 242 transition count 112
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 242 transition count 112
Applied a total of 4 rules in 23 ms. Remains 242 /252 variables (removed 10) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 242 cols
[2023-03-16 14:49:10] [INFO ] Computed 132 place invariants in 6 ms
[2023-03-16 14:49:10] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-16 14:49:10] [INFO ] Invariant cache hit.
[2023-03-16 14:49:11] [INFO ] Implicit Places using invariants and state equation in 193 ms returned [176, 177, 178, 179, 180, 181, 182, 190, 191, 192, 193, 194, 195, 196]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 328 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/252 places, 112/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 357 ms. Remains : 228/252 places, 112/116 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s148 1) (GEQ s197 1)) (AND (GEQ s152 1) (GEQ s201 1)) (AND (GEQ s149 1) (GEQ s198 1)) (AND (GEQ s151 1) (GEQ s200 1)) (AND (GEQ s153 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-04 finished in 402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p1)||p0)))'
Support contains 71 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 241 transition count 111
Applied a total of 5 rules in 12 ms. Remains 241 /252 variables (removed 11) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2023-03-16 14:49:11] [INFO ] Computed 132 place invariants in 2 ms
[2023-03-16 14:49:11] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-16 14:49:11] [INFO ] Invariant cache hit.
[2023-03-16 14:49:11] [INFO ] Implicit Places using invariants and state equation in 158 ms returned [176, 177, 178, 179, 180, 181, 182]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 267 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/252 places, 111/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 284 ms. Remains : 234/252 places, 111/116 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s214 1) (GEQ s213 1) (GEQ s212 1) (GEQ s211 1) (GEQ s217 1) (GEQ s216 1) (GEQ s215 1)), p1:(OR (AND (GEQ s99 1) (GEQ s106 1) (GEQ s113 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14822 reset in 231 ms.
Product exploration explored 100000 steps with 14812 reset in 244 ms.
Computed a total of 234 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 234 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-05 finished in 1001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-16 14:49:12] [INFO ] Computed 138 place invariants in 4 ms
[2023-03-16 14:49:12] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-16 14:49:12] [INFO ] Invariant cache hit.
[2023-03-16 14:49:12] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 324 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 331 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s222 1)) (AND (GEQ s0 1) (GEQ s223 1)) (AND (GEQ s0 1) (GEQ s224 1)) (AND (GEQ s0 1) (GEQ s218 1)) (AND (GEQ s0 1) (GEQ s219 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-07 finished in 421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||((p1||G(p0))&&p2))))'
Support contains 16 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 242 transition count 112
Applied a total of 5 rules in 16 ms. Remains 242 /252 variables (removed 10) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 242 cols
[2023-03-16 14:49:12] [INFO ] Computed 132 place invariants in 5 ms
[2023-03-16 14:49:12] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-16 14:49:12] [INFO ] Invariant cache hit.
[2023-03-16 14:49:12] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [190, 191, 192, 193, 194, 195, 196]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 301 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/252 places, 112/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 322 ms. Remains : 235/252 places, 112/116 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p2:(AND (OR (LT s0 1) (LT s190 1)) (OR (LT s0 1) (LT s191 1)) (OR (LT s0 1) (LT s192 1)) (OR (LT s0 1) (LT s193 1)) (OR (LT s0 1) (LT s194 1)) (OR (LT s0 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-08 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G((!p0||G(p1)))||(!p2&&(!p0||G(p1)))))))'
Support contains 65 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-16 14:49:13] [INFO ] Computed 138 place invariants in 5 ms
[2023-03-16 14:49:13] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-16 14:49:13] [INFO ] Invariant cache hit.
[2023-03-16 14:49:13] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 276 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 280 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GEQ s234 1) (GEQ s235 1) (GEQ s236 1) (GEQ s237 1) (GEQ s232 1) (GEQ s233 1) (GEQ s238 1)), p1:(AND (GEQ s239 1) (OR (AND (GEQ s57 1) (GEQ s58 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1) (NOT p2))
Knowledge based reduction with 12 factoid took 360 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-09 finished in 1214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F(p1)&&X(p0))))'
Support contains 22 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-16 14:49:14] [INFO ] Invariant cache hit.
[2023-03-16 14:49:14] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-16 14:49:14] [INFO ] Invariant cache hit.
[2023-03-16 14:49:14] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 313 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 320 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, true, true, (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s186 1) (LT s200 1)) (OR (LT s184 1) (LT s198 1)) (OR (LT s188 1) (LT s202 1)) (OR (LT s183 1) (LT s197 1)) (OR (LT s185 1) (LT s199 1)) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-11 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(!p1)))'
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-16 14:49:14] [INFO ] Invariant cache hit.
[2023-03-16 14:49:14] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-16 14:49:14] [INFO ] Invariant cache hit.
[2023-03-16 14:49:15] [INFO ] Implicit Places using invariants and state equation in 193 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 321 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 329 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) p1), p1, (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s239 1), p1:(OR (AND (GEQ s0 1) (GEQ s197 1)) (AND (GEQ s0 1) (GEQ s198 1)) (AND (GEQ s0 1) (GEQ s199 1)) (AND (GEQ s0 1) (GEQ s200 1)) (AND (GEQ s...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-12 finished in 475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U !p0))'
Support contains 8 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 241 transition count 111
Applied a total of 5 rules in 17 ms. Remains 241 /252 variables (removed 11) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2023-03-16 14:49:15] [INFO ] Computed 132 place invariants in 4 ms
[2023-03-16 14:49:15] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-16 14:49:15] [INFO ] Invariant cache hit.
[2023-03-16 14:49:15] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [176, 177, 178, 179, 180, 181, 182, 190, 191, 192, 193, 194, 195, 196]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 311 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/252 places, 111/116 transitions.
Applied a total of 0 rules in 15 ms. Remains 227 /227 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 343 ms. Remains : 227/252 places, 111/116 transitions.
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s192 1)) (OR (LT s0 1) (LT s193 1)) (OR (LT s0 1) (LT s194 1)) (OR (LT s0 1) (LT s195 1)) (OR (LT s0 1) (LT s196 1)) (OR (LT s0 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-13 finished in 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p0&&G(F(!p1))))))'
Support contains 16 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-16 14:49:15] [INFO ] Computed 138 place invariants in 2 ms
[2023-03-16 14:49:15] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-16 14:49:15] [INFO ] Invariant cache hit.
[2023-03-16 14:49:15] [INFO ] Implicit Places using invariants and state equation in 180 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 301 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 308 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) p1), p1, p1]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s162 1) (LT s163 1) (LT s164 1) (LT s165 1) (LT s166 1) (LT s167 1) (LT s168 1) (LT s241 1)), p1:(AND (OR (LT s0 1) (LT s206 1)) (OR (LT s0 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9842 reset in 138 ms.
Product exploration explored 100000 steps with 9831 reset in 114 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 984 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 181 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 190 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 116 rows 245 cols
[2023-03-16 14:49:17] [INFO ] Computed 132 place invariants in 9 ms
[2023-03-16 14:49:17] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 15 ms returned sat
[2023-03-16 14:49:17] [INFO ] After 65ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-16 14:49:17] [INFO ] After 80ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 14:49:17] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 14:49:17] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 17 ms returned sat
[2023-03-16 14:49:17] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 14:49:17] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-16 14:49:17] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 17 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 338 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Support contains 16 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-16 14:49:18] [INFO ] Invariant cache hit.
[2023-03-16 14:49:18] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-16 14:49:18] [INFO ] Invariant cache hit.
[2023-03-16 14:49:18] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-16 14:49:18] [INFO ] Invariant cache hit.
[2023-03-16 14:49:18] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 245/245 places, 116/116 transitions.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 375 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 983 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 190 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 14:49:19] [INFO ] Invariant cache hit.
[2023-03-16 14:49:19] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 16 ms returned sat
[2023-03-16 14:49:19] [INFO ] After 67ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-16 14:49:19] [INFO ] After 82ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 14:49:19] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 14:49:19] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 16 ms returned sat
[2023-03-16 14:49:19] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 14:49:19] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-16 14:49:19] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 20 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 372 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 9836 reset in 106 ms.
Product exploration explored 100000 steps with 9827 reset in 114 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Support contains 16 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Graph (complete) has 677 edges and 245 vertex of which 237 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 237 transition count 115
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 2 rules in 13 ms. Remains 237 /245 variables (removed 8) and now considering 115/116 (removed 1) transitions.
[2023-03-16 14:49:20] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 115 rows 237 cols
[2023-03-16 14:49:20] [INFO ] Computed 126 place invariants in 9 ms
[2023-03-16 14:49:21] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 237/245 places, 115/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 237/245 places, 115/116 transitions.
Built C files in :
/tmp/ltsmin16223586368090837603
[2023-03-16 14:49:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16223586368090837603
Running compilation step : cd /tmp/ltsmin16223586368090837603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 250 ms.
Running link step : cd /tmp/ltsmin16223586368090837603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16223586368090837603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18403422332546391024.hoa' '--buchi-type=spotba'
LTSmin run took 527 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-14 finished in 6240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))&&F(G(!p2)))))'
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-16 14:49:21] [INFO ] Computed 138 place invariants in 3 ms
[2023-03-16 14:49:21] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-16 14:49:22] [INFO ] Invariant cache hit.
[2023-03-16 14:49:22] [INFO ] Implicit Places using invariants and state equation in 201 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 333 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 339 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1)), p2, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s240 1), p2:(LT s239 1), p1:(OR (GEQ s234 1) (GEQ s235 1) (GEQ s236 1) (GEQ s237 1) (GEQ s232 1) (GEQ s233 1) (GEQ s238 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-15 finished in 513 ms.
All properties solved by simple procedures.
Total runtime 24211 ms.

BK_STOP 1678978163511

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873945900812"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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