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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:20 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 4.0K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 01:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 01:23 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 72K 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-10-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678912601107

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-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 20:36:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 20:36:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 20:36: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.
[2023-03-15 20:36:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 20:36:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 674 ms
[2023-03-15 20:36:43] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 20:36:43] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-15 20:36:43] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 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 554 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 32) seen :27
Incomplete Best-First random walk after 10001 steps, including 207 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10002 steps, including 209 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 325 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 206 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 211 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-15 20:36:44] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-15 20:36:44] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 20:36:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 20:36:44] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-15 20:36:44] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-15 20:36:44] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Parikh walk visited 2 properties in 3 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2023-03-15 20:36:44] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-15 20:36:44] [INFO ] Flatten gal took : 24 ms
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 20:36:44] [INFO ] Flatten gal took : 4 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2023-03-15 20:36:44] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 12 ms.
[2023-03-15 20:36:44] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 383 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 539 transition count 176
Applied a total of 11 rules in 20 ms. Remains 539 /550 variables (removed 11) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 539 cols
[2023-03-15 20:36:44] [INFO ] Computed 364 place invariants in 15 ms
[2023-03-15 20:36:44] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-15 20:36:44] [INFO ] Invariant cache hit.
[2023-03-15 20:36:45] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2023-03-15 20:36:45] [INFO ] Invariant cache hit.
[2023-03-15 20:36:45] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/550 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 841 ms. Remains : 539/550 places, 176/176 transitions.
Support contains 383 out of 539 places after structural reductions.
[2023-03-15 20:36:45] [INFO ] Flatten gal took : 42 ms
[2023-03-15 20:36:45] [INFO ] Flatten gal took : 29 ms
[2023-03-15 20:36:45] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 691 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 29) seen :6
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-15 20:36:45] [INFO ] Invariant cache hit.
[2023-03-15 20:36:46] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-15 20:36:46] [INFO ] [Real]Absence check using 14 positive and 350 generalized place invariants in 53 ms returned sat
[2023-03-15 20:36:46] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-15 20:36:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 20:36:46] [INFO ] [Nat]Absence check using 14 positive and 350 generalized place invariants in 55 ms returned sat
[2023-03-15 20:36:48] [INFO ] After 1497ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :21
[2023-03-15 20:36:50] [INFO ] After 3149ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :21
Attempting to minimize the solution found.
Minimization took 1363 ms.
[2023-03-15 20:36:51] [INFO ] After 5030ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :21
Fused 23 Parikh solutions to 20 different solutions.
Finished Parikh walk after 91 steps, including 0 resets, run visited all 11 properties in 6 ms. (steps per millisecond=15 )
Parikh walk visited 21 properties in 13 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 539 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 539 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/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) U X((p1||X(X(p2))))))'
Support contains 23 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 524 transition count 176
Applied a total of 15 rules in 34 ms. Remains 524 /539 variables (removed 15) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2023-03-15 20:36:51] [INFO ] Computed 350 place invariants in 24 ms
[2023-03-15 20:36:52] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-15 20:36:52] [INFO ] Invariant cache hit.
[2023-03-15 20:36:52] [INFO ] Implicit Places using invariants and state equation in 509 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 855 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/539 places, 176/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 903 ms. Remains : 513/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 486 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 5}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(LEQ 3 s0), p1:(LEQ 1 (ADD s485 s486 s487 s488 s489 s490 s491 s492 s493 s494 s495)), p2:(LEQ 1 (ADD s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-00 finished in 1458 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)&&(p1 U p2)) U p3))'
Support contains 56 out of 539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Graph (complete) has 2389 edges and 539 vertex of which 536 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.11 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 534 transition count 174
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 534 transition count 174
Applied a total of 4 rules in 69 ms. Remains 534 /539 variables (removed 5) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 534 cols
[2023-03-15 20:36:53] [INFO ] Computed 361 place invariants in 10 ms
[2023-03-15 20:36:53] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-15 20:36:53] [INFO ] Invariant cache hit.
[2023-03-15 20:36:54] [INFO ] Implicit Places using invariants and state equation in 513 ms returned [419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 841 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/539 places, 174/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 512 /512 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 930 ms. Remains : 512/539 places, 174/176 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p3), true, (NOT p0), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 1}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(GT (ADD s485 s486 s487 s488 s489 s490 s491 s492 s493 s494 s495) s500), p0:(GT 3 (ADD s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511)), p2:(LEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-01 finished in 1108 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(G((F(p1)||p0))))'
Support contains 36 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 524 transition count 176
Applied a total of 15 rules in 10 ms. Remains 524 /539 variables (removed 15) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2023-03-15 20:36:54] [INFO ] Computed 350 place invariants in 13 ms
[2023-03-15 20:36:54] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-15 20:36:54] [INFO ] Invariant cache hit.
[2023-03-15 20:36:55] [INFO ] Implicit Places using invariants and state equation in 561 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 894 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/539 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 911 ms. Remains : 513/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GT (ADD s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407) s511) (AND (LEQ (ADD s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407) s511)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6921 reset in 355 ms.
Product exploration explored 100000 steps with 6932 reset in 238 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 252 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1588920 steps, run timeout after 3001 ms. (steps per millisecond=529 ) properties seen :{1=1}
Probabilistic random walk after 1588920 steps, saw 212769 distinct states, run finished after 3002 ms. (steps per millisecond=529 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 513 cols
[2023-03-15 20:36:59] [INFO ] Computed 340 place invariants in 20 ms
[2023-03-15 20:36:59] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 20:36:59] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 44 ms returned sat
[2023-03-15 20:36:59] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 8 factoid took 315 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-03 finished in 5943 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' '!((p0 U X(X(p1))))'
Support contains 33 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 524 transition count 176
Applied a total of 15 rules in 12 ms. Remains 524 /539 variables (removed 15) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2023-03-15 20:37:00] [INFO ] Computed 350 place invariants in 18 ms
[2023-03-15 20:37:00] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-15 20:37:00] [INFO ] Invariant cache hit.
[2023-03-15 20:37:01] [INFO ] Implicit Places using invariants and state equation in 533 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 877 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/539 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 895 ms. Remains : 513/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(LEQ (ADD s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473) (ADD s474 s475 s476 s477 s478 s479 s480 s481 s482 s483 s484)), p0:(LEQ 1 (ADD s485 s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 314 ms.
Product exploration explored 100000 steps with 33333 reset in 242 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 7 factoid took 133 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-07 finished in 1965 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' '!(F((p0||(p1&&X(X(F(!p1)))))))'
Support contains 22 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 524 transition count 176
Applied a total of 15 rules in 12 ms. Remains 524 /539 variables (removed 15) and now considering 176/176 (removed 0) transitions.
[2023-03-15 20:37:02] [INFO ] Invariant cache hit.
[2023-03-15 20:37:02] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-15 20:37:02] [INFO ] Invariant cache hit.
[2023-03-15 20:37:03] [INFO ] Implicit Places using invariants and state equation in 536 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 873 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/539 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 891 ms. Remains : 513/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ 1 (ADD s496 s497 s498 s499 s500 s501 s502 s503 s504 s505 s506)), p1:(LEQ 2 (ADD s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-08 finished in 1015 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 2 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 524 transition count 176
Applied a total of 15 rules in 11 ms. Remains 524 /539 variables (removed 15) and now considering 176/176 (removed 0) transitions.
[2023-03-15 20:37:03] [INFO ] Invariant cache hit.
[2023-03-15 20:37:03] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-15 20:37:03] [INFO ] Invariant cache hit.
[2023-03-15 20:37:04] [INFO ] Implicit Places using invariants and state equation in 565 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 897 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/539 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 914 ms. Remains : 513/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-09 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:(LEQ s510 s509)], 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 6922 reset in 209 ms.
Product exploration explored 100000 steps with 6926 reset in 152 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 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 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 693 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 234 steps, run visited all 1 properties in 6 ms. (steps per millisecond=39 )
Probabilistic random walk after 234 steps, saw 224 distinct states, run finished after 6 ms. (steps per millisecond=39 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 271 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 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2023-03-15 20:37:05] [INFO ] Computed 340 place invariants in 22 ms
[2023-03-15 20:37:05] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-15 20:37:05] [INFO ] Invariant cache hit.
[2023-03-15 20:37:06] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2023-03-15 20:37:06] [INFO ] Invariant cache hit.
[2023-03-15 20:37:06] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1064 ms. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 162 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 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 689 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 234 steps, run visited all 1 properties in 5 ms. (steps per millisecond=46 )
Probabilistic random walk after 234 steps, saw 224 distinct states, run finished after 5 ms. (steps per millisecond=46 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 151 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 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6934 reset in 146 ms.
Product exploration explored 100000 steps with 6918 reset in 151 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 71 are kept as prefixes of interest. Removing 442 places using SCC suffix rule.5 ms
Discarding 442 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 71 transition count 52
Applied a total of 55 rules in 13 ms. Remains 71 /513 variables (removed 442) and now considering 52/176 (removed 124) transitions.
[2023-03-15 20:37:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 71 cols
[2023-03-15 20:37:08] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 20:37:08] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/513 places, 52/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 71/513 places, 52/176 transitions.
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2023-03-15 20:37:08] [INFO ] Computed 340 place invariants in 18 ms
[2023-03-15 20:37:08] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-15 20:37:08] [INFO ] Invariant cache hit.
[2023-03-15 20:37:09] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
[2023-03-15 20:37:09] [INFO ] Invariant cache hit.
[2023-03-15 20:37:09] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1080 ms. Remains : 513/513 places, 176/176 transitions.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-09 finished in 6111 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)||G(F((p1||(p2 U (p3||G(p2))))))))'
Support contains 57 out of 539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Graph (complete) has 2389 edges and 539 vertex of which 525 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 525 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 524 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 524 transition count 175
Applied a total of 5 rules in 64 ms. Remains 524 /539 variables (removed 15) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 524 cols
[2023-03-15 20:37:09] [INFO ] Computed 350 place invariants in 4 ms
[2023-03-15 20:37:09] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-15 20:37:09] [INFO ] Invariant cache hit.
[2023-03-15 20:37:10] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2023-03-15 20:37:10] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 20:37:10] [INFO ] Invariant cache hit.
[2023-03-15 20:37:10] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 524/539 places, 175/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1115 ms. Remains : 524/539 places, 175/176 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s522 s1), p1:(GT 2 (ADD s387 s388 s389 s390 s391 s392 s393 s394 s395 s396 s397)), p3:(AND (GT (ADD s420 s421 s422 s423 s424 s425 s426 s427 s428 s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6926 reset in 183 ms.
Product exploration explored 100000 steps with 6933 reset in 199 ms.
Computed a total of 524 stabilizing places and 175 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 175
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 569 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1))]
Incomplete random walk after 10000 steps, including 689 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 20:37:12] [INFO ] Invariant cache hit.
[2023-03-15 20:37:12] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 20:37:12] [INFO ] [Nat]Absence check using 0 positive and 350 generalized place invariants in 55 ms returned sat
[2023-03-15 20:37:12] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-15 20:37:12] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-15 20:37:12] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (AND p2 (NOT p3) (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p3) (NOT p1))))
Knowledge based reduction with 14 factoid took 441 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-10 finished in 3860 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' '!(F((G(p0)||G(p1))))'
Support contains 23 out of 539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Graph (complete) has 2389 edges and 539 vertex of which 536 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Discarding 3 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 533 transition count 173
Applied a total of 5 rules in 33 ms. Remains 533 /539 variables (removed 6) and now considering 173/176 (removed 3) transitions.
// Phase 1: matrix 173 rows 533 cols
[2023-03-15 20:37:13] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-15 20:37:13] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-15 20:37:13] [INFO ] Invariant cache hit.
[2023-03-15 20:37:14] [INFO ] Implicit Places using invariants and state equation in 525 ms returned [419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 829 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 511/539 places, 173/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 511 /511 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 878 ms. Remains : 511/539 places, 173/176 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429) s499), p1:(GT 2 (ADD s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510))], nbAcceptance=2, 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 6779 reset in 280 ms.
Product exploration explored 100000 steps with 6782 reset in 292 ms.
Computed a total of 511 stabilizing places and 173 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 511 transition count 173
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 594 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 679 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Finished probabilistic random walk after 1796 steps, run visited all 4 properties in 24 ms. (steps per millisecond=74 )
Probabilistic random walk after 1796 steps, saw 1709 distinct states, run finished after 24 ms. (steps per millisecond=74 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 487 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Support contains 23 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 173/173 transitions.
Applied a total of 0 rules in 21 ms. Remains 511 /511 variables (removed 0) and now considering 173/173 (removed 0) transitions.
// Phase 1: matrix 173 rows 511 cols
[2023-03-15 20:37:16] [INFO ] Computed 340 place invariants in 20 ms
[2023-03-15 20:37:16] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-15 20:37:16] [INFO ] Invariant cache hit.
[2023-03-15 20:37:17] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2023-03-15 20:37:17] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 20:37:17] [INFO ] Invariant cache hit.
[2023-03-15 20:37:17] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 996 ms. Remains : 511/511 places, 173/173 transitions.
Computed a total of 511 stabilizing places and 173 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 511 transition count 173
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 343 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 676 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Finished probabilistic random walk after 1796 steps, run visited all 4 properties in 21 ms. (steps per millisecond=85 )
Probabilistic random walk after 1796 steps, saw 1709 distinct states, run finished after 21 ms. (steps per millisecond=85 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 440 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6773 reset in 281 ms.
Product exploration explored 100000 steps with 6780 reset in 290 ms.
Support contains 23 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 173/173 transitions.
Applied a total of 0 rules in 12 ms. Remains 511 /511 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-15 20:37:19] [INFO ] Invariant cache hit.
[2023-03-15 20:37:19] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-15 20:37:19] [INFO ] Invariant cache hit.
[2023-03-15 20:37:19] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2023-03-15 20:37:19] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 20:37:19] [INFO ] Invariant cache hit.
[2023-03-15 20:37:20] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 984 ms. Remains : 511/511 places, 173/173 transitions.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-11 finished in 6917 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((G(p0)||(p0&&G((F(p1)&&F(G(!p0))))))))'
Support contains 134 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 525 transition count 176
Applied a total of 14 rules in 5 ms. Remains 525 /539 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2023-03-15 20:37:20] [INFO ] Computed 350 place invariants in 5 ms
[2023-03-15 20:37:20] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-15 20:37:20] [INFO ] Invariant cache hit.
[2023-03-15 20:37:20] [INFO ] Implicit Places using invariants and state equation in 460 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 750 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/539 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 759 ms. Remains : 514/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-12 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=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT s509 (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 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-12 finished in 1005 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((p0||G(p1))))))'
Support contains 123 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 525 transition count 176
Applied a total of 14 rules in 4 ms. Remains 525 /539 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2023-03-15 20:37:21] [INFO ] Computed 351 place invariants in 6 ms
[2023-03-15 20:37:21] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-15 20:37:21] [INFO ] Invariant cache hit.
[2023-03-15 20:37:21] [INFO ] Implicit Places using invariants and state equation in 494 ms returned [442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 805 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/539 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 812 ms. Remains : 514/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(LEQ 3 (ADD s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32478 reset in 329 ms.
Product exploration explored 100000 steps with 32382 reset in 377 ms.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 514 cols
[2023-03-15 20:37:23] [INFO ] Computed 340 place invariants in 5 ms
[2023-03-15 20:37:23] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 42 ms returned sat
[2023-03-15 20:37:23] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 20:37:23] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 42 ms returned sat
[2023-03-15 20:37:23] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 20:37:23] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-15 20:37:23] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 244 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-15 20:37:24] [INFO ] Invariant cache hit.
[2023-03-15 20:37:24] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 185 ms returned sat
[2023-03-15 20:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:37:25] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2023-03-15 20:37:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:37:25] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 246 ms returned sat
[2023-03-15 20:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:37:27] [INFO ] [Nat]Absence check using state equation in 1884 ms returned sat
[2023-03-15 20:37:27] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 10 ms.
[2023-03-15 20:37:27] [INFO ] Added : 46 causal constraints over 10 iterations in 311 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 123 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-15 20:37:27] [INFO ] Invariant cache hit.
[2023-03-15 20:37:28] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-15 20:37:28] [INFO ] Invariant cache hit.
[2023-03-15 20:37:28] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2023-03-15 20:37:28] [INFO ] Invariant cache hit.
[2023-03-15 20:37:28] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 767 ms. Remains : 514/514 places, 176/176 transitions.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 690 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 20:37:29] [INFO ] Invariant cache hit.
[2023-03-15 20:37:29] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 41 ms returned sat
[2023-03-15 20:37:29] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 20:37:29] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 43 ms returned sat
[2023-03-15 20:37:29] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 20:37:29] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-15 20:37:29] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 244 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-15 20:37:30] [INFO ] Invariant cache hit.
[2023-03-15 20:37:30] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 189 ms returned sat
[2023-03-15 20:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:37:31] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2023-03-15 20:37:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:37:31] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 238 ms returned sat
[2023-03-15 20:37:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:37:33] [INFO ] [Nat]Absence check using state equation in 1877 ms returned sat
[2023-03-15 20:37:33] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2023-03-15 20:37:33] [INFO ] Added : 46 causal constraints over 10 iterations in 300 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 32380 reset in 349 ms.
Product exploration explored 100000 steps with 32434 reset in 334 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 123 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2096 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
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 502 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 18 ms. Remains 502 /514 variables (removed 12) and now considering 175/176 (removed 1) transitions.
[2023-03-15 20:37:34] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 175 rows 502 cols
[2023-03-15 20:37:34] [INFO ] Computed 330 place invariants in 8 ms
[2023-03-15 20:37:34] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 502/514 places, 175/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 502/514 places, 175/176 transitions.
Support contains 123 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2023-03-15 20:37:34] [INFO ] Computed 340 place invariants in 7 ms
[2023-03-15 20:37:35] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-15 20:37:35] [INFO ] Invariant cache hit.
[2023-03-15 20:37:35] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-15 20:37:35] [INFO ] Invariant cache hit.
[2023-03-15 20:37:35] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 789 ms. Remains : 514/514 places, 176/176 transitions.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-13 finished in 14568 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(G((X(F(p0))||(G(p1)&&X(F(p2)))))))'
Support contains 33 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 535 transition count 176
Applied a total of 4 rules in 9 ms. Remains 535 /539 variables (removed 4) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 535 cols
[2023-03-15 20:37:35] [INFO ] Computed 361 place invariants in 9 ms
[2023-03-15 20:37:36] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-15 20:37:36] [INFO ] Invariant cache hit.
[2023-03-15 20:37:36] [INFO ] Implicit Places using invariants and state equation in 540 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 981 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 524/539 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 996 ms. Remains : 524/539 places, 176/176 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523) (ADD s474 s475 s476 s477 s478 s479 s480 s481 s482 s483 s484)), p0:(LEQ 1 (ADD s430 s4...], 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]]
Product exploration explored 100000 steps with 25003 reset in 231 ms.
Product exploration explored 100000 steps with 24947 reset in 237 ms.
Computed a total of 524 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 330 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 691 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1501287 steps, run timeout after 3001 ms. (steps per millisecond=500 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1501287 steps, saw 200582 distinct states, run finished after 3001 ms. (steps per millisecond=500 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 524 cols
[2023-03-15 20:37:41] [INFO ] Computed 350 place invariants in 7 ms
[2023-03-15 20:37:41] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 20:37:41] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 10 factoid took 383 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 33 out of 524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-15 20:37:41] [INFO ] Invariant cache hit.
[2023-03-15 20:37:42] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-15 20:37:42] [INFO ] Invariant cache hit.
[2023-03-15 20:37:42] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2023-03-15 20:37:42] [INFO ] Invariant cache hit.
[2023-03-15 20:37:42] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 955 ms. Remains : 524/524 places, 176/176 transitions.
Computed a total of 524 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 246 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 691 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1711 steps, run visited all 2 properties in 16 ms. (steps per millisecond=106 )
Probabilistic random walk after 1711 steps, saw 1630 distinct states, run finished after 16 ms. (steps per millisecond=106 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 306 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 6933 reset in 170 ms.
Product exploration explored 100000 steps with 6932 reset in 180 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 33 out of 524 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Graph (complete) has 2161 edges and 524 vertex of which 512 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 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 512 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 23 ms. Remains 512 /524 variables (removed 12) and now considering 176/176 (removed 0) transitions.
[2023-03-15 20:37:44] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 176 rows 512 cols
[2023-03-15 20:37:44] [INFO ] Computed 340 place invariants in 3 ms
[2023-03-15 20:37:44] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/524 places, 176/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 512/524 places, 176/176 transitions.
Support contains 33 out of 524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2023-03-15 20:37:44] [INFO ] Computed 350 place invariants in 2 ms
[2023-03-15 20:37:45] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-15 20:37:45] [INFO ] Invariant cache hit.
[2023-03-15 20:37:45] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2023-03-15 20:37:45] [INFO ] Invariant cache hit.
[2023-03-15 20:37:45] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 965 ms. Remains : 524/524 places, 176/176 transitions.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-14 finished in 10199 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))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-10-LTLCardinality-09
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 539 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Graph (complete) has 2389 edges and 539 vertex of which 71 are kept as prefixes of interest. Removing 468 places using SCC suffix rule.1 ms
Discarding 468 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 70 transition count 51
Applied a total of 55 rules in 7 ms. Remains 70 /539 variables (removed 469) and now considering 51/176 (removed 125) transitions.
// Phase 1: matrix 51 rows 70 cols
[2023-03-15 20:37:46] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 20:37:46] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-15 20:37:46] [INFO ] Invariant cache hit.
[2023-03-15 20:37:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 99 ms to find 11 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 59/539 places, 51/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 107 ms. Remains : 59/539 places, 51/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-09 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:(LEQ s57 s56)], 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]]
Entered a terminal (fully accepting) state of product in 71999 steps with 4783 reset in 98 ms.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-09 finished in 408 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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' '!(F((G(p0)||G(p1))))'
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((p0||G(p1))))))'
Found a Shortening insensitive property : QuasiCertifProtocol-COL-10-LTLCardinality-13
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 123 out of 539 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Graph (complete) has 2389 edges and 539 vertex of which 513 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 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 511 transition count 172
Applied a total of 3 rules in 21 ms. Remains 511 /539 variables (removed 28) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 511 cols
[2023-03-15 20:37:46] [INFO ] Computed 341 place invariants in 11 ms
[2023-03-15 20:37:46] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-15 20:37:46] [INFO ] Invariant cache hit.
[2023-03-15 20:37:47] [INFO ] Implicit Places using invariants and state equation in 531 ms returned [409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 786 ms to find 22 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 489/539 places, 172/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 489 /489 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 815 ms. Remains : 489/539 places, 172/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(LEQ 3 (ADD s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 28679 reset in 373 ms.
Product exploration explored 100000 steps with 28701 reset in 383 ms.
Computed a total of 489 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 489 transition count 172
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 (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 678 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 172 rows 489 cols
[2023-03-15 20:37:48] [INFO ] Computed 320 place invariants in 12 ms
[2023-03-15 20:37:48] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 40 ms returned sat
[2023-03-15 20:37:48] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 20:37:48] [INFO ] After 215ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 20:37:48] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 20:37:49] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 38 ms returned sat
[2023-03-15 20:37:49] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 20:37:49] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-15 20:37:49] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 282 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-15 20:37:49] [INFO ] Invariant cache hit.
[2023-03-15 20:37:50] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 171 ms returned sat
[2023-03-15 20:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:37:50] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2023-03-15 20:37:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:37:50] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 224 ms returned sat
[2023-03-15 20:37:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:37:51] [INFO ] [Nat]Absence check using state equation in 905 ms returned sat
[2023-03-15 20:37:51] [INFO ] Computed and/alt/rep : 113/135/113 causal constraints (skipped 36 transitions) in 11 ms.
[2023-03-15 20:37:51] [INFO ] Added : 0 causal constraints over 0 iterations in 88 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 123 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 489 /489 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-15 20:37:51] [INFO ] Invariant cache hit.
[2023-03-15 20:37:52] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-15 20:37:52] [INFO ] Invariant cache hit.
[2023-03-15 20:37:52] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2023-03-15 20:37:52] [INFO ] Invariant cache hit.
[2023-03-15 20:37:52] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 752 ms. Remains : 489/489 places, 172/172 transitions.
Computed a total of 489 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 489 transition count 172
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 (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 676 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 20:37:53] [INFO ] Invariant cache hit.
[2023-03-15 20:37:53] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 41 ms returned sat
[2023-03-15 20:37:53] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 20:37:53] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 37 ms returned sat
[2023-03-15 20:37:53] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 20:37:53] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-15 20:37:53] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-15 20:37:54] [INFO ] Invariant cache hit.
[2023-03-15 20:37:54] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 175 ms returned sat
[2023-03-15 20:37:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:37:55] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2023-03-15 20:37:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:37:55] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 224 ms returned sat
[2023-03-15 20:37:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:37:56] [INFO ] [Nat]Absence check using state equation in 882 ms returned sat
[2023-03-15 20:37:56] [INFO ] Computed and/alt/rep : 113/135/113 causal constraints (skipped 36 transitions) in 10 ms.
[2023-03-15 20:37:56] [INFO ] Added : 0 causal constraints over 0 iterations in 77 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 28797 reset in 382 ms.
Product exploration explored 100000 steps with 28785 reset in 384 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 123 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 172/172 transitions.
Applied a total of 0 rules in 14 ms. Remains 489 /489 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-15 20:37:57] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-15 20:37:57] [INFO ] Invariant cache hit.
[2023-03-15 20:37:57] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 489/489 places, 172/172 transitions.
Support contains 123 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 172/172 transitions.
Applied a total of 0 rules in 3 ms. Remains 489 /489 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-15 20:37:57] [INFO ] Invariant cache hit.
[2023-03-15 20:37:58] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-15 20:37:58] [INFO ] Invariant cache hit.
[2023-03-15 20:37:58] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2023-03-15 20:37:58] [INFO ] Invariant cache hit.
[2023-03-15 20:37:58] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 734 ms. Remains : 489/489 places, 172/172 transitions.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-13 finished in 12188 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(G((X(F(p0))||(G(p1)&&X(F(p2)))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-10-LTLCardinality-14
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 33 out of 539 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 539/539 places, 176/176 transitions.
Graph (complete) has 2389 edges and 539 vertex of which 523 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Discarding 16 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 520 transition count 171
Applied a total of 5 rules in 24 ms. Remains 520 /539 variables (removed 19) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 520 cols
[2023-03-15 20:37:58] [INFO ] Computed 351 place invariants in 5 ms
[2023-03-15 20:37:59] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-15 20:37:59] [INFO ] Invariant cache hit.
[2023-03-15 20:37:59] [INFO ] Implicit Places using invariants and state equation in 635 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 940 ms to find 22 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 498/539 places, 171/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 973 ms. Remains : 498/539 places, 171/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s487 s488 s489 s490 s491 s492 s493 s494 s495 s496 s497) (ADD s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462)), p0:(LEQ 1 (ADD s408 s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24995 reset in 256 ms.
Product exploration explored 100000 steps with 25026 reset in 265 ms.
Computed a total of 498 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 498 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 294 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 676 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1572505 steps, run timeout after 3001 ms. (steps per millisecond=523 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1572505 steps, saw 207607 distinct states, run finished after 3001 ms. (steps per millisecond=523 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 171 rows 498 cols
[2023-03-15 20:38:04] [INFO ] Computed 330 place invariants in 7 ms
[2023-03-15 20:38:04] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 20:38:04] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 10 factoid took 426 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 33 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 171/171 transitions.
Applied a total of 0 rules in 8 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2023-03-15 20:38:04] [INFO ] Invariant cache hit.
[2023-03-15 20:38:05] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-15 20:38:05] [INFO ] Invariant cache hit.
[2023-03-15 20:38:05] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2023-03-15 20:38:05] [INFO ] Invariant cache hit.
[2023-03-15 20:38:05] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 911 ms. Remains : 498/498 places, 171/171 transitions.
Computed a total of 498 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 498 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 239 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 679 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1636 steps, run visited all 2 properties in 15 ms. (steps per millisecond=109 )
Probabilistic random walk after 1636 steps, saw 1559 distinct states, run finished after 15 ms. (steps per millisecond=109 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 6782 reset in 181 ms.
Product exploration explored 100000 steps with 6770 reset in 192 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 33 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 171/171 transitions.
Applied a total of 0 rules in 14 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2023-03-15 20:38:07] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 20:38:07] [INFO ] Invariant cache hit.
[2023-03-15 20:38:07] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 498/498 places, 171/171 transitions.
Support contains 33 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 171/171 transitions.
Applied a total of 0 rules in 9 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2023-03-15 20:38:07] [INFO ] Invariant cache hit.
[2023-03-15 20:38:07] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-15 20:38:07] [INFO ] Invariant cache hit.
[2023-03-15 20:38:08] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2023-03-15 20:38:08] [INFO ] Invariant cache hit.
[2023-03-15 20:38:08] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 926 ms. Remains : 498/498 places, 171/171 transitions.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-14 finished in 10116 ms.
[2023-03-15 20:38:08] [INFO ] Flatten gal took : 27 ms
[2023-03-15 20:38:08] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-15 20:38:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 539 places, 176 transitions and 1276 arcs took 3 ms.
Total runtime 86184 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-COL-10
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

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

FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678912805174

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 12 (type SKEL/SRCH) for 0 QuasiCertifProtocol-COL-10-LTLCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 12 (type SKEL/SRCH) for QuasiCertifProtocol-COL-10-LTLCardinality-09
lola: result : false
lola: markings : 95
lola: fired transitions : 95
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 7 (type EXCL) for 6 QuasiCertifProtocol-COL-10-LTLCardinality-13
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for QuasiCertifProtocol-COL-10-LTLCardinality-13
lola: result : false
lola: markings : 95
lola: fired transitions : 95
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 QuasiCertifProtocol-COL-10-LTLCardinality-14
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1200 4/32 QuasiCertifProtocol-COL-10-LTLCardinality-14 495378 m, 99075 m/sec, 3163137 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1200 7/32 QuasiCertifProtocol-COL-10-LTLCardinality-14 917366 m, 84397 m/sec, 6236892 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1200 9/32 QuasiCertifProtocol-COL-10-LTLCardinality-14 1302549 m, 77036 m/sec, 9205409 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/1200 12/32 QuasiCertifProtocol-COL-10-LTLCardinality-14 1695932 m, 78676 m/sec, 12235030 t fired, .

Time elapsed: 20 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/1200 15/32 QuasiCertifProtocol-COL-10-LTLCardinality-14 2083633 m, 77540 m/sec, 15240801 t fired, .

Time elapsed: 25 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 30/1200 17/32 QuasiCertifProtocol-COL-10-LTLCardinality-14 2488896 m, 81052 m/sec, 18336870 t fired, .

Time elapsed: 30 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 35/1200 20/32 QuasiCertifProtocol-COL-10-LTLCardinality-14 2900828 m, 82386 m/sec, 21531626 t fired, .

Time elapsed: 35 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 40/1200 23/32 QuasiCertifProtocol-COL-10-LTLCardinality-14 3298562 m, 79546 m/sec, 24682126 t fired, .

Time elapsed: 40 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 45/1200 25/32 QuasiCertifProtocol-COL-10-LTLCardinality-14 3661342 m, 72556 m/sec, 27722263 t fired, .

Time elapsed: 45 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 50/1200 28/32 QuasiCertifProtocol-COL-10-LTLCardinality-14 4034592 m, 74650 m/sec, 30780765 t fired, .

Time elapsed: 50 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 55/1200 30/32 QuasiCertifProtocol-COL-10-LTLCardinality-14 4374752 m, 68032 m/sec, 33620230 t fired, .

Time elapsed: 55 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 60/1200 32/32 QuasiCertifProtocol-COL-10-LTLCardinality-14 4743270 m, 73703 m/sec, 36549569 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for QuasiCertifProtocol-COL-10-LTLCardinality-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-COL-10-LTLCardinality-09
lola: time limit : 1767 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for QuasiCertifProtocol-COL-10-LTLCardinality-09
lola: result : false
lola: markings : 95
lola: fired transitions : 95
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 QuasiCertifProtocol-COL-10-LTLCardinality-11
lola: time limit : 3535 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL false LTL model checker
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3535 5/32 QuasiCertifProtocol-COL-10-LTLCardinality-11 604915 m, 120983 m/sec, 2558793 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL false LTL model checker
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3535 8/32 QuasiCertifProtocol-COL-10-LTLCardinality-11 1099399 m, 98896 m/sec, 4994638 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL false LTL model checker
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3535 12/32 QuasiCertifProtocol-COL-10-LTLCardinality-11 1569434 m, 94007 m/sec, 7436455 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL false LTL model checker
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3535 15/32 QuasiCertifProtocol-COL-10-LTLCardinality-11 2080842 m, 102281 m/sec, 9962618 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL false LTL model checker
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3535 19/32 QuasiCertifProtocol-COL-10-LTLCardinality-11 2583722 m, 100576 m/sec, 12456958 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL false LTL model checker
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3535 22/32 QuasiCertifProtocol-COL-10-LTLCardinality-11 3045605 m, 92376 m/sec, 14867804 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL false LTL model checker
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3535 25/32 QuasiCertifProtocol-COL-10-LTLCardinality-11 3469337 m, 84746 m/sec, 17208123 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL false LTL model checker
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3535 29/32 QuasiCertifProtocol-COL-10-LTLCardinality-11 3936870 m, 93506 m/sec, 19573509 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL false LTL model checker
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3535 31/32 QuasiCertifProtocol-COL-10-LTLCardinality-11 4357041 m, 84034 m/sec, 21941931 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for QuasiCertifProtocol-COL-10-LTLCardinality-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL false LTL model checker
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-10-LTLCardinality-09: LTL false LTL model checker
QuasiCertifProtocol-COL-10-LTLCardinality-11: LTL unknown AGGR
QuasiCertifProtocol-COL-10-LTLCardinality-13: LTL false LTL model checker
QuasiCertifProtocol-COL-10-LTLCardinality-14: LTL unknown AGGR


Time elapsed: 115 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="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-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873948400819"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;