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-165277017300907.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-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017300907
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 7.2K Apr 30 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 13:20 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.5K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 61K 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-06-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652981021619

Running Version 202205111006
[2022-05-19 17:23:42] [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:23:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:23:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 17:23:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 17:23:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 595 ms
[2022-05-19 17:23:43] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 17:23:43] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 9 ms.
[2022-05-19 17:23:43] [INFO ] Skeletonized 14 HLPN properties in 0 ms.
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-12 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 9 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 754 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10001 steps, including 247 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10002 steps, including 346 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 17:23:44] [INFO ] Computed 5 place invariants in 11 ms
[2022-05-19 17:23:44] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 17:23:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2022-05-19 17:23:44] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 17:23:44] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-19 17:23:44] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 85 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 2 properties in 2 ms.
[2022-05-19 17:23:44] [INFO ] Flatten gal took : 18 ms
[2022-05-19 17:23:44] [INFO ] Flatten gal took : 5 ms
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2022-05-19 17:23:44] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 10 ms.
[2022-05-19 17:23:44] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 211 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Applied a total of 0 rules in 9 ms. Remains 270 /270 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 270 cols
[2022-05-19 17:23:44] [INFO ] Computed 155 place invariants in 10 ms
[2022-05-19 17:23:44] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 116 rows 270 cols
[2022-05-19 17:23:44] [INFO ] Computed 155 place invariants in 8 ms
[2022-05-19 17:23:44] [INFO ] Implicit Places using invariants and state equation in 194 ms returned [200, 201, 202, 203, 204, 205, 206]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 317 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/270 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 263 /263 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 263/270 places, 116/116 transitions.
Support contains 211 out of 263 places after structural reductions.
[2022-05-19 17:23:44] [INFO ] Flatten gal took : 22 ms
[2022-05-19 17:23:44] [INFO ] Flatten gal took : 18 ms
[2022-05-19 17:23:44] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 10000 steps, including 982 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 176 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 222 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 183 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 180 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 167 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 183 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 182 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 222 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 116 rows 263 cols
[2022-05-19 17:23:45] [INFO ] Computed 148 place invariants in 7 ms
[2022-05-19 17:23:46] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-19 17:23:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-05-19 17:23:46] [INFO ] [Nat]Absence check using 10 positive and 138 generalized place invariants in 20 ms returned sat
[2022-05-19 17:23:46] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-19 17:23:47] [INFO ] After 1016ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 444 ms.
[2022-05-19 17:23:47] [INFO ] After 1657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Finished Parikh walk after 62 steps, including 0 resets, run visited all 12 properties in 6 ms. (steps per millisecond=10 )
Parikh walk visited 12 properties in 7 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 263 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 263 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)||G(F(X(F(p1))))))))'
Support contains 51 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 245 transition count 116
Applied a total of 18 rules in 16 ms. Remains 245 /263 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2022-05-19 17:23:47] [INFO ] Computed 132 place invariants in 8 ms
[2022-05-19 17:23:48] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 116 rows 245 cols
[2022-05-19 17:23:48] [INFO ] Computed 132 place invariants in 4 ms
[2022-05-19 17:23:48] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 245 cols
[2022-05-19 17:23:48] [INFO ] Computed 132 place invariants in 28 ms
[2022-05-19 17:23:48] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/263 places, 116/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 245/263 places, 116/116 transitions.
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s242 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2968 steps with 291 reset in 42 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-04 finished in 1025 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(!(p1 U p1))))'
Support contains 14 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 116/116 transitions.
Graph (complete) has 804 edges and 263 vertex of which 244 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.5 ms
Discarding 19 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 241 transition count 111
Applied a total of 5 rules in 41 ms. Remains 241 /263 variables (removed 22) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2022-05-19 17:23:48] [INFO ] Computed 132 place invariants in 4 ms
[2022-05-19 17:23:49] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 111 rows 241 cols
[2022-05-19 17:23:49] [INFO ] Computed 132 place invariants in 2 ms
[2022-05-19 17:23:49] [INFO ] Implicit Places using invariants and state equation in 227 ms returned [176, 177, 178, 179, 180, 181, 182]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 351 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/263 places, 111/116 transitions.
Applied a total of 0 rules in 10 ms. Remains 234 /234 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 234/263 places, 111/116 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 (ADD s204 s205 s206 s207 s208 s209 s210)), p0:(LEQ 2 (ADD s227 s228 s229 s230 s231 s232 s233))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10247 reset in 293 ms.
Product exploration explored 100000 steps with 10250 reset in 218 ms.
Computed a total of 234 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 234 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 318 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND p1 (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 1021 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Finished probabilistic random walk after 722 steps, run visited all 2 properties in 10 ms. (steps per millisecond=72 )
Probabilistic random walk after 722 steps, saw 672 distinct states, run finished after 10 ms. (steps per millisecond=72 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 7 factoid took 264 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(AND p1 (NOT p0)), (NOT p0)]
Support contains 14 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 111/111 transitions.
Applied a total of 0 rules in 14 ms. Remains 234 /234 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 234 cols
[2022-05-19 17:23:50] [INFO ] Computed 126 place invariants in 2 ms
[2022-05-19 17:23:51] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 111 rows 234 cols
[2022-05-19 17:23:51] [INFO ] Computed 126 place invariants in 1 ms
[2022-05-19 17:23:51] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2022-05-19 17:23:51] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 111 rows 234 cols
[2022-05-19 17:23:51] [INFO ] Computed 126 place invariants in 2 ms
[2022-05-19 17:23:51] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 234/234 places, 111/111 transitions.
Computed a total of 234 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 234 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 270 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND p1 (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 1023 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Finished probabilistic random walk after 722 steps, run visited all 2 properties in 8 ms. (steps per millisecond=90 )
Probabilistic random walk after 722 steps, saw 672 distinct states, run finished after 9 ms. (steps per millisecond=80 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(AND p1 (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 10239 reset in 176 ms.
Product exploration explored 100000 steps with 10253 reset in 194 ms.
Built C files in :
/tmp/ltsmin5213121301602339623
[2022-05-19 17:23:52] [INFO ] Computing symmetric may disable matrix : 111 transitions.
[2022-05-19 17:23:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:23:52] [INFO ] Computing symmetric may enable matrix : 111 transitions.
[2022-05-19 17:23:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:23:52] [INFO ] Computing Do-Not-Accords matrix : 111 transitions.
[2022-05-19 17:23:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:23:52] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5213121301602339623
Running compilation step : cd /tmp/ltsmin5213121301602339623;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 339 ms.
Running link step : cd /tmp/ltsmin5213121301602339623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5213121301602339623;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8321765284175264716.hoa' '--buchi-type=spotba'
LTSmin run took 700 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-05 finished in 4968 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!G(p0)) U !F(X(p1))))'
Support contains 58 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 116/116 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 247 transition count 116
Applied a total of 16 rules in 2 ms. Remains 247 /263 variables (removed 16) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 247 cols
[2022-05-19 17:23:53] [INFO ] Computed 133 place invariants in 3 ms
[2022-05-19 17:23:54] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 116 rows 247 cols
[2022-05-19 17:23:54] [INFO ] Computed 133 place invariants in 2 ms
[2022-05-19 17:23:54] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 247 cols
[2022-05-19 17:23:54] [INFO ] Computed 133 place invariants in 2 ms
[2022-05-19 17:23:54] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 247/263 places, 116/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 247/263 places, 116/116 transitions.
Stuttering acceptance computed with spot in 127 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GT s1 s2) (LEQ (ADD s220 s221 s222 s223 s224 s225 s226) s2)), p0:(LEQ 1 (ADD s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9835 reset in 215 ms.
Product exploration explored 100000 steps with 9830 reset in 132 ms.
Computed a total of 247 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 247 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 440 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 983 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 171 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Finished probabilistic random walk after 572 steps, run visited all 4 properties in 15 ms. (steps per millisecond=38 )
Probabilistic random walk after 572 steps, saw 531 distinct states, run finished after 15 ms. (steps per millisecond=38 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p1), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 345 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Support contains 58 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 247 /247 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 247 cols
[2022-05-19 17:23:56] [INFO ] Computed 133 place invariants in 3 ms
[2022-05-19 17:23:57] [INFO ] Implicit Places using invariants in 1101 ms returned []
// Phase 1: matrix 116 rows 247 cols
[2022-05-19 17:23:57] [INFO ] Computed 133 place invariants in 2 ms
[2022-05-19 17:23:57] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 247 cols
[2022-05-19 17:23:57] [INFO ] Computed 133 place invariants in 3 ms
[2022-05-19 17:23:57] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 247/247 places, 116/116 transitions.
Computed a total of 247 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 247 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 333 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 154 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 984 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 181 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Finished probabilistic random walk after 572 steps, run visited all 4 properties in 15 ms. (steps per millisecond=38 )
Probabilistic random walk after 572 steps, saw 531 distinct states, run finished after 15 ms. (steps per millisecond=38 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p1), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 485 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 9831 reset in 117 ms.
Product exploration explored 100000 steps with 9831 reset in 129 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 152 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Support contains 58 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 116/116 transitions.
Graph (complete) has 728 edges and 247 vertex of which 239 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 239 transition count 116
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 18 ms. Remains 239 /247 variables (removed 8) and now considering 116/116 (removed 0) transitions.
[2022-05-19 17:24:00] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 116 rows 239 cols
[2022-05-19 17:24:00] [INFO ] Computed 127 place invariants in 2 ms
[2022-05-19 17:24:00] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/247 places, 116/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 239/247 places, 116/116 transitions.
Product exploration explored 100000 steps with 9833 reset in 279 ms.
Product exploration explored 100000 steps with 9834 reset in 301 ms.
Built C files in :
/tmp/ltsmin9765904245761867403
[2022-05-19 17:24:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9765904245761867403
Running compilation step : cd /tmp/ltsmin9765904245761867403;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 255 ms.
Running link step : cd /tmp/ltsmin9765904245761867403;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9765904245761867403;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased434949616308575615.hoa' '--buchi-type=spotba'
LTSmin run took 2116 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-06 finished in 9761 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((G(F(X(p0)))&&G(p1))))))'
Support contains 99 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 116/116 transitions.
Graph (complete) has 804 edges and 263 vertex of which 246 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 0 output 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 243 transition count 113
Applied a total of 5 rules in 14 ms. Remains 243 /263 variables (removed 20) and now considering 113/116 (removed 3) transitions.
// Phase 1: matrix 113 rows 243 cols
[2022-05-19 17:24:03] [INFO ] Computed 132 place invariants in 4 ms
[2022-05-19 17:24:03] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 113 rows 243 cols
[2022-05-19 17:24:03] [INFO ] Computed 132 place invariants in 6 ms
[2022-05-19 17:24:03] [INFO ] Implicit Places using invariants and state equation in 181 ms returned [183, 184, 185, 186, 187, 188, 189]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 276 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/263 places, 113/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 236/263 places, 113/116 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-08 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 s235 (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-08 finished in 374 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 56 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 116/116 transitions.
Graph (complete) has 804 edges and 263 vertex of which 237 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.3 ms
Discarding 26 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 234 transition count 111
Applied a total of 5 rules in 15 ms. Remains 234 /263 variables (removed 29) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 234 cols
[2022-05-19 17:24:04] [INFO ] Computed 126 place invariants in 3 ms
[2022-05-19 17:24:04] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 111 rows 234 cols
[2022-05-19 17:24:04] [INFO ] Computed 126 place invariants in 6 ms
[2022-05-19 17:24:04] [INFO ] Implicit Places using invariants and state equation in 215 ms returned [176, 177, 178, 179, 180, 181, 182]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 326 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/263 places, 111/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 227/263 places, 111/116 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-09 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 (ADD s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 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 10234 reset in 256 ms.
Product exploration explored 100000 steps with 10259 reset in 278 ms.
Computed a total of 227 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 227 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1025 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 232 steps, run visited all 1 properties in 3 ms. (steps per millisecond=77 )
Probabilistic random walk after 232 steps, saw 217 distinct states, run finished after 3 ms. (steps per millisecond=77 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 56 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 111/111 transitions.
Applied a total of 0 rules in 12 ms. Remains 227 /227 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 227 cols
[2022-05-19 17:24:05] [INFO ] Computed 120 place invariants in 8 ms
[2022-05-19 17:24:05] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 111 rows 227 cols
[2022-05-19 17:24:05] [INFO ] Computed 120 place invariants in 5 ms
[2022-05-19 17:24:05] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2022-05-19 17:24:05] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 111 rows 227 cols
[2022-05-19 17:24:05] [INFO ] Computed 120 place invariants in 12 ms
[2022-05-19 17:24:05] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 227/227 places, 111/111 transitions.
Computed a total of 227 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 227 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1024 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 232 steps, run visited all 1 properties in 3 ms. (steps per millisecond=77 )
Probabilistic random walk after 232 steps, saw 217 distinct states, run finished after 3 ms. (steps per millisecond=77 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10257 reset in 234 ms.
Product exploration explored 100000 steps with 10239 reset in 241 ms.
Built C files in :
/tmp/ltsmin4703988863275042401
[2022-05-19 17:24:07] [INFO ] Computing symmetric may disable matrix : 111 transitions.
[2022-05-19 17:24:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:24:07] [INFO ] Computing symmetric may enable matrix : 111 transitions.
[2022-05-19 17:24:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:24:07] [INFO ] Computing Do-Not-Accords matrix : 111 transitions.
[2022-05-19 17:24:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:24:07] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4703988863275042401
Running compilation step : cd /tmp/ltsmin4703988863275042401;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 283 ms.
Running link step : cd /tmp/ltsmin4703988863275042401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4703988863275042401;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7497826033975045981.hoa' '--buchi-type=spotba'
LTSmin run took 345 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-09 finished in 3710 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 23 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 116/116 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 252 transition count 116
Applied a total of 11 rules in 4 ms. Remains 252 /263 variables (removed 11) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 17:24:07] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-19 17:24:07] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 17:24:07] [INFO ] Computed 138 place invariants in 8 ms
[2022-05-19 17:24:08] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 17:24:08] [INFO ] Computed 138 place invariants in 8 ms
[2022-05-19 17:24:08] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/263 places, 116/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 252/263 places, 116/116 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-13 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 s241 (ADD s169 s170 s171 s172 s173 s174 s175)) (GT 2 (ADD s245 s246 s247 s248 s249 s250 s251)) (GT s0 (ADD s190 s191 s192 s193 s194 s195 s196)...], 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-06-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-13 finished in 580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(X(p0))||X(p1)||p2))||F(p3)))'
Support contains 78 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 116/116 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 253 transition count 116
Applied a total of 10 rules in 7 ms. Remains 253 /263 variables (removed 10) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2022-05-19 17:24:08] [INFO ] Computed 138 place invariants in 5 ms
[2022-05-19 17:24:08] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 116 rows 253 cols
[2022-05-19 17:24:08] [INFO ] Computed 138 place invariants in 4 ms
[2022-05-19 17:24:08] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 253 cols
[2022-05-19 17:24:08] [INFO ] Computed 138 place invariants in 1 ms
[2022-05-19 17:24:08] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/263 places, 116/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 253/263 places, 116/116 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) p2 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(LEQ 1 (ADD s240 s241 s242 s243 s244 s245 s246)), p2:(GT s1 (ADD s205 s206 s207 s208 s209 s210 s211)), p1:(GT (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-15 finished in 597 ms.
All properties solved by simple procedures.
Total runtime 26141 ms.

BK_STOP 1652981049356

--------------------
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-06"
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-06, 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-165277017300907"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 execution
cd execution
if [ "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 ;