Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 7.4K Apr 13 03:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 13 03:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 13 03:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 13 03:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 13 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 34K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716762225885

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-02
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-26 22:23:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 22:23:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:23:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 22:23:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 22:23:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 463 ms
[2024-05-26 22:23:48] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 22:23:48] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2024-05-26 22:23:48] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 15 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 1327 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 24) seen :18
Incomplete Best-First random walk after 10001 steps, including 741 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 712 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 706 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 698 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 708 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 707 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 26 rows 30 cols
[2024-05-26 22:23:49] [INFO ] Computed 5 invariants in 5 ms
[2024-05-26 22:23:49] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-26 22:23:49] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-26 22:23:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-26 22:23:49] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-26 22:23:49] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-26 22:23:49] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 2 properties in 3 ms.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 26/26 transitions.
Graph (complete) has 50 edges and 30 vertex of which 25 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 25 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 24 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 22 transition count 12
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 2 with 2 rules applied. Total rules applied 20 place count 21 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 20 transition count 10
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 19 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 18 transition count 9
Applied a total of 23 rules in 15 ms. Remains 18 /30 variables (removed 12) and now considering 9/26 (removed 17) transitions.
// Phase 1: matrix 9 rows 18 cols
[2024-05-26 22:23:49] [INFO ] Computed 9 invariants in 0 ms
[2024-05-26 22:23:49] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 18/30 places, 9/26 transitions.
Finished random walk after 86 steps, including 3 resets, run visited all 2 properties in 1 ms. (steps per millisecond=86 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-26 22:23:49] [INFO ] Flatten gal took : 39 ms
[2024-05-26 22:23:49] [INFO ] Flatten gal took : 5 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2024-05-26 22:23:49] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 6 ms.
[2024-05-26 22:23:49] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Support contains 75 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Applied a total of 0 rules in 0 ms. Remains 86 /86 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 86 cols
[2024-05-26 22:23:49] [INFO ] Computed 31 invariants in 3 ms
[2024-05-26 22:23:49] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-26 22:23:49] [INFO ] Invariant cache hit.
[2024-05-26 22:23:49] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-26 22:23:49] [INFO ] Invariant cache hit.
[2024-05-26 22:23:49] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 86/86 places, 56/56 transitions.
Support contains 75 out of 86 places after structural reductions.
[2024-05-26 22:23:50] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:23:50] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:23:50] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 1640 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 24) seen :8
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-05-26 22:23:50] [INFO ] Invariant cache hit.
[2024-05-26 22:23:50] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-26 22:23:50] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-26 22:23:50] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:15
[2024-05-26 22:23:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-26 22:23:50] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-26 22:23:50] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :14
[2024-05-26 22:23:50] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :14
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-26 22:23:50] [INFO ] After 372ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :14
Fused 16 Parikh solutions to 12 different solutions.
Finished Parikh walk after 30 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 12 properties in 9 ms.
Support contains 12 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 74 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 68 transition count 24
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 42 place count 63 transition count 24
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 42 place count 63 transition count 15
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 68 place count 46 transition count 15
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 46 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 45 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 70 place count 45 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 73 place count 43 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 85 place count 34 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 33 transition count 9
Ensure Unique test removed 3 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 89 place count 30 transition count 9
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 92 place count 27 transition count 6
Ensure Unique test removed 9 places
Iterating post reduction 5 with 9 rules applied. Total rules applied 101 place count 18 transition count 6
Applied a total of 101 rules in 8 ms. Remains 18 /86 variables (removed 68) and now considering 6/56 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 18/86 places, 6/56 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 86 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 35 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.0 ms
Discarding 51 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Reduce places removed 1 places and 1 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 29
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 34 transition count 29
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 33 transition count 28
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 33 transition count 28
Applied a total of 16 rules in 5 ms. Remains 33 /86 variables (removed 53) and now considering 28/56 (removed 28) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-05-26 22:23:51] [INFO ] Computed 6 invariants in 1 ms
[2024-05-26 22:23:51] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-26 22:23:51] [INFO ] Invariant cache hit.
[2024-05-26 22:23:51] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [17, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 86 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/86 places, 28/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 30/86 places, 28/56 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 162 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s1)], 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 17919 reset in 179 ms.
Product exploration explored 100000 steps with 17952 reset in 132 ms.
Computed a total of 30 stabilizing places and 28 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 28
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1791 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 388 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Probably explored full state space saw : 238 states, properties seen :0
Probabilistic random walk after 827 steps, saw 238 distinct states, run finished after 7 ms. (steps per millisecond=118 ) properties seen :0
Explored full state space saw : 238 states, properties seen :0
Exhaustive walk after 827 steps, saw 238 distinct states, run finished after 2 ms. (steps per millisecond=413 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 15 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-00 finished in 812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 14 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 2 ms. Remains 76 /86 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2024-05-26 22:23:52] [INFO ] Computed 22 invariants in 3 ms
[2024-05-26 22:23:52] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-26 22:23:52] [INFO ] Invariant cache hit.
[2024-05-26 22:23:52] [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 116 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/86 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 LTL mode , in 2 iterations and 119 ms. Remains : 73/86 places, 56/56 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18) (ADD s49 s50 s51)), p1:(LEQ s68 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 16425 reset in 110 ms.
Product exploration explored 100000 steps with 16446 reset in 177 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 (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 151 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1647 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 666 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 122 steps, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Probabilistic random walk after 122 steps, saw 106 distinct states, run finished after 4 ms. (steps per millisecond=30 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 10 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-01 finished in 1046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 35 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Reduce places removed 1 places and 1 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 29
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 14 place count 33 transition count 28
Applied a total of 14 rules in 6 ms. Remains 33 /86 variables (removed 53) and now considering 28/56 (removed 28) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-05-26 22:23:53] [INFO ] Computed 6 invariants in 1 ms
[2024-05-26 22:23:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-26 22:23:53] [INFO ] Invariant cache hit.
[2024-05-26 22:23:53] [INFO ] Implicit Places using invariants and state equation in 33 ms returned [16, 17, 18]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 67 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/86 places, 28/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 30/86 places, 28/56 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s29 s27)], 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][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-02 finished in 130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||X((G(p1) U (p0&&G(p1)))))))))'
Support contains 7 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 1 ms. Remains 76 /86 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2024-05-26 22:23:53] [INFO ] Computed 22 invariants in 3 ms
[2024-05-26 22:23:53] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-26 22:23:53] [INFO ] Invariant cache hit.
[2024-05-26 22:23:53] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 138 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/86 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 LTL mode , in 2 iterations and 141 ms. Remains : 73/86 places, 56/56 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 0}, { cond=(NOT p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(LEQ s69 (ADD s52 s53 s54)), p0:(LEQ 1 (ADD s37 s38 s39))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-03 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 72 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 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 69 transition count 51
Applied a total of 5 rules in 9 ms. Remains 69 /86 variables (removed 17) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 69 cols
[2024-05-26 22:23:53] [INFO ] Computed 20 invariants in 7 ms
[2024-05-26 22:23:53] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-26 22:23:53] [INFO ] Invariant cache hit.
[2024-05-26 22:23:53] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [40, 41, 42, 46, 47, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 113 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/86 places, 51/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 126 ms. Remains : 63/86 places, 51/56 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-04 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:(LEQ 1 s0)], 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-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-04 finished in 200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((F(p1)&&X((F(p2) U !p0)))))))'
Support contains 13 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 80 transition count 56
Applied a total of 6 rules in 4 ms. Remains 80 /86 variables (removed 6) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 80 cols
[2024-05-26 22:23:53] [INFO ] Computed 26 invariants in 2 ms
[2024-05-26 22:23:53] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-26 22:23:53] [INFO ] Invariant cache hit.
[2024-05-26 22:23:53] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [50, 51, 52]
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 : 77/86 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 77/86 places, 56/56 transitions.
Stuttering acceptance computed with spot in 468 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (NOT p1), p0, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=p0, acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 6}]], initial=0, aps=[p0:(GT (ADD s50 s51 s52) s1), p1:(LEQ (ADD s59 s60 s61) (ADD s35 s36 s37)), p2:(LEQ s1 (ADD s68 s69 s70))], 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17487 reset in 156 ms.
Product exploration explored 100000 steps with 17485 reset in 131 ms.
Computed a total of 77 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 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 p2), (X p0), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 359 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Incomplete random walk after 10000 steps, including 1644 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 561 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 556 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 666 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 56 rows 77 cols
[2024-05-26 22:23:55] [INFO ] Computed 23 invariants in 2 ms
[2024-05-26 22:23:55] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 22:23:55] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 3 ms returned sat
[2024-05-26 22:23:55] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-26 22:23:55] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-26 22:23:55] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 1 ms.
Support contains 7 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 56/56 transitions.
Graph (complete) has 132 edges and 77 vertex of which 64 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 58 transition count 27
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 39 place count 53 transition count 27
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 39 place count 53 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 54 place count 44 transition count 21
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 44 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 43 transition count 20
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 58 place count 41 transition count 18
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 41 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 72 place count 32 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 87 place count 20 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 19 transition count 11
Applied a total of 88 rules in 12 ms. Remains 19 /77 variables (removed 58) and now considering 11/56 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 19/77 places, 11/56 transitions.
Finished random walk after 261 steps, including 54 resets, run visited all 1 properties in 1 ms. (steps per millisecond=261 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT p2)), (F (AND (NOT p2) p0)), (F (NOT (AND p2 p0)))]
Knowledge based reduction with 10 factoid took 754 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Support contains 7 out of 77 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 56/56 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-26 22:23:56] [INFO ] Invariant cache hit.
[2024-05-26 22:23:56] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-26 22:23:56] [INFO ] Invariant cache hit.
[2024-05-26 22:23:56] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-26 22:23:56] [INFO ] Invariant cache hit.
[2024-05-26 22:23:56] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 77/77 places, 56/56 transitions.
Computed a total of 77 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 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 p2 p0), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Incomplete random walk after 10000 steps, including 1641 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 573 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 564 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 666 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 22:23:57] [INFO ] Invariant cache hit.
[2024-05-26 22:23:57] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 22:23:57] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 3 ms returned sat
[2024-05-26 22:23:57] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-26 22:23:57] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-26 22:23:57] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 1 ms.
Support contains 7 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 56/56 transitions.
Graph (complete) has 132 edges and 77 vertex of which 64 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 58 transition count 27
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 39 place count 53 transition count 27
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 39 place count 53 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 54 place count 44 transition count 21
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 44 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 43 transition count 20
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 58 place count 41 transition count 18
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 41 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 72 place count 32 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 87 place count 20 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 19 transition count 11
Applied a total of 88 rules in 11 ms. Remains 19 /77 variables (removed 58) and now considering 11/56 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 19/77 places, 11/56 transitions.
Finished random walk after 102 steps, including 23 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 239 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 17491 reset in 92 ms.
Product exploration explored 100000 steps with 17497 reset in 96 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Support contains 7 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 56/56 transitions.
Graph (complete) has 132 edges and 77 vertex of which 73 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
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 73 transition count 56
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 10 ms. Remains 73 /77 variables (removed 4) and now considering 56/56 (removed 0) transitions.
[2024-05-26 22:23:59] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2024-05-26 22:23:59] [INFO ] Computed 21 invariants in 2 ms
[2024-05-26 22:23:59] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/77 places, 56/56 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 73/77 places, 56/56 transitions.
Built C files in :
/tmp/ltsmin2790177236384859721
[2024-05-26 22:23:59] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2790177236384859721
Running compilation step : cd /tmp/ltsmin2790177236384859721;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 230 ms.
Running link step : cd /tmp/ltsmin2790177236384859721;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2790177236384859721;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15450458411664050579.hoa' '--buchi-type=spotba'
LTSmin run took 220 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-05 finished in 6138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((F(p1)||X(G(p2))))))'
Support contains 8 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 2 ms. Remains 76 /86 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2024-05-26 22:23:59] [INFO ] Computed 22 invariants in 1 ms
[2024-05-26 22:23:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-26 22:23:59] [INFO ] Invariant cache hit.
[2024-05-26 22:24:00] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 100 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/86 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 LTL mode , in 2 iterations and 103 ms. Remains : 73/86 places, 56/56 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), false]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(GT s69 (ADD s61 s62 s63)), p1:(LEQ 3 (ADD s55 s56 s57)), p2:(LEQ 2 s70)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-06 finished in 352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 45 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Discarding 41 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 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 1 with 4 rules applied. Total rules applied 13 place count 42 transition count 34
Applied a total of 13 rules in 3 ms. Remains 42 /86 variables (removed 44) and now considering 34/56 (removed 22) transitions.
// Phase 1: matrix 34 rows 42 cols
[2024-05-26 22:24:00] [INFO ] Computed 10 invariants in 2 ms
[2024-05-26 22:24:00] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-26 22:24:00] [INFO ] Invariant cache hit.
[2024-05-26 22:24:00] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [22, 23, 24, 25, 26, 27]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 73 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/86 places, 34/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 36/86 places, 34/56 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-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:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9))], 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-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-07 finished in 124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 10 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 73 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 53
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 72 transition count 53
Applied a total of 4 rules in 11 ms. Remains 72 /86 variables (removed 14) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 72 cols
[2024-05-26 22:24:00] [INFO ] Computed 21 invariants in 2 ms
[2024-05-26 22:24:00] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-26 22:24:00] [INFO ] Invariant cache hit.
[2024-05-26 22:24:00] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 110 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/86 places, 53/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 69/86 places, 53/56 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 1 s1) (LEQ 2 (ADD s29 s30 s31)) (LEQ (ADD s41 s42 s43) (ADD s44 s45 s46))), p1:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 17514 reset in 81 ms.
Product exploration explored 100000 steps with 17510 reset in 135 ms.
Computed a total of 69 stabilizing places and 53 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 69 transition count 53
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 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 13 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 340 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 10 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 53/53 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 53/53 (removed 0) transitions.
// Phase 1: matrix 53 rows 69 cols
[2024-05-26 22:24:01] [INFO ] Computed 18 invariants in 0 ms
[2024-05-26 22:24:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-26 22:24:01] [INFO ] Invariant cache hit.
[2024-05-26 22:24:01] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-26 22:24:01] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-26 22:24:01] [INFO ] Invariant cache hit.
[2024-05-26 22:24:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 69/69 places, 53/53 transitions.
Computed a total of 69 stabilizing places and 53 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 69 transition count 53
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 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17508 reset in 103 ms.
Product exploration explored 100000 steps with 17493 reset in 123 ms.
Built C files in :
/tmp/ltsmin11687995420323720155
[2024-05-26 22:24:03] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2024-05-26 22:24:03] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:24:03] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2024-05-26 22:24:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:24:03] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2024-05-26 22:24:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:24:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11687995420323720155
Running compilation step : cd /tmp/ltsmin11687995420323720155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 126 ms.
Running link step : cd /tmp/ltsmin11687995420323720155;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11687995420323720155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15412771429720987232.hoa' '--buchi-type=spotba'
LTSmin run took 71 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-10 finished in 2917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 7 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 79 transition count 56
Applied a total of 7 rules in 1 ms. Remains 79 /86 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 79 cols
[2024-05-26 22:24:03] [INFO ] Computed 25 invariants in 1 ms
[2024-05-26 22:24:03] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-26 22:24:03] [INFO ] Invariant cache hit.
[2024-05-26 22:24:03] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-26 22:24:03] [INFO ] Invariant cache hit.
[2024-05-26 22:24:03] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/86 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 79/86 places, 56/56 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GT s73 (ADD s49 s50 s51)) (GT 3 (ADD s70 s71 s72)))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-11 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 9 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 57 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.0 ms
Discarding 29 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 56 transition count 42
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 1 with 4 rules applied. Total rules applied 10 place count 54 transition count 40
Applied a total of 10 rules in 6 ms. Remains 54 /86 variables (removed 32) and now considering 40/56 (removed 16) transitions.
// Phase 1: matrix 40 rows 54 cols
[2024-05-26 22:24:03] [INFO ] Computed 16 invariants in 1 ms
[2024-05-26 22:24:03] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-26 22:24:03] [INFO ] Invariant cache hit.
[2024-05-26 22:24:03] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [31, 32, 33, 34, 35, 36]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 79 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/86 places, 40/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 48/86 places, 40/56 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9))], 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][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-12 finished in 132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((p1&&X(X(F(p2))))))))'
Support contains 15 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 82 transition count 56
Applied a total of 4 rules in 2 ms. Remains 82 /86 variables (removed 4) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 82 cols
[2024-05-26 22:24:03] [INFO ] Computed 28 invariants in 2 ms
[2024-05-26 22:24:03] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-26 22:24:03] [INFO ] Invariant cache hit.
[2024-05-26 22:24:03] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 108 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/86 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 79/86 places, 56/56 transitions.
Stuttering acceptance computed with spot in 433 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(GT 1 (ADD s49 s50 s51)), p1:(GT (ADD s34 s35 s36) (ADD s55 s56 s57)), p0:(GT (ADD s67 s68 s69) (ADD s76 s77 s78))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, 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-02-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-13 finished in 565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 12 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 75 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 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 72 transition count 51
Applied a total of 5 rules in 11 ms. Remains 72 /86 variables (removed 14) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 72 cols
[2024-05-26 22:24:04] [INFO ] Computed 23 invariants in 2 ms
[2024-05-26 22:24:04] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-26 22:24:04] [INFO ] Invariant cache hit.
[2024-05-26 22:24:04] [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 111 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/86 places, 51/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 66/86 places, 51/56 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ (ADD s63 s64 s65) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9)), p0:(LEQ 3 (ADD s63 s64 s65))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 18732 reset in 135 ms.
Product exploration explored 100000 steps with 18758 reset in 128 ms.
Computed a total of 66 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 1882 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Probably explored full state space saw : 455 states, properties seen :1
Probabilistic random walk after 1567 steps, saw 455 distinct states, run finished after 18 ms. (steps per millisecond=87 ) properties seen :1
Explored full state space saw : 455 states, properties seen :0
Exhaustive walk after 1567 steps, saw 455 distinct states, run finished after 8 ms. (steps per millisecond=195 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 205 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Support contains 12 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 66 cols
[2024-05-26 22:24:05] [INFO ] Computed 18 invariants in 2 ms
[2024-05-26 22:24:05] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-26 22:24:05] [INFO ] Invariant cache hit.
[2024-05-26 22:24:05] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-26 22:24:05] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-26 22:24:05] [INFO ] Invariant cache hit.
[2024-05-26 22:24:05] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 66/66 places, 51/51 transitions.
Computed a total of 66 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1873 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 466 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 174 steps, run visited all 1 properties in 3 ms. (steps per millisecond=58 )
Probabilistic random walk after 174 steps, saw 151 distinct states, run finished after 3 ms. (steps per millisecond=58 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 18779 reset in 83 ms.
Product exploration explored 100000 steps with 18774 reset in 86 ms.
Built C files in :
/tmp/ltsmin18345405172993402415
[2024-05-26 22:24:06] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2024-05-26 22:24:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:24:06] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2024-05-26 22:24:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:24:06] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2024-05-26 22:24:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:24:06] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18345405172993402415
Running compilation step : cd /tmp/ltsmin18345405172993402415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 143 ms.
Running link step : cd /tmp/ltsmin18345405172993402415;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18345405172993402415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1024347955107725809.hoa' '--buchi-type=spotba'
LTSmin run took 61 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-14 finished in 2584 ms.
All properties solved by simple procedures.
Total runtime 19167 ms.

BK_STOP 1716762248275

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is QuasiCertifProtocol-COL-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662361300002"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;