Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 6.1K Apr 30 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 13:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 13:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 72K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652981622210

Running Version 202205111006
[2022-05-19 17:33:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 17:33:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:33:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 17:33:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 17:33:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 586 ms
[2022-05-19 17:33:44] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 17:33:44] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2022-05-19 17:33:44] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10001 steps, including 554 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 20) seen :5
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 17:33:44] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-19 17:33:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:33:44] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-19 17:33:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-19 17:33:45] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :11
[2022-05-19 17:33:45] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :11
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-19 17:33:45] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :11
Fused 15 Parikh solutions to 9 different solutions.
Finished Parikh walk after 45 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=15 )
Parikh walk visited 11 properties in 15 ms.
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 17:33:45] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2022-05-19 17:33:45] [INFO ] Flatten gal took : 16 ms
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 17:33:45] [INFO ] Flatten gal took : 5 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2022-05-19 17:33:45] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 12 ms.
[2022-05-19 17:33:45] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Support contains 356 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 547 transition count 176
Applied a total of 3 rules in 18 ms. Remains 547 /550 variables (removed 3) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 547 cols
[2022-05-19 17:33:45] [INFO ] Computed 372 place invariants in 32 ms
[2022-05-19 17:33:45] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 176 rows 547 cols
[2022-05-19 17:33:45] [INFO ] Computed 372 place invariants in 7 ms
[2022-05-19 17:33:45] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 547 cols
[2022-05-19 17:33:45] [INFO ] Computed 372 place invariants in 6 ms
[2022-05-19 17:33:46] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 547/550 places, 176/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 547/550 places, 176/176 transitions.
Support contains 356 out of 547 places after structural reductions.
[2022-05-19 17:33:46] [INFO ] Flatten gal took : 39 ms
[2022-05-19 17:33:46] [INFO ] Flatten gal took : 33 ms
[2022-05-19 17:33:46] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 694 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :4
Running SMT prover for 10 properties.
// Phase 1: matrix 176 rows 547 cols
[2022-05-19 17:33:47] [INFO ] Computed 372 place invariants in 9 ms
[2022-05-19 17:33:48] [INFO ] [Real]Absence check using 0 positive and 372 generalized place invariants in 54 ms returned sat
[2022-05-19 17:33:48] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-19 17:33:48] [INFO ] [Nat]Absence check using 0 positive and 372 generalized place invariants in 61 ms returned sat
[2022-05-19 17:33:49] [INFO ] After 1323ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2022-05-19 17:33:51] [INFO ] After 2727ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 1214 ms.
[2022-05-19 17:33:52] [INFO ] After 4254ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 79 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=19 )
Parikh walk visited 9 properties in 14 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 547 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 547 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(F(p0) U G(p1)))))'
Support contains 133 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 176/176 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 524 transition count 176
Applied a total of 23 rules in 27 ms. Remains 524 /547 variables (removed 23) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:33:52] [INFO ] Computed 350 place invariants in 23 ms
[2022-05-19 17:33:52] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 176 rows 524 cols
[2022-05-19 17:33:52] [INFO ] Computed 350 place invariants in 11 ms
[2022-05-19 17:33:53] [INFO ] Implicit Places using invariants and state equation in 487 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 812 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/547 places, 176/176 transitions.
Applied a total of 0 rules in 19 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 513/547 places, 176/176 transitions.
Stuttering acceptance computed with spot in 294 ms :[p1, p1, p1, (AND p0 p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 (ADD s375 s376 s377 s378 s379 s380 s381 s382 s383 s384 s385)), p1:(AND (LEQ 2 (ADD s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6930 reset in 314 ms.
Product exploration explored 100000 steps with 6925 reset in 227 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 8 factoid took 227 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-00 finished in 2094 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U X(G(F((X(p0)||p1))))))'
Support contains 23 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 176/176 transitions.
Graph (complete) has 2316 edges and 547 vertex of which 59 are kept as prefixes of interest. Removing 488 places using SCC suffix rule.6 ms
Discarding 488 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 58 transition count 49
Applied a total of 55 rules in 13 ms. Remains 58 /547 variables (removed 489) and now considering 49/176 (removed 127) transitions.
// Phase 1: matrix 49 rows 58 cols
[2022-05-19 17:33:54] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 17:33:54] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 49 rows 58 cols
[2022-05-19 17:33:54] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 17:33:54] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 111 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/547 places, 49/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 47/547 places, 49/176 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s45 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11)), p0:(LEQ 2 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6647 reset in 175 ms.
Product exploration explored 100000 steps with 6643 reset in 223 ms.
Computed a total of 47 stabilizing places and 49 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 49
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 (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-03 finished in 866 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G((!F(p0) U p1)))||!p0)))'
Support contains 34 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 176/176 transitions.
Graph (complete) has 2316 edges and 547 vertex of which 535 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.6 ms
Discarding 12 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 533 transition count 174
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 533 transition count 174
Applied a total of 4 rules in 60 ms. Remains 533 /547 variables (removed 14) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 533 cols
[2022-05-19 17:33:55] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 17:33:56] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 174 rows 533 cols
[2022-05-19 17:33:56] [INFO ] Computed 361 place invariants in 2 ms
[2022-05-19 17:33:56] [INFO ] Implicit Places using invariants and state equation in 628 ms returned [419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 1036 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 511/547 places, 174/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 511 /511 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 511/547 places, 174/176 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s496 s497 s498 s499 s500 s501 s502 s503 s504 s505 s506) s507), p1:(GT (ADD s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429) (ADD s474 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-04 finished in 1156 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(X(X(F(p0))))&&p0) U X(p1)))'
Support contains 22 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 176/176 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 546 transition count 176
Applied a total of 1 rules in 7 ms. Remains 546 /547 variables (removed 1) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 546 cols
[2022-05-19 17:33:56] [INFO ] Computed 372 place invariants in 4 ms
[2022-05-19 17:33:57] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 176 rows 546 cols
[2022-05-19 17:33:57] [INFO ] Computed 372 place invariants in 4 ms
[2022-05-19 17:33:57] [INFO ] Implicit Places using invariants and state equation in 562 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 922 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 535/547 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 535 /535 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 535/547 places, 176/176 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0), p0, true]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 (ADD s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517)), p1:(LEQ (ADD s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517) (ADD s524 s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 459 ms.
Product exploration explored 100000 steps with 50000 reset in 446 ms.
Computed a total of 535 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 535 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 150 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-10 finished in 2236 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(p0)))))'
Support contains 12 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 176/176 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 536 transition count 176
Applied a total of 11 rules in 12 ms. Remains 536 /547 variables (removed 11) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 536 cols
[2022-05-19 17:33:58] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 17:33:59] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 176 rows 536 cols
[2022-05-19 17:33:59] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 17:33:59] [INFO ] Implicit Places using invariants and state equation in 662 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1029 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 525/547 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 525 /525 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 525/547 places, 176/176 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT (ADD s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517) s524)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-11 finished in 1152 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(G((F(X(p0))&&X(p1))))))))'
Support contains 143 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 176/176 transitions.
Graph (complete) has 2316 edges and 547 vertex of which 512 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.7 ms
Discarding 35 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 509 transition count 171
Applied a total of 5 rules in 24 ms. Remains 509 /547 variables (removed 38) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 509 cols
[2022-05-19 17:34:00] [INFO ] Computed 340 place invariants in 12 ms
[2022-05-19 17:34:00] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 171 rows 509 cols
[2022-05-19 17:34:00] [INFO ] Computed 340 place invariants in 12 ms
[2022-05-19 17:34:00] [INFO ] Implicit Places using invariants and state equation in 387 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 669 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/547 places, 171/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 498/547 places, 171/176 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 (ADD s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418)), p0:(GT (ADD s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-14 finished in 788 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F((G((p0 U p1))||X(G(F(p2)))))))))'
Support contains 155 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 176/176 transitions.
Graph (complete) has 2316 edges and 547 vertex of which 512 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 511 transition count 173
Applied a total of 2 rules in 19 ms. Remains 511 /547 variables (removed 36) and now considering 173/176 (removed 3) transitions.
// Phase 1: matrix 173 rows 511 cols
[2022-05-19 17:34:00] [INFO ] Computed 340 place invariants in 6 ms
[2022-05-19 17:34:01] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 173 rows 511 cols
[2022-05-19 17:34:01] [INFO ] Computed 340 place invariants in 7 ms
[2022-05-19 17:34:01] [INFO ] Implicit Places using invariants and state equation in 450 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 720 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 489/547 places, 173/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 489 /489 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 489/547 places, 173/176 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 2 (ADD s375 s376 s377 s378 s379 s380 s381 s382 s383 s384 s385)), p1:(LEQ s487 (ADD s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374)), p0:(L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6771 reset in 210 ms.
Product exploration explored 100000 steps with 6778 reset in 235 ms.
Computed a total of 489 stabilizing places and 173 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 489 transition count 173
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 10 factoid took 241 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-15 finished in 1641 ms.
All properties solved by simple procedures.
Total runtime 19147 ms.

BK_STOP 1652981642905

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-10, 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 r168-tall-165277017400915"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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