Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r295-tall-167873948400811.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r295-tall-167873948400811
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-06-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 1678912485970

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 20:34:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 20:34:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 20:34:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 20:34:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 20:34:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 658 ms
[2023-03-15 20:34:48] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 20:34:48] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 7 ms.
[2023-03-15 20:34:48] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 758 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 23) seen :19
Incomplete Best-First random walk after 10000 steps, including 348 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 343 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 416 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-15 20:34:48] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-15 20:34:49] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 20:34:49] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-15 20:34:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-15 20:34:49] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-15 20:34:49] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-15 20:34:49] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 20:34:49] [INFO ] Flatten gal took : 17 ms
[2023-03-15 20:34:49] [INFO ] Flatten gal took : 5 ms
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2023-03-15 20:34:49] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 17 ms.
[2023-03-15 20:34:49] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 202 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 263 transition count 116
Applied a total of 7 rules in 11 ms. Remains 263 /270 variables (removed 7) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 263 cols
[2023-03-15 20:34:49] [INFO ] Computed 148 place invariants in 10 ms
[2023-03-15 20:34:49] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-15 20:34:49] [INFO ] Invariant cache hit.
[2023-03-15 20:34:49] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-15 20:34:49] [INFO ] Invariant cache hit.
[2023-03-15 20:34:49] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 263/270 places, 116/116 transitions.
Support contains 202 out of 263 places after structural reductions.
[2023-03-15 20:34:49] [INFO ] Flatten gal took : 25 ms
[2023-03-15 20:34:49] [INFO ] Flatten gal took : 16 ms
[2023-03-15 20:34:49] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 10000 steps, including 984 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 19) seen :5
Incomplete Best-First random walk after 10001 steps, including 222 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 172 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 181 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 179 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 222 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 176 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 181 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 181 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-15 20:34:50] [INFO ] Invariant cache hit.
[2023-03-15 20:34:50] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-15 20:34:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 20:34:50] [INFO ] [Nat]Absence check using 3 positive and 145 generalized place invariants in 23 ms returned sat
[2023-03-15 20:34:51] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-15 20:34:51] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-15 20:34:51] [INFO ] After 853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Finished Parikh walk after 43 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 9 properties in 6 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-11 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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 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 253 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 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 250 transition count 113
Applied a total of 5 rules in 46 ms. Remains 250 /263 variables (removed 13) and now considering 113/116 (removed 3) transitions.
// Phase 1: matrix 113 rows 250 cols
[2023-03-15 20:34:52] [INFO ] Computed 138 place invariants in 16 ms
[2023-03-15 20:34:52] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-15 20:34:52] [INFO ] Invariant cache hit.
[2023-03-15 20:34:52] [INFO ] Implicit Places using invariants and state equation in 207 ms returned [183, 184, 185, 186, 187, 188, 189, 197, 198, 199, 200, 201, 202, 203]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 387 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/263 places, 113/116 transitions.
Applied a total of 0 rules in 17 ms. Remains 236 /236 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 450 ms. Remains : 236/263 places, 113/116 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 s235)], 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 14789 reset in 293 ms.
Product exploration explored 100000 steps with 14780 reset in 204 ms.
Computed a total of 236 stabilizing places and 113 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 236 transition count 113
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 113 rows 236 cols
[2023-03-15 20:34:53] [INFO ] Computed 126 place invariants in 3 ms
[2023-03-15 20:34:53] [INFO ] [Real]Absence check using 0 positive and 126 generalized place invariants in 28 ms returned sat
[2023-03-15 20:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:34:53] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-03-15 20:34:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:34:54] [INFO ] [Nat]Absence check using 0 positive and 126 generalized place invariants in 28 ms returned sat
[2023-03-15 20:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:34:54] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2023-03-15 20:34:54] [INFO ] Computed and/alt/rep : 98/285/98 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 20:34:54] [INFO ] Added : 24 causal constraints over 5 iterations in 81 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 113/113 transitions.
Applied a total of 0 rules in 9 ms. Remains 236 /236 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-15 20:34:54] [INFO ] Invariant cache hit.
[2023-03-15 20:34:54] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-15 20:34:54] [INFO ] Invariant cache hit.
[2023-03-15 20:34:54] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-15 20:34:54] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 20:34:54] [INFO ] Invariant cache hit.
[2023-03-15 20:34:54] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 443 ms. Remains : 236/236 places, 113/113 transitions.
Computed a total of 236 stabilizing places and 113 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 236 transition count 113
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
[2023-03-15 20:34:55] [INFO ] Invariant cache hit.
[2023-03-15 20:34:55] [INFO ] [Real]Absence check using 0 positive and 126 generalized place invariants in 30 ms returned sat
[2023-03-15 20:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:34:55] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-15 20:34:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:34:55] [INFO ] [Nat]Absence check using 0 positive and 126 generalized place invariants in 28 ms returned sat
[2023-03-15 20:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:34:56] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2023-03-15 20:34:56] [INFO ] Computed and/alt/rep : 98/285/98 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-15 20:34:56] [INFO ] Added : 2 causal constraints over 1 iterations in 91 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14777 reset in 155 ms.
Product exploration explored 100000 steps with 14756 reset in 166 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-15 20:34:56] [INFO ] Invariant cache hit.
[2023-03-15 20:34:56] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-15 20:34:56] [INFO ] Invariant cache hit.
[2023-03-15 20:34:56] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-15 20:34:56] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-15 20:34:56] [INFO ] Invariant cache hit.
[2023-03-15 20:34:57] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 483 ms. Remains : 236/236 places, 113/113 transitions.
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-00 finished in 5166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&G((p1&&F(p2))))))))'
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 4 ms. Remains 253 /263 variables (removed 10) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2023-03-15 20:34:57] [INFO ] Computed 139 place invariants in 5 ms
[2023-03-15 20:34:57] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-15 20:34:57] [INFO ] Invariant cache hit.
[2023-03-15 20:34:57] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [198, 199, 200, 201, 202, 203, 204]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 350 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/263 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 356 ms. Remains : 246/263 places, 116/116 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ (ADD s163 s164 s165 s166 s167 s168 s169) (ADD s170 s171 s172 s173 s174 s175 s176)), p0:(LEQ s1 (ADD s198 s199 s200 s201 s202 s203 s204)), p2:(GT (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-03 finished in 654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&X(p2))))'
Support contains 28 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 116/116 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 259 transition count 116
Applied a total of 4 rules in 5 ms. Remains 259 /263 variables (removed 4) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 259 cols
[2023-03-15 20:34:57] [INFO ] Computed 145 place invariants in 2 ms
[2023-03-15 20:34:57] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-15 20:34:57] [INFO ] Invariant cache hit.
[2023-03-15 20:34:58] [INFO ] Implicit Places using invariants and state equation in 227 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 368 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 252/263 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 376 ms. Remains : 252/263 places, 116/116 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT (ADD s204 s205 s206 s207 s208 s209 s210) (ADD s239 s240 s241 s242 s243 s244 s245)), p1:(LEQ 2 (ADD s197 s198 s199 s200 s201 s202 s203)), p2:(LEQ 2 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-04 finished in 695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(!p1||X((p2||F(G(p3))))))))'
Support contains 24 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 116/116 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 254 transition count 116
Applied a total of 9 rules in 2 ms. Remains 254 /263 variables (removed 9) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 254 cols
[2023-03-15 20:34:58] [INFO ] Computed 139 place invariants in 3 ms
[2023-03-15 20:34:58] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-15 20:34:58] [INFO ] Invariant cache hit.
[2023-03-15 20:34:58] [INFO ] Implicit Places using invariants and state equation in 245 ms returned [199, 200, 201, 202, 203, 204, 205]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 468 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/263 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 247 /247 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 472 ms. Remains : 247/263 places, 116/116 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), (OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p3, acceptance={} source=5 dest: 5}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 2 (ADD s234 s235 s236 s237 s238 s239 s240)), p0:(LEQ s2 s1), p2:(GT (ADD s213 s214 s215 s216 s217 s218 s219) (ADD s185 s186 s187 s188 s189 s190 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 83 steps with 27 reset in 5 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-05 finished in 716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 14 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 6 ms. Remains 252 /263 variables (removed 11) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-15 20:34:59] [INFO ] Computed 138 place invariants in 2 ms
[2023-03-15 20:34:59] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-15 20:34:59] [INFO ] Invariant cache hit.
[2023-03-15 20:34:59] [INFO ] Implicit Places using invariants and state equation in 231 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 387 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/263 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 396 ms. Remains : 245/263 places, 116/116 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s155 s156 s157 s158 s159 s160 s161) (ADD s218 s219 s220 s221 s222 s223 s224))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-09 finished in 484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 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
[2023-03-15 20:34:59] [INFO ] Computed 139 place invariants in 5 ms
[2023-03-15 20:34:59] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-15 20:34:59] [INFO ] Invariant cache hit.
[2023-03-15 20:35:00] [INFO ] Implicit Places using invariants and state equation in 219 ms returned [198, 199, 200, 201, 202, 203, 204]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 364 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/263 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 373 ms. Remains : 246/263 places, 116/116 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s226 s227 s228 s229 s230 s231 s232) s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-12 finished in 935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 28 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
[2023-03-15 20:35:00] [INFO ] Computed 138 place invariants in 3 ms
[2023-03-15 20:35:00] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-15 20:35:00] [INFO ] Invariant cache hit.
[2023-03-15 20:35:00] [INFO ] Implicit Places using invariants and state equation in 197 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 328 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/263 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 336 ms. Remains : 245/263 places, 116/116 transitions.
Stuttering acceptance computed with spot in 127 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:(OR (GT 3 (ADD s225 s226 s227 s228 s229 s230 s231)) (LEQ 2 (ADD s155 s156 s157 s158 s159 s160 s161)) (GT (ADD s190 s191 s192 s193 s194 s195 s196) (ADD ...], 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]]
Product exploration explored 100000 steps with 9824 reset in 128 ms.
Product exploration explored 100000 steps with 9833 reset in 164 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 980 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 182 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 367 steps, run visited all 1 properties in 8 ms. (steps per millisecond=45 )
Probabilistic random walk after 367 steps, saw 341 distinct states, run finished after 8 ms. (steps per millisecond=45 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2023-03-15 20:35:02] [INFO ] Computed 132 place invariants in 5 ms
[2023-03-15 20:35:02] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-15 20:35:02] [INFO ] Invariant cache hit.
[2023-03-15 20:35:02] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2023-03-15 20:35:02] [INFO ] Invariant cache hit.
[2023-03-15 20:35:02] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 719 ms. Remains : 245/245 places, 116/116 transitions.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 982 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 367 steps, run visited all 1 properties in 8 ms. (steps per millisecond=45 )
Probabilistic random walk after 367 steps, saw 341 distinct states, run finished after 9 ms. (steps per millisecond=40 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9838 reset in 153 ms.
Product exploration explored 100000 steps with 9836 reset in 125 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Graph (complete) has 677 edges and 245 vertex of which 237 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 237 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 21 ms. Remains 237 /245 variables (removed 8) and now considering 115/116 (removed 1) transitions.
[2023-03-15 20:35:04] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 115 rows 237 cols
[2023-03-15 20:35:04] [INFO ] Computed 126 place invariants in 5 ms
[2023-03-15 20:35:04] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 237/245 places, 115/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 237/245 places, 115/116 transitions.
Support contains 28 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2023-03-15 20:35:04] [INFO ] Computed 132 place invariants in 3 ms
[2023-03-15 20:35:04] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-15 20:35:04] [INFO ] Invariant cache hit.
[2023-03-15 20:35:05] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-15 20:35:05] [INFO ] Invariant cache hit.
[2023-03-15 20:35:05] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 245/245 places, 116/116 transitions.
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-13 finished in 4617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F((p1||G(F(p2))))))))'
Support contains 70 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 3 ms. Remains 252 /263 variables (removed 11) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-15 20:35:05] [INFO ] Computed 138 place invariants in 2 ms
[2023-03-15 20:35:05] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-15 20:35:05] [INFO ] Invariant cache hit.
[2023-03-15 20:35:05] [INFO ] Implicit Places using invariants and state equation in 179 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 298 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/263 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 303 ms. Remains : 245/263 places, 116/116 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 (ADD s169 s170 s171 s172 s173 s174 s175)), p1:(GT 2 (ADD s211 s212 s213 s214 s215 s216 s217)), p2:(GT (ADD s204 s205 s206 s207 s208 s209 s210) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-14 finished in 466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&G(p1))||(p0&&X(p0))))))'
Support contains 14 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 7 ms. Remains 252 /263 variables (removed 11) and now considering 116/116 (removed 0) transitions.
[2023-03-15 20:35:05] [INFO ] Invariant cache hit.
[2023-03-15 20:35:05] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-15 20:35:05] [INFO ] Invariant cache hit.
[2023-03-15 20:35:06] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-15 20:35:06] [INFO ] Invariant cache hit.
[2023-03-15 20:35:06] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/263 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 450 ms. Remains : 252/263 places, 116/116 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 1 (ADD s197 s198 s199 s200 s201 s202 s203)), p1:(GT 3 (ADD s148 s149 s150 s151 s152 s153 s154))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, 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 670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-06-LTLCardinality-13
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 263 places. Attempting structural reductions.
Starting structural reductions in LI_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.4 ms
Discarding 19 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 242 transition count 112
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 242 transition count 112
Applied a total of 4 rules in 21 ms. Remains 242 /263 variables (removed 21) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 242 cols
[2023-03-15 20:35:06] [INFO ] Computed 132 place invariants in 6 ms
[2023-03-15 20:35:06] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-15 20:35:06] [INFO ] Invariant cache hit.
[2023-03-15 20:35:06] [INFO ] Implicit Places using invariants and state equation in 207 ms returned [176, 177, 178, 179, 180, 181, 182, 190, 191, 192, 193, 194, 195, 196]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 336 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 228/263 places, 112/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 228 /228 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 363 ms. Remains : 228/263 places, 112/116 transitions.
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:(OR (GT 3 (ADD s211 s212 s213 s214 s215 s216 s217)) (LEQ 2 (ADD s148 s149 s150 s151 s152 s153 s154)) (GT (ADD s176 s177 s178 s179 s180 s181 s182) (ADD ...], 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10247 reset in 122 ms.
Product exploration explored 100000 steps with 10260 reset in 134 ms.
Computed a total of 228 stabilizing places and 112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 228 transition count 112
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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1028 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 557 steps, run visited all 1 properties in 4 ms. (steps per millisecond=139 )
Probabilistic random walk after 557 steps, saw 378 distinct states, run finished after 4 ms. (steps per millisecond=139 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 112/112 transitions.
Applied a total of 0 rules in 4 ms. Remains 228 /228 variables (removed 0) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 228 cols
[2023-03-15 20:35:07] [INFO ] Computed 120 place invariants in 4 ms
[2023-03-15 20:35:08] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-15 20:35:08] [INFO ] Invariant cache hit.
[2023-03-15 20:35:08] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-15 20:35:08] [INFO ] Invariant cache hit.
[2023-03-15 20:35:08] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 228/228 places, 112/112 transitions.
Computed a total of 228 stabilizing places and 112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 228 transition count 112
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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1025 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 557 steps, run visited all 1 properties in 18 ms. (steps per millisecond=30 )
Probabilistic random walk after 557 steps, saw 378 distinct states, run finished after 18 ms. (steps per millisecond=30 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10248 reset in 128 ms.
Product exploration explored 100000 steps with 10260 reset in 135 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 112/112 transitions.
Applied a total of 0 rules in 11 ms. Remains 228 /228 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2023-03-15 20:35:09] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 20:35:09] [INFO ] Invariant cache hit.
[2023-03-15 20:35:10] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 228/228 places, 112/112 transitions.
Support contains 28 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 112/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 228 /228 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2023-03-15 20:35:10] [INFO ] Invariant cache hit.
[2023-03-15 20:35:10] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-15 20:35:10] [INFO ] Invariant cache hit.
[2023-03-15 20:35:10] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-15 20:35:10] [INFO ] Invariant cache hit.
[2023-03-15 20:35:10] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 381 ms. Remains : 228/228 places, 112/112 transitions.
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-13 finished in 4010 ms.
[2023-03-15 20:35:10] [INFO ] Flatten gal took : 13 ms
[2023-03-15 20:35:10] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-15 20:35:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 263 places, 116 transitions and 652 arcs took 13 ms.
Total runtime 23024 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-COL-06
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678912511879

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 6 (type SKEL/SRCH) for 3 QuasiCertifProtocol-COL-06-LTLCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type SKEL/SRCH) for QuasiCertifProtocol-COL-06-LTLCardinality-13
lola: result : false
lola: markings : 63
lola: fired transitions : 63
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-COL-06-LTLCardinality-00
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for QuasiCertifProtocol-COL-06-LTLCardinality-00
lola: result : false
lola: markings : 107
lola: fired transitions : 107
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 QuasiCertifProtocol-COL-06-LTLCardinality-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for QuasiCertifProtocol-COL-06-LTLCardinality-13
lola: result : false
lola: markings : 63
lola: fired transitions : 63
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-06-LTLCardinality-00: LTL false LTL model checker
QuasiCertifProtocol-COL-06-LTLCardinality-13: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
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 r295-tall-167873948400811"
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 ;