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.r109-tall-171624208300318.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 DBSingleClientW-PT-d1m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208300318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 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 DBSingleClientW-PT-d1m06-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716325143949

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 20:59:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:59:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:59:05] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-21 20:59:05] [INFO ] Transformed 1440 places.
[2024-05-21 20:59:05] [INFO ] Transformed 672 transitions.
[2024-05-21 20:59:05] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 178 place count 249 transition count 428
Iterating global reduction 1 with 77 rules applied. Total rules applied 255 place count 249 transition count 428
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 273 place count 249 transition count 410
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 330 place count 192 transition count 353
Iterating global reduction 2 with 57 rules applied. Total rules applied 387 place count 192 transition count 353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 390 place count 192 transition count 350
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 418 place count 164 transition count 309
Iterating global reduction 3 with 28 rules applied. Total rules applied 446 place count 164 transition count 309
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 475 place count 164 transition count 280
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 479 place count 160 transition count 273
Iterating global reduction 4 with 4 rules applied. Total rules applied 483 place count 160 transition count 273
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 489 place count 160 transition count 267
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 490 place count 159 transition count 266
Iterating global reduction 5 with 1 rules applied. Total rules applied 491 place count 159 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 492 place count 159 transition count 265
Applied a total of 492 rules in 64 ms. Remains 159 /347 variables (removed 188) and now considering 265/672 (removed 407) transitions.
// Phase 1: matrix 265 rows 159 cols
[2024-05-21 20:59:05] [INFO ] Computed 2 invariants in 16 ms
[2024-05-21 20:59:06] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-21 20:59:06] [INFO ] Invariant cache hit.
[2024-05-21 20:59:06] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-05-21 20:59:06] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2024-05-21 20:59:06] [INFO ] Invariant cache hit.
[2024-05-21 20:59:06] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 159/347 places, 265/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 989 ms. Remains : 159/347 places, 265/672 transitions.
Support contains 29 out of 159 places after structural reductions.
[2024-05-21 20:59:06] [INFO ] Flatten gal took : 42 ms
[2024-05-21 20:59:06] [INFO ] Flatten gal took : 18 ms
[2024-05-21 20:59:06] [INFO ] Input system was already deterministic with 265 transitions.
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 119 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 724010 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 8=1, 9=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1}
Probabilistic random walk after 724010 steps, saw 272599 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :19
Running SMT prover for 2 properties.
[2024-05-21 20:59:10] [INFO ] Invariant cache hit.
[2024-05-21 20:59:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:59:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 20:59:10] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 581 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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((G(p0) U X(p1)))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 202
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 138 transition count 199
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 122 transition count 180
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 122 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 81 place count 122 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 109 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 109 transition count 153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 111 place count 109 transition count 149
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 119 place count 101 transition count 136
Iterating global reduction 3 with 8 rules applied. Total rules applied 127 place count 101 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 101 transition count 134
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 135 place count 95 transition count 128
Iterating global reduction 4 with 6 rules applied. Total rules applied 141 place count 95 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 145 place count 95 transition count 124
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 148 place count 92 transition count 120
Iterating global reduction 5 with 3 rules applied. Total rules applied 151 place count 92 transition count 120
Applied a total of 151 rules in 34 ms. Remains 92 /159 variables (removed 67) and now considering 120/265 (removed 145) transitions.
// Phase 1: matrix 120 rows 92 cols
[2024-05-21 20:59:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:59:11] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 20:59:11] [INFO ] Invariant cache hit.
[2024-05-21 20:59:11] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 20:59:11] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-21 20:59:11] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 20:59:11] [INFO ] Invariant cache hit.
[2024-05-21 20:59:11] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/159 places, 120/265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 499 ms. Remains : 92/159 places, 120/265 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 347 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={1} source=0 dest: 2}, { cond=p0, acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s58 1)), p1:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-00 finished in 912 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(F(!(!p0 U G((F(G(F(p0))) U X(p1)))))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 199
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 138 transition count 197
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 122 transition count 178
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 122 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 122 transition count 174
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 93 place count 109 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 106 place count 109 transition count 153
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 111 place count 109 transition count 148
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 118 place count 102 transition count 137
Iterating global reduction 3 with 7 rules applied. Total rules applied 125 place count 102 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 102 transition count 136
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 132 place count 96 transition count 130
Iterating global reduction 4 with 6 rules applied. Total rules applied 138 place count 96 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 141 place count 96 transition count 127
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 144 place count 93 transition count 123
Iterating global reduction 5 with 3 rules applied. Total rules applied 147 place count 93 transition count 123
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 92 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 92 transition count 117
Applied a total of 149 rules in 16 ms. Remains 92 /159 variables (removed 67) and now considering 117/265 (removed 148) transitions.
// Phase 1: matrix 117 rows 92 cols
[2024-05-21 20:59:12] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 20:59:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 20:59:12] [INFO ] Invariant cache hit.
[2024-05-21 20:59:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 20:59:12] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-21 20:59:12] [INFO ] Invariant cache hit.
[2024-05-21 20:59:12] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/159 places, 117/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 92/159 places, 117/265 transitions.
Stuttering acceptance computed with spot in 182 ms :[p1, p1, p1, (AND p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0, 1} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1)), p1:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22920 reset in 223 ms.
Product exploration explored 100000 steps with 22961 reset in 170 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 310 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[p1, p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 510 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 448 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Finished probabilistic random walk after 44993 steps, run visited all 6 properties in 110 ms. (steps per millisecond=409 )
Probabilistic random walk after 44993 steps, saw 19262 distinct states, run finished after 111 ms. (steps per millisecond=405 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 170 ms :[p1, p1, p1, (AND p0 p1)]
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 117/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 20:59:14] [INFO ] Invariant cache hit.
[2024-05-21 20:59:14] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 20:59:14] [INFO ] Invariant cache hit.
[2024-05-21 20:59:14] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 20:59:14] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-21 20:59:14] [INFO ] Invariant cache hit.
[2024-05-21 20:59:14] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 92/92 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 310 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[p1, p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2333 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 503 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Finished probabilistic random walk after 44993 steps, run visited all 6 properties in 93 ms. (steps per millisecond=483 )
Probabilistic random walk after 44993 steps, saw 19262 distinct states, run finished after 93 ms. (steps per millisecond=483 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 263 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 172 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 171 ms :[p1, p1, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 22875 reset in 116 ms.
Product exploration explored 100000 steps with 22991 reset in 130 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 177 ms :[p1, p1, p1, (AND p0 p1)]
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 117/117 transitions.
Applied a total of 0 rules in 11 ms. Remains 92 /92 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 20:59:17] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 20:59:17] [INFO ] Invariant cache hit.
[2024-05-21 20:59:17] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 92/92 places, 117/117 transitions.
Built C files in :
/tmp/ltsmin2730983714015978428
[2024-05-21 20:59:17] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2730983714015978428
Running compilation step : cd /tmp/ltsmin2730983714015978428;'/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 294 ms.
Running link step : cd /tmp/ltsmin2730983714015978428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2730983714015978428;'/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/stateBased3611474344186368612.hoa' '--buchi-type=spotba'
LTSmin run took 135 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-01 finished in 5700 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((G(F(p0))&&(p1||X(p2))))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 139 transition count 213
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 139 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 139 transition count 212
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 58 place count 122 transition count 192
Iterating global reduction 1 with 17 rules applied. Total rules applied 75 place count 122 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 122 transition count 188
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 93 place count 108 transition count 164
Iterating global reduction 2 with 14 rules applied. Total rules applied 107 place count 108 transition count 164
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 114 place count 108 transition count 157
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 122 place count 100 transition count 145
Iterating global reduction 3 with 8 rules applied. Total rules applied 130 place count 100 transition count 145
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 137 place count 93 transition count 138
Iterating global reduction 3 with 7 rules applied. Total rules applied 144 place count 93 transition count 138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 149 place count 93 transition count 133
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 152 place count 90 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 155 place count 90 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 156 place count 89 transition count 123
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 89 transition count 123
Applied a total of 157 rules in 15 ms. Remains 89 /159 variables (removed 70) and now considering 123/265 (removed 142) transitions.
// Phase 1: matrix 123 rows 89 cols
[2024-05-21 20:59:17] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:59:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 20:59:17] [INFO ] Invariant cache hit.
[2024-05-21 20:59:17] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 20:59:18] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-21 20:59:18] [INFO ] Invariant cache hit.
[2024-05-21 20:59:18] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/159 places, 123/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 89/159 places, 123/265 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p2), true]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s85 1)), p1:(AND (GEQ s1 1) (GEQ s60 1)), p2:(AND (GEQ s1 1) (GEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-02 finished in 597 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 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 197
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 136 transition count 195
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 118 transition count 174
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 118 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 118 transition count 170
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 102 place count 104 transition count 148
Iterating global reduction 2 with 14 rules applied. Total rules applied 116 place count 104 transition count 148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 104 transition count 142
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 130 place count 96 transition count 129
Iterating global reduction 3 with 8 rules applied. Total rules applied 138 place count 96 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 96 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 145 place count 90 transition count 122
Iterating global reduction 4 with 6 rules applied. Total rules applied 151 place count 90 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 154 place count 90 transition count 119
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 157 place count 87 transition count 115
Iterating global reduction 5 with 3 rules applied. Total rules applied 160 place count 87 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 161 place count 86 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 86 transition count 109
Applied a total of 162 rules in 30 ms. Remains 86 /159 variables (removed 73) and now considering 109/265 (removed 156) transitions.
// Phase 1: matrix 109 rows 86 cols
[2024-05-21 20:59:18] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 20:59:18] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 20:59:18] [INFO ] Invariant cache hit.
[2024-05-21 20:59:18] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:59:18] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-21 20:59:18] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-21 20:59:18] [INFO ] Invariant cache hit.
[2024-05-21 20:59:18] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/159 places, 109/265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 86/159 places, 109/265 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s85 1))], 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 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-04 finished in 355 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 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 198
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 137 transition count 196
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 63 place count 120 transition count 176
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 120 transition count 176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 83 place count 120 transition count 173
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 98 place count 105 transition count 147
Iterating global reduction 2 with 15 rules applied. Total rules applied 113 place count 105 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 119 place count 105 transition count 141
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 128 place count 96 transition count 127
Iterating global reduction 3 with 9 rules applied. Total rules applied 137 place count 96 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 96 transition count 126
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 145 place count 89 transition count 119
Iterating global reduction 4 with 7 rules applied. Total rules applied 152 place count 89 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 157 place count 89 transition count 114
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 160 place count 86 transition count 110
Iterating global reduction 5 with 3 rules applied. Total rules applied 163 place count 86 transition count 110
Applied a total of 163 rules in 45 ms. Remains 86 /159 variables (removed 73) and now considering 110/265 (removed 155) transitions.
// Phase 1: matrix 110 rows 86 cols
[2024-05-21 20:59:18] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:59:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 20:59:18] [INFO ] Invariant cache hit.
[2024-05-21 20:59:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 20:59:19] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-21 20:59:19] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-21 20:59:19] [INFO ] Invariant cache hit.
[2024-05-21 20:59:19] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/159 places, 110/265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 86/159 places, 110/265 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s33 1))], 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 22938 reset in 151 ms.
Product exploration explored 100000 steps with 22918 reset in 159 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 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 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 987 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9128 steps, run visited all 1 properties in 28 ms. (steps per millisecond=326 )
Probabilistic random walk after 9128 steps, saw 4231 distinct states, run finished after 28 ms. (steps per millisecond=326 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 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 32 ms :[(NOT p0)]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 110/110 transitions.
Applied a total of 0 rules in 8 ms. Remains 86 /86 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 20:59:19] [INFO ] Invariant cache hit.
[2024-05-21 20:59:19] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 20:59:19] [INFO ] Invariant cache hit.
[2024-05-21 20:59:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 20:59:20] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-21 20:59:20] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 20:59:20] [INFO ] Invariant cache hit.
[2024-05-21 20:59:20] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 86/86 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 57 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 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2325 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9128 steps, run visited all 1 properties in 13 ms. (steps per millisecond=702 )
Probabilistic random walk after 9128 steps, saw 4231 distinct states, run finished after 13 ms. (steps per millisecond=702 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22915 reset in 108 ms.
Product exploration explored 100000 steps with 22963 reset in 112 ms.
Built C files in :
/tmp/ltsmin12093645464319708692
[2024-05-21 20:59:20] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-21 20:59:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:59:20] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-21 20:59:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:59:20] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-21 20:59:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:59:20] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12093645464319708692
Running compilation step : cd /tmp/ltsmin12093645464319708692;'/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 222 ms.
Running link step : cd /tmp/ltsmin12093645464319708692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12093645464319708692;'/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/stateBased12426305496003720177.hoa' '--buchi-type=spotba'
LTSmin run took 310 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-05 finished in 2451 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(G(p0))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 201
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 137 transition count 198
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 64 place count 120 transition count 178
Iterating global reduction 1 with 17 rules applied. Total rules applied 81 place count 120 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 120 transition count 174
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 99 place count 106 transition count 150
Iterating global reduction 2 with 14 rules applied. Total rules applied 113 place count 106 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 118 place count 106 transition count 145
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 126 place count 98 transition count 132
Iterating global reduction 3 with 8 rules applied. Total rules applied 134 place count 98 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 98 transition count 130
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 142 place count 92 transition count 124
Iterating global reduction 4 with 6 rules applied. Total rules applied 148 place count 92 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 152 place count 92 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 155 place count 89 transition count 116
Iterating global reduction 5 with 3 rules applied. Total rules applied 158 place count 89 transition count 116
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 88 transition count 110
Applied a total of 160 rules in 9 ms. Remains 88 /159 variables (removed 71) and now considering 110/265 (removed 155) transitions.
// Phase 1: matrix 110 rows 88 cols
[2024-05-21 20:59:21] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:59:21] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 20:59:21] [INFO ] Invariant cache hit.
[2024-05-21 20:59:21] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 20:59:21] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-21 20:59:21] [INFO ] Invariant cache hit.
[2024-05-21 20:59:21] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/159 places, 110/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 88/159 places, 110/265 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s83 1))], 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 23121 reset in 113 ms.
Product exploration explored 100000 steps with 23100 reset in 118 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 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 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2283 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17377 steps, run visited all 1 properties in 25 ms. (steps per millisecond=695 )
Probabilistic random walk after 17377 steps, saw 8260 distinct states, run finished after 25 ms. (steps per millisecond=695 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 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 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 20:59:22] [INFO ] Invariant cache hit.
[2024-05-21 20:59:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 20:59:22] [INFO ] Invariant cache hit.
[2024-05-21 20:59:22] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 20:59:22] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-21 20:59:22] [INFO ] Invariant cache hit.
[2024-05-21 20:59:22] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 88/88 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 65 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 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2360 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17377 steps, run visited all 1 properties in 24 ms. (steps per millisecond=724 )
Probabilistic random walk after 17377 steps, saw 8260 distinct states, run finished after 24 ms. (steps per millisecond=724 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 161 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 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22912 reset in 106 ms.
Product exploration explored 100000 steps with 22940 reset in 105 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 14 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 20:59:23] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:59:23] [INFO ] Invariant cache hit.
[2024-05-21 20:59:24] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 88/88 places, 110/110 transitions.
Built C files in :
/tmp/ltsmin6312732990871293844
[2024-05-21 20:59:24] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6312732990871293844
Running compilation step : cd /tmp/ltsmin6312732990871293844;'/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 204 ms.
Running link step : cd /tmp/ltsmin6312732990871293844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6312732990871293844;'/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/stateBased2816490000727747395.hoa' '--buchi-type=spotba'
LTSmin run took 367 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-08 finished in 3395 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)||X((!p1 U ((F(p2) U p0)||G(!p1))))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 139 transition count 212
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 139 transition count 212
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 139 transition count 209
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 59 place count 123 transition count 190
Iterating global reduction 1 with 16 rules applied. Total rules applied 75 place count 123 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 123 transition count 186
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 111 transition count 164
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 111 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 108 place count 111 transition count 159
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 104 transition count 150
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 104 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 104 transition count 148
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 129 place count 99 transition count 143
Iterating global reduction 4 with 5 rules applied. Total rules applied 134 place count 99 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 99 transition count 140
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 139 place count 97 transition count 137
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 97 transition count 137
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 96 transition count 131
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 96 transition count 131
Applied a total of 143 rules in 10 ms. Remains 96 /159 variables (removed 63) and now considering 131/265 (removed 134) transitions.
// Phase 1: matrix 131 rows 96 cols
[2024-05-21 20:59:24] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 20:59:24] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 20:59:24] [INFO ] Invariant cache hit.
[2024-05-21 20:59:24] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 20:59:24] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-21 20:59:24] [INFO ] Invariant cache hit.
[2024-05-21 20:59:24] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/159 places, 131/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 96/159 places, 131/265 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s91 1)), p1:(AND (GEQ s1 1) (GEQ s88 1))], 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]]
Product exploration explored 100000 steps with 22993 reset in 127 ms.
Product exploration explored 100000 steps with 22875 reset in 134 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 332 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 84 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2316 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 424 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Finished probabilistic random walk after 44022 steps, run visited all 5 properties in 122 ms. (steps per millisecond=360 )
Probabilistic random walk after 44022 steps, saw 18863 distinct states, run finished after 122 ms. (steps per millisecond=360 ) properties seen :5
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 207 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Support contains 3 out of 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 131/131 transitions.
Applied a total of 0 rules in 7 ms. Remains 96 /96 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-21 20:59:26] [INFO ] Invariant cache hit.
[2024-05-21 20:59:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 20:59:26] [INFO ] Invariant cache hit.
[2024-05-21 20:59:26] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 20:59:27] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-21 20:59:27] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 20:59:27] [INFO ] Invariant cache hit.
[2024-05-21 20:59:27] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 96/96 places, 131/131 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 332 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 123 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2325 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Finished probabilistic random walk after 44022 steps, run visited all 5 properties in 116 ms. (steps per millisecond=379 )
Probabilistic random walk after 44022 steps, saw 18863 distinct states, run finished after 116 ms. (steps per millisecond=379 ) properties seen :5
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F p0), (F (AND p1 p0)), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 11 factoid took 233 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 22958 reset in 137 ms.
Product exploration explored 100000 steps with 22833 reset in 139 ms.
Built C files in :
/tmp/ltsmin2466106225906978997
[2024-05-21 20:59:29] [INFO ] Computing symmetric may disable matrix : 131 transitions.
[2024-05-21 20:59:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:59:29] [INFO ] Computing symmetric may enable matrix : 131 transitions.
[2024-05-21 20:59:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:59:29] [INFO ] Computing Do-Not-Accords matrix : 131 transitions.
[2024-05-21 20:59:29] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:59:29] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2466106225906978997
Running compilation step : cd /tmp/ltsmin2466106225906978997;'/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 288 ms.
Running link step : cd /tmp/ltsmin2466106225906978997;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2466106225906978997;'/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/stateBased18123501343222458904.hoa' '--buchi-type=spotba'
LTSmin run took 150 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-10 finished in 4987 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((F(G(p0))||G(p1))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 206
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 138 transition count 203
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 122 transition count 184
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 122 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 81 place count 122 transition count 180
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 93 place count 110 transition count 158
Iterating global reduction 2 with 12 rules applied. Total rules applied 105 place count 110 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 111 place count 110 transition count 152
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 118 place count 103 transition count 143
Iterating global reduction 3 with 7 rules applied. Total rules applied 125 place count 103 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 103 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 132 place count 98 transition count 136
Iterating global reduction 4 with 5 rules applied. Total rules applied 137 place count 98 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 141 place count 98 transition count 132
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 143 place count 96 transition count 129
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 96 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 95 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 95 transition count 123
Applied a total of 147 rules in 13 ms. Remains 95 /159 variables (removed 64) and now considering 123/265 (removed 142) transitions.
// Phase 1: matrix 123 rows 95 cols
[2024-05-21 20:59:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:59:29] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 20:59:29] [INFO ] Invariant cache hit.
[2024-05-21 20:59:29] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 20:59:29] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-21 20:59:29] [INFO ] Invariant cache hit.
[2024-05-21 20:59:29] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/159 places, 123/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 95/159 places, 123/265 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s86 1)), p0:(OR (LT s1 1) (LT s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23021 reset in 115 ms.
Product exploration explored 100000 steps with 22904 reset in 117 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 325 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Finished probabilistic random walk after 20248 steps, run visited all 2 properties in 73 ms. (steps per millisecond=277 )
Probabilistic random walk after 20248 steps, saw 9385 distinct states, run finished after 73 ms. (steps per millisecond=277 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 123/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-21 20:59:30] [INFO ] Invariant cache hit.
[2024-05-21 20:59:30] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 20:59:30] [INFO ] Invariant cache hit.
[2024-05-21 20:59:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 20:59:31] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-21 20:59:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:59:31] [INFO ] Invariant cache hit.
[2024-05-21 20:59:31] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 95/95 places, 123/123 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 325 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 70 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2309 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 20248 steps, run visited all 2 properties in 100 ms. (steps per millisecond=202 )
Probabilistic random walk after 20248 steps, saw 9385 distinct states, run finished after 100 ms. (steps per millisecond=202 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 22956 reset in 106 ms.
Product exploration explored 100000 steps with 23054 reset in 125 ms.
Built C files in :
/tmp/ltsmin3977395955863170957
[2024-05-21 20:59:32] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2024-05-21 20:59:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:59:32] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2024-05-21 20:59:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:59:32] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2024-05-21 20:59:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:59:32] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3977395955863170957
Running compilation step : cd /tmp/ltsmin3977395955863170957;'/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 251 ms.
Running link step : cd /tmp/ltsmin3977395955863170957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3977395955863170957;'/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/stateBased15886014072652769920.hoa' '--buchi-type=spotba'
LTSmin run took 325 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-12 finished in 3243 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((F(p1)&&p0)))'
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 138 transition count 202
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 59 place count 122 transition count 185
Iterating global reduction 1 with 16 rules applied. Total rules applied 75 place count 122 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 122 transition count 181
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 110 transition count 159
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 110 transition count 159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 109 place count 110 transition count 153
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 115 place count 104 transition count 146
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 104 transition count 146
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 126 place count 99 transition count 141
Iterating global reduction 3 with 5 rules applied. Total rules applied 131 place count 99 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 136 place count 99 transition count 136
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 98 transition count 135
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 98 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 97 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 97 transition count 129
Applied a total of 140 rules in 18 ms. Remains 97 /159 variables (removed 62) and now considering 129/265 (removed 136) transitions.
// Phase 1: matrix 129 rows 97 cols
[2024-05-21 20:59:32] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:59:32] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 20:59:32] [INFO ] Invariant cache hit.
[2024-05-21 20:59:33] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 20:59:33] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-21 20:59:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:59:33] [INFO ] Invariant cache hit.
[2024-05-21 20:59:33] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/159 places, 129/265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 97/159 places, 129/265 transitions.
Stuttering acceptance computed with spot in 610 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s58 1) (GEQ s1 1) (GEQ s90 1)), p0:(AND (GEQ s30 1) (GEQ s36 1))], 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, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-13 finished in 968 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 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 197
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 136 transition count 195
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 118 transition count 174
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 118 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 118 transition count 170
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 102 place count 104 transition count 148
Iterating global reduction 2 with 14 rules applied. Total rules applied 116 place count 104 transition count 148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 104 transition count 142
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 130 place count 96 transition count 129
Iterating global reduction 3 with 8 rules applied. Total rules applied 138 place count 96 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 96 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 145 place count 90 transition count 122
Iterating global reduction 4 with 6 rules applied. Total rules applied 151 place count 90 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 154 place count 90 transition count 119
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 157 place count 87 transition count 115
Iterating global reduction 5 with 3 rules applied. Total rules applied 160 place count 87 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 161 place count 86 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 86 transition count 109
Applied a total of 162 rules in 13 ms. Remains 86 /159 variables (removed 73) and now considering 109/265 (removed 156) transitions.
// Phase 1: matrix 109 rows 86 cols
[2024-05-21 20:59:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:59:33] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 20:59:33] [INFO ] Invariant cache hit.
[2024-05-21 20:59:33] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:59:34] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-21 20:59:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:59:34] [INFO ] Invariant cache hit.
[2024-05-21 20:59:34] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/159 places, 109/265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 86/159 places, 109/265 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s85 1))], 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 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-14 finished in 330 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||(p0 U p1)||X(F((F(!p3)&&p2))))))'
Support contains 6 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 140 transition count 205
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 140 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 140 transition count 203
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 53 place count 127 transition count 189
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 127 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 68 place count 127 transition count 187
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 79 place count 116 transition count 168
Iterating global reduction 2 with 11 rules applied. Total rules applied 90 place count 116 transition count 168
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 116 transition count 162
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 102 place count 110 transition count 152
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 110 transition count 152
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 113 place count 105 transition count 147
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 105 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 123 place count 105 transition count 142
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 104 transition count 141
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 104 transition count 141
Applied a total of 125 rules in 7 ms. Remains 104 /159 variables (removed 55) and now considering 141/265 (removed 124) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-05-21 20:59:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:59:34] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 20:59:34] [INFO ] Invariant cache hit.
[2024-05-21 20:59:34] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 20:59:34] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-21 20:59:34] [INFO ] Invariant cache hit.
[2024-05-21 20:59:34] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/159 places, 141/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 104/159 places, 141/265 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p1) p3)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s68 1)), p1:(AND (GEQ s20 1) (GEQ s84 1)), p2:(AND (GEQ s1 1) (GEQ s66 1)), p3:(AND (GEQ s1 1) (GEQ s96 1))], 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 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-15 finished in 447 ms.
All properties solved by simple procedures.
Total runtime 29237 ms.

BK_STOP 1716325175676

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -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="DBSingleClientW-PT-d1m06"
export BK_EXAMINATION="LTLFireability"
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 DBSingleClientW-PT-d1m06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624208300318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m06.tgz
mv DBSingleClientW-PT-d1m06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;