Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 7.0K Apr 30 13:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 30 13:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 13:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 34K May 10 09:34 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-02-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652980981739

Running Version 202205111006
[2022-05-19 17:23:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 17:23:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:23:03] [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.
[2022-05-19 17:23:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 17:23:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 627 ms
[2022-05-19 17:23:03] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 17:23:03] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2022-05-19 17:23:03] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10001 steps, including 1346 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10000 steps, including 714 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 17:23:04] [INFO ] Computed 5 place invariants in 11 ms
[2022-05-19 17:23:04] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-19 17:23:04] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 17:23:04] [INFO ] After 38ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-19 17:23:04] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 1 ms.
[2022-05-19 17:23:04] [INFO ] Flatten gal took : 21 ms
[2022-05-19 17:23:04] [INFO ] Flatten gal took : 5 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2022-05-19 17:23:04] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 6 ms.
[2022-05-19 17:23:04] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 62 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 76 transition count 56
Applied a total of 10 rules in 7 ms. Remains 76 /86 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:04] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-19 17:23:04] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:04] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-19 17:23:04] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:04] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-19 17:23:04] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/86 places, 56/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/86 places, 56/56 transitions.
Support contains 62 out of 76 places after structural reductions.
[2022-05-19 17:23:04] [INFO ] Flatten gal took : 8 ms
[2022-05-19 17:23:04] [INFO ] Flatten gal took : 8 ms
[2022-05-19 17:23:04] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 1647 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 550 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 252 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :10
Running SMT prover for 1 properties.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:05] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 17:23:05] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 3 ms returned sat
[2022-05-19 17:23:05] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 17:23:05] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 3 ms returned sat
[2022-05-19 17:23:05] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 17:23:05] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-19 17:23:05] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 0 ms.
Computed a total of 76 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 56
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((((F(p1) U !p2)||X(!p2))&&p2))||p0)))'
Support contains 7 out of 76 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 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 69 transition count 51
Applied a total of 5 rules in 11 ms. Remains 69 /76 variables (removed 7) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 69 cols
[2022-05-19 17:23:05] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 17:23:05] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 51 rows 69 cols
[2022-05-19 17:23:05] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 17:23:05] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [40, 41, 42, 46, 47, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 121 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/76 places, 51/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/76 places, 51/56 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s48 1)) (AND (GEQ s0 1) (GEQ s46 1)) (AND (GEQ s0 1) (GEQ s47 1))), p2:(OR (AND (GEQ s0 1) (GEQ s41 1)) (AND (GEQ s0 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 2 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-00 finished in 395 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 70 transition count 52
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 70 transition count 52
Applied a total of 4 rules in 15 ms. Remains 70 /76 variables (removed 6) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 70 cols
[2022-05-19 17:23:06] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-19 17:23:06] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 52 rows 70 cols
[2022-05-19 17:23:06] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 17:23:06] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [40, 41, 42, 46, 47, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 136 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/76 places, 52/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/76 places, 52/56 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s29 1) (LT s50 1)) (OR (LT s30 1) (LT s51 1)) (OR (LT s28 1) (LT s49 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 18784 reset in 247 ms.
Product exploration explored 100000 steps with 18776 reset in 139 ms.
Computed a total of 64 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-01 finished in 722 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((F(p1)&&p0)))))'
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:06] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 17:23:06] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:06] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 17:23:06] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 120 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s67 1), p0:(AND (GEQ s40 1) (GEQ s41 1) (GEQ s42 1) (GEQ s71 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 6 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-03 finished in 244 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F((p0 U (G(p0)&&p1)))))'
Support contains 13 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 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 70 transition count 52
Applied a total of 5 rules in 7 ms. Remains 70 /76 variables (removed 6) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 70 cols
[2022-05-19 17:23:07] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 17:23:07] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 52 rows 70 cols
[2022-05-19 17:23:07] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-19 17:23:07] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [46, 47, 48]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 149 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/76 places, 52/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 67/76 places, 52/56 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s65 1), p0:(OR (AND (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s58 1)) (AND (GEQ s13 1) (GEQ s14 1) (GEQ s15 1) (GEQ s59 1)) (AND (GEQ s16 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-04 finished in 255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U G(p0))&&(F(X(G(p2)))||p1))))'
Support contains 13 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 45 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 44 transition count 36
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 11 place count 43 transition count 35
Applied a total of 11 rules in 3 ms. Remains 43 /76 variables (removed 33) and now considering 35/56 (removed 21) transitions.
// Phase 1: matrix 35 rows 43 cols
[2022-05-19 17:23:07] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 17:23:07] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 35 rows 43 cols
[2022-05-19 17:23:07] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 17:23:07] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [22, 23, 24]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 76 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/76 places, 35/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 40/76 places, 35/56 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s37 1), p1:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1) (GEQ s23 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s7 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s6 1) (G...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-06 finished in 262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 12 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 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 69 transition count 51
Applied a total of 5 rules in 11 ms. Remains 69 /76 variables (removed 7) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 69 cols
[2022-05-19 17:23:07] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 17:23:07] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 51 rows 69 cols
[2022-05-19 17:23:07] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 17:23:07] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [40, 41, 42, 46, 47, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 110 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/76 places, 51/56 transitions.
Applied a total of 0 rules in 11 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/76 places, 51/56 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s6 1) (GEQ s9 1) (GEQ s42 1)) (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1) (GEQ s41 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s7 1) (GEQ s4...], 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 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-07 finished in 171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(F(p0))))))'
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 13 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.1 ms
Discarding 63 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 12 transition count 10
Applied a total of 19 rules in 1 ms. Remains 12 /76 variables (removed 64) and now considering 10/56 (removed 46) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 17:23:07] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-19 17:23:07] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 17:23:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 17:23:07] [INFO ] Implicit Places using invariants and state equation in 31 ms returned [4, 5, 6]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 84 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/76 places, 10/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 9/76 places, 10/56 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-10 finished in 156 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U G((p0 U p1)))))'
Support contains 10 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:07] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 17:23:08] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:08] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 17:23:08] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 134 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s47 1)) (AND (GEQ s0 1) (GEQ s48 1)) (AND (GEQ s0 1) (GEQ s46 1))), p0:(OR (AND (GEQ s32 1) (GEQ s56 1)) (AND (GEQ s33 1) (GEQ...], 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 5 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-11 finished in 317 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p0)))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:08] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-19 17:23:08] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:08] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 17:23:08] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 115 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 9 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-12 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 (LT s28 1) (LT s29 1) (LT s30 1) (LT s67 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 16427 reset in 123 ms.
Product exploration explored 100000 steps with 16424 reset in 166 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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 207 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1637 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 548 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 98 steps, run visited all 1 properties in 5 ms. (steps per millisecond=19 )
Probabilistic random walk after 98 steps, saw 86 distinct states, run finished after 5 ms. (steps per millisecond=19 ) 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 187 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 17:23:09] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-19 17:23:09] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 17:23:09] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-19 17:23:09] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 17:23:09] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-19 17:23:09] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 56/56 transitions.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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 157 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1645 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 558 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 98 steps, run visited all 1 properties in 4 ms. (steps per millisecond=24 )
Probabilistic random walk after 98 steps, saw 86 distinct states, run finished after 4 ms. (steps per millisecond=24 ) 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 187 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16427 reset in 73 ms.
Product exploration explored 100000 steps with 16425 reset in 87 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Graph (complete) has 125 edges and 73 vertex of which 34 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.1 ms
Discarding 39 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 34 transition count 30
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 13 place count 34 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 13 rules in 6 ms. Remains 34 /73 variables (removed 39) and now considering 31/56 (removed 25) transitions.
[2022-05-19 17:23:10] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 31 rows 34 cols
[2022-05-19 17:23:10] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 17:23:10] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/73 places, 31/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/73 places, 31/56 transitions.
Product exploration explored 100000 steps with 16309 reset in 197 ms.
Entered a terminal (fully accepting) state of product in 79588 steps with 12958 reset in 148 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-12 finished in 3085 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(X(X(p1))))))'
Support contains 7 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:11] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 17:23:11] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:11] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-19 17:23:11] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 125 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 5}]], initial=6, aps=[p1:(OR (AND (GEQ s32 1) (GEQ s56 1)) (AND (GEQ s33 1) (GEQ s57 1)) (AND (GEQ s31 1) (GEQ s55 1))), p0:(OR (AND (OR (AND (GEQ s32 1) (GEQ s56 1)) (AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-13 finished in 403 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F(p1)))))'
Support contains 11 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:11] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-19 17:23:11] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:23:11] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 17:23:11] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 119 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 0 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s67 1), p1:(OR (AND (OR (LT s0 1) (LT s47 1)) (OR (LT s0 1) (LT s48 1)) (OR (LT s0 1) (LT s46 1))) (AND (GEQ s39 1) (GEQ s54 1)) (AND (GEQ s38 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 188 ms.
Product exploration explored 100000 steps with 33333 reset in 134 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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), (X (X p1)), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 6 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-15 finished in 833 ms.
All properties solved by simple procedures.
Total runtime 9655 ms.

BK_STOP 1652980992994

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-02"
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-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-02, 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 r168-tall-165277017300900"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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