Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 9.0K Apr 13 03:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 03:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 13 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 13 03:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 13 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 13 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 13 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 58K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716769333004

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-02
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 00:22:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 00:22:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:22:14] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-05-27 00:22:14] [INFO ] Transformed 86 places.
[2024-05-27 00:22:14] [INFO ] Transformed 56 transitions.
[2024-05-27 00:22:14] [INFO ] Found NUPN structural information;
[2024-05-27 00:22:14] [INFO ] Parsed PT model containing 86 places and 56 transitions and 223 arcs in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 83 transition count 56
Applied a total of 3 rules in 12 ms. Remains 83 /86 variables (removed 3) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 83 cols
[2024-05-27 00:22:14] [INFO ] Computed 28 invariants in 7 ms
[2024-05-27 00:22:14] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-27 00:22:14] [INFO ] Invariant cache hit.
[2024-05-27 00:22:14] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [46, 47, 53]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 273 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/86 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 286 ms. Remains : 80/86 places, 56/56 transitions.
Support contains 58 out of 80 places after structural reductions.
[2024-05-27 00:22:15] [INFO ] Flatten gal took : 21 ms
[2024-05-27 00:22:15] [INFO ] Flatten gal took : 10 ms
[2024-05-27 00:22:15] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 1644 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 21) seen :6
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 56 rows 80 cols
[2024-05-27 00:22:15] [INFO ] Computed 25 invariants in 3 ms
[2024-05-27 00:22:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 00:22:15] [INFO ] [Real]Absence check using 3 positive and 22 generalized place invariants in 5 ms returned sat
[2024-05-27 00:22:15] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2024-05-27 00:22:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 00:22:16] [INFO ] [Nat]Absence check using 3 positive and 22 generalized place invariants in 4 ms returned sat
[2024-05-27 00:22:16] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :10
[2024-05-27 00:22:16] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :10
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-27 00:22:16] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :10
Fused 15 Parikh solutions to 10 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 8 properties in 12 ms.
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 65 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.2 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 59 transition count 27
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 56 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 55 transition count 26
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 39 place count 55 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 67 place count 35 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 67 place count 35 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 77 place count 27 transition count 16
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 91 place count 18 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 17 transition count 10
Ensure Unique test removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 15 transition count 10
Applied a total of 94 rules in 21 ms. Remains 15 /80 variables (removed 65) and now considering 10/56 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 15/80 places, 10/56 transitions.
Finished random walk after 11 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 80 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 80 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 35 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 34 transition count 29
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 34 transition count 29
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 33 transition count 28
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 33 transition count 28
Applied a total of 16 rules in 8 ms. Remains 33 /80 variables (removed 47) and now considering 28/56 (removed 28) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-05-27 00:22:16] [INFO ] Computed 6 invariants in 2 ms
[2024-05-27 00:22:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-27 00:22:16] [INFO ] Invariant cache hit.
[2024-05-27 00:22:16] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [15, 19, 20]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 84 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/80 places, 28/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 30/80 places, 28/56 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 17928 reset in 201 ms.
Product exploration explored 100000 steps with 17898 reset in 129 ms.
Computed a total of 30 stabilizing places and 28 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 28
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1789 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 388 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Probably explored full state space saw : 238 states, properties seen :0
Probabilistic random walk after 827 steps, saw 238 distinct states, run finished after 18 ms. (steps per millisecond=45 ) properties seen :0
Explored full state space saw : 238 states, properties seen :0
Exhaustive walk after 827 steps, saw 238 distinct states, run finished after 2 ms. (steps per millisecond=413 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 13 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-00 finished in 846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 14 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 56
Applied a total of 7 rules in 3 ms. Remains 73 /80 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-27 00:22:17] [INFO ] Computed 20 invariants in 3 ms
[2024-05-27 00:22:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-27 00:22:17] [INFO ] Invariant cache hit.
[2024-05-27 00:22:17] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-27 00:22:17] [INFO ] Invariant cache hit.
[2024-05-27 00:22:17] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 73/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 943 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ (ADD s45 s46 s47 s48 s49 s50 s51 s56 s57) (ADD s19 s20 s22)), p1:(LEQ s25 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 16434 reset in 117 ms.
Product exploration explored 100000 steps with 16418 reset in 97 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p0))), true, (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 138 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1640 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 666 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 474 steps, run visited all 1 properties in 9 ms. (steps per millisecond=52 )
Probabilistic random walk after 474 steps, saw 194 distinct states, run finished after 9 ms. (steps per millisecond=52 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p0))), true, (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 10 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-01 finished in 1813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 40 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 39 transition count 39
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 37 transition count 35
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 37 transition count 35
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 36 transition count 33
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 36 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 35 transition count 32
Applied a total of 15 rules in 12 ms. Remains 35 /80 variables (removed 45) and now considering 32/56 (removed 24) transitions.
// Phase 1: matrix 32 rows 35 cols
[2024-05-27 00:22:19] [INFO ] Computed 6 invariants in 1 ms
[2024-05-27 00:22:19] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-27 00:22:19] [INFO ] Invariant cache hit.
[2024-05-27 00:22:19] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [16, 20, 21]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 75 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/80 places, 32/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89 ms. Remains : 32/80 places, 32/56 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s27 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-02 finished in 132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||X((G(p1) U (p0&&G(p1)))))))))'
Support contains 7 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 56
Applied a total of 7 rules in 4 ms. Remains 73 /80 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-27 00:22:19] [INFO ] Computed 20 invariants in 2 ms
[2024-05-27 00:22:19] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-27 00:22:19] [INFO ] Invariant cache hit.
[2024-05-27 00:22:19] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-27 00:22:19] [INFO ] Invariant cache hit.
[2024-05-27 00:22:19] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 73/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 0}, { cond=(NOT p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(LEQ s23 (ADD s15 s17 s18)), p0:(LEQ 1 (ADD s64 s65 s66))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-03 finished in 427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 69 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 66 transition count 51
Applied a total of 5 rules in 7 ms. Remains 66 /80 variables (removed 14) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 66 cols
[2024-05-27 00:22:19] [INFO ] Computed 18 invariants in 4 ms
[2024-05-27 00:22:19] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-27 00:22:19] [INFO ] Invariant cache hit.
[2024-05-27 00:22:19] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [49, 55, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 115 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/80 places, 51/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 63/80 places, 51/56 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-04 finished in 202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((F(p1)&&X((F(p2) U !p0)))))))'
Support contains 13 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 77 transition count 56
Applied a total of 3 rules in 4 ms. Remains 77 /80 variables (removed 3) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 77 cols
[2024-05-27 00:22:20] [INFO ] Computed 23 invariants in 4 ms
[2024-05-27 00:22:20] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-27 00:22:20] [INFO ] Invariant cache hit.
[2024-05-27 00:22:20] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-27 00:22:20] [INFO ] Invariant cache hit.
[2024-05-27 00:22:20] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 77/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 77/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 426 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (NOT p1), p0, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=p0, acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 6}]], initial=0, aps=[p0:(GT (ADD s20 s21 s23) s4), p1:(LEQ (ADD s11 s12 s13) (ADD s61 s62 s68)), p2:(LEQ s4 (ADD s69 s70 s71))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17484 reset in 150 ms.
Product exploration explored 100000 steps with 17495 reset in 140 ms.
Computed a total of 77 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 366 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Incomplete random walk after 10000 steps, including 1642 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 561 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 558 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 666 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 00:22:21] [INFO ] Invariant cache hit.
[2024-05-27 00:22:21] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 00:22:21] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 3 ms returned sat
[2024-05-27 00:22:21] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-27 00:22:21] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-27 00:22:21] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 20 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 1 ms.
Support contains 7 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 56/56 transitions.
Graph (complete) has 132 edges and 77 vertex of which 64 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 58 transition count 27
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 39 place count 53 transition count 27
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 39 place count 53 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 54 place count 44 transition count 21
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 44 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 43 transition count 20
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 58 place count 41 transition count 18
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 41 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 72 place count 32 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 87 place count 20 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 19 transition count 11
Applied a total of 88 rules in 7 ms. Remains 19 /77 variables (removed 58) and now considering 11/56 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 19/77 places, 11/56 transitions.
Finished random walk after 108 steps, including 22 resets, run visited all 1 properties in 1 ms. (steps per millisecond=108 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT p2)), (F (AND (NOT p2) p0)), (F (NOT (AND p2 p0)))]
Knowledge based reduction with 10 factoid took 1348 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Support contains 7 out of 77 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-27 00:22:23] [INFO ] Invariant cache hit.
[2024-05-27 00:22:23] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-27 00:22:23] [INFO ] Invariant cache hit.
[2024-05-27 00:22:23] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-27 00:22:23] [INFO ] Invariant cache hit.
[2024-05-27 00:22:23] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 77/77 places, 56/56 transitions.
Computed a total of 77 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p0), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 325 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Incomplete random walk after 10000 steps, including 1641 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 567 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 567 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 666 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 00:22:24] [INFO ] Invariant cache hit.
[2024-05-27 00:22:24] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 00:22:24] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 3 ms returned sat
[2024-05-27 00:22:25] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-27 00:22:25] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-27 00:22:25] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 20 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 1 ms.
Support contains 7 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 56/56 transitions.
Graph (complete) has 132 edges and 77 vertex of which 64 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 58 transition count 27
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 39 place count 53 transition count 27
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 39 place count 53 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 54 place count 44 transition count 21
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 44 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 43 transition count 20
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 58 place count 41 transition count 18
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 41 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 72 place count 32 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 87 place count 20 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 19 transition count 11
Applied a total of 88 rules in 12 ms. Remains 19 /77 variables (removed 58) and now considering 11/56 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 19/77 places, 11/56 transitions.
Finished random walk after 93 steps, including 17 resets, run visited all 1 properties in 2 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0), true, (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 17492 reset in 107 ms.
Product exploration explored 100000 steps with 17491 reset in 102 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
Support contains 7 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 56/56 transitions.
Graph (complete) has 132 edges and 77 vertex of which 73 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 73 transition count 56
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 11 ms. Remains 73 /77 variables (removed 4) and now considering 56/56 (removed 0) transitions.
[2024-05-27 00:22:26] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2024-05-27 00:22:26] [INFO ] Computed 21 invariants in 4 ms
[2024-05-27 00:22:26] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/77 places, 56/56 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 73/77 places, 56/56 transitions.
Built C files in :
/tmp/ltsmin13407524385401896467
[2024-05-27 00:22:26] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13407524385401896467
Running compilation step : cd /tmp/ltsmin13407524385401896467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 234 ms.
Running link step : cd /tmp/ltsmin13407524385401896467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin13407524385401896467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14427221377413566289.hoa' '--buchi-type=spotba'
LTSmin run took 402 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-05 finished in 7285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((F(p1)||X(G(p2))))))'
Support contains 8 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 56
Applied a total of 7 rules in 3 ms. Remains 73 /80 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-27 00:22:27] [INFO ] Computed 20 invariants in 2 ms
[2024-05-27 00:22:27] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-27 00:22:27] [INFO ] Invariant cache hit.
[2024-05-27 00:22:27] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-27 00:22:27] [INFO ] Invariant cache hit.
[2024-05-27 00:22:27] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 73/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 1322 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), false]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(GT s23 (ADD s7 s8 s9)), p1:(LEQ 3 (ADD s13 s14 s16)), p2:(LEQ 2 s24)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-06 finished in 1504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 44 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 43 transition count 40
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 42 transition count 38
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 42 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 40 transition count 36
Applied a total of 13 rules in 10 ms. Remains 40 /80 variables (removed 40) and now considering 36/56 (removed 20) transitions.
// Phase 1: matrix 36 rows 40 cols
[2024-05-27 00:22:28] [INFO ] Computed 8 invariants in 1 ms
[2024-05-27 00:22:28] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-27 00:22:28] [INFO ] Invariant cache hit.
[2024-05-27 00:22:28] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [25, 29, 30]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 79 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/80 places, 36/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91 ms. Remains : 37/80 places, 36/56 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-07 finished in 134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G(!p1))))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 74 transition count 56
Applied a total of 6 rules in 2 ms. Remains 74 /80 variables (removed 6) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2024-05-27 00:22:28] [INFO ] Computed 20 invariants in 15 ms
[2024-05-27 00:22:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-27 00:22:29] [INFO ] Invariant cache hit.
[2024-05-27 00:22:29] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-27 00:22:29] [INFO ] Invariant cache hit.
[2024-05-27 00:22:29] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 74/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(LEQ 1 s0), p0:(GT s73 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 64 steps with 10 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-08 finished in 368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||X(G(p1))))))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 56
Applied a total of 7 rules in 3 ms. Remains 73 /80 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-27 00:22:29] [INFO ] Computed 20 invariants in 1 ms
[2024-05-27 00:22:29] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-27 00:22:29] [INFO ] Invariant cache hit.
[2024-05-27 00:22:29] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-27 00:22:29] [INFO ] Invariant cache hit.
[2024-05-27 00:22:29] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 73/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(LEQ s70 s55), p0:(GT s1 s60)], 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16431 reset in 68 ms.
Product exploration explored 100000 steps with 16419 reset in 69 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1640 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 576 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 569 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Finished probabilistic random walk after 475 steps, run visited all 2 properties in 18 ms. (steps per millisecond=26 )
Probabilistic random walk after 475 steps, saw 195 distinct states, run finished after 18 ms. (steps per millisecond=26 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (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 4 factoid took 351 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-27 00:22:30] [INFO ] Invariant cache hit.
[2024-05-27 00:22:31] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-27 00:22:31] [INFO ] Invariant cache hit.
[2024-05-27 00:22:31] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-27 00:22:31] [INFO ] Invariant cache hit.
[2024-05-27 00:22:31] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 73/73 places, 56/56 transitions.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1641 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 570 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 564 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Finished probabilistic random walk after 475 steps, run visited all 2 properties in 5 ms. (steps per millisecond=95 )
Probabilistic random walk after 475 steps, saw 195 distinct states, run finished after 5 ms. (steps per millisecond=95 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (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 4 factoid took 157 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 16395 reset in 67 ms.
Product exploration explored 100000 steps with 16437 reset in 70 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 56/56 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 2 place count 73 transition count 58
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 12 ms. Remains 73 /73 variables (removed 0) and now considering 58/56 (removed -2) transitions.
[2024-05-27 00:22:33] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 58 rows 73 cols
[2024-05-27 00:22:33] [INFO ] Computed 20 invariants in 1 ms
[2024-05-27 00:22:33] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/73 places, 58/56 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 73/73 places, 58/56 transitions.
Built C files in :
/tmp/ltsmin261169280226716
[2024-05-27 00:22:33] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin261169280226716
Running compilation step : cd /tmp/ltsmin261169280226716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 129 ms.
Running link step : cd /tmp/ltsmin261169280226716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin261169280226716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8329957744501665201.hoa' '--buchi-type=spotba'
LTSmin run took 139 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-09 finished in 4310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 69 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 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 67 transition count 52
Applied a total of 3 rules in 6 ms. Remains 67 /80 variables (removed 13) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 67 cols
[2024-05-27 00:22:33] [INFO ] Computed 18 invariants in 1 ms
[2024-05-27 00:22:33] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-27 00:22:33] [INFO ] Invariant cache hit.
[2024-05-27 00:22:33] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [50, 56, 57]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 109 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/80 places, 52/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 64/80 places, 52/56 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s2 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 18746 reset in 78 ms.
Product exploration explored 100000 steps with 18741 reset in 75 ms.
Computed a total of 64 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1882 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 214 steps, run visited all 1 properties in 4 ms. (steps per millisecond=53 )
Probabilistic random walk after 214 steps, saw 114 distinct states, run finished after 4 ms. (steps per millisecond=53 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 52/52 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 64 cols
[2024-05-27 00:22:34] [INFO ] Computed 16 invariants in 1 ms
[2024-05-27 00:22:34] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-27 00:22:34] [INFO ] Invariant cache hit.
[2024-05-27 00:22:34] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-27 00:22:34] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-27 00:22:34] [INFO ] Invariant cache hit.
[2024-05-27 00:22:34] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 64/64 places, 52/52 transitions.
Computed a total of 64 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1876 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 459 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 214 steps, run visited all 1 properties in 3 ms. (steps per millisecond=71 )
Probabilistic random walk after 214 steps, saw 114 distinct states, run finished after 3 ms. (steps per millisecond=71 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18764 reset in 83 ms.
Product exploration explored 100000 steps with 18766 reset in 69 ms.
Built C files in :
/tmp/ltsmin7806543203189187440
[2024-05-27 00:22:35] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-05-27 00:22:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:22:35] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-05-27 00:22:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:22:35] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-05-27 00:22:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:22:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7806543203189187440
Running compilation step : cd /tmp/ltsmin7806543203189187440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 133 ms.
Running link step : cd /tmp/ltsmin7806543203189187440;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7806543203189187440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2406199473867833853.hoa' '--buchi-type=spotba'
LTSmin run took 122 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-15 finished in 1888 ms.
All properties solved by simple procedures.
Total runtime 21020 ms.

BK_STOP 1716769365099

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is QuasiCertifProtocol-PT-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662361400037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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