Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472281900212.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DBSingleClientW-PT-d1m07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281900212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 9.1K Jun 7 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 7 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 17:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 7 17:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 7 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 432K Jun 6 12:11 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-d1m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654776892113

Running Version 202205111006
[2022-06-09 12:14:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 12:14:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 12:14:53] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2022-06-09 12:14:53] [INFO ] Transformed 1440 places.
[2022-06-09 12:14:53] [INFO ] Transformed 672 transitions.
[2022-06-09 12:14:53] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1093 places in 12 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 182 place count 245 transition count 411
Iterating global reduction 1 with 81 rules applied. Total rules applied 263 place count 245 transition count 411
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 272 place count 245 transition count 402
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 333 place count 184 transition count 341
Iterating global reduction 2 with 61 rules applied. Total rules applied 394 place count 184 transition count 341
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 398 place count 184 transition count 337
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 424 place count 158 transition count 300
Iterating global reduction 3 with 26 rules applied. Total rules applied 450 place count 158 transition count 300
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 476 place count 158 transition count 274
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 483 place count 151 transition count 262
Iterating global reduction 4 with 7 rules applied. Total rules applied 490 place count 151 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 493 place count 151 transition count 259
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 496 place count 148 transition count 256
Iterating global reduction 5 with 3 rules applied. Total rules applied 499 place count 148 transition count 256
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 502 place count 145 transition count 253
Iterating global reduction 5 with 3 rules applied. Total rules applied 505 place count 145 transition count 253
Applied a total of 505 rules in 92 ms. Remains 145 /347 variables (removed 202) and now considering 253/672 (removed 419) transitions.
// Phase 1: matrix 253 rows 145 cols
[2022-06-09 12:14:53] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-09 12:14:54] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 253 rows 145 cols
[2022-06-09 12:14:54] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 12:14:54] [INFO ] State equation strengthened by 122 read => feed constraints.
[2022-06-09 12:14:54] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
// Phase 1: matrix 253 rows 145 cols
[2022-06-09 12:14:54] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 12:14:54] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/347 places, 253/672 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/347 places, 253/672 transitions.
Support contains 28 out of 145 places after structural reductions.
[2022-06-09 12:14:54] [INFO ] Flatten gal took : 48 ms
[2022-06-09 12:14:55] [INFO ] Flatten gal took : 20 ms
[2022-06-09 12:14:55] [INFO ] Input system was already deterministic with 253 transitions.
Support contains 27 out of 145 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 63 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 657225 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 18=1, 19=1, 20=1, 21=1, 22=1}
Probabilistic random walk after 657225 steps, saw 247411 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :22
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 145 cols
[2022-06-09 12:14:58] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 12:14:58] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2022-06-09 12:14:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:14:59] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 5 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 253/253 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 124 transition count 181
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 124 transition count 181
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 124 transition count 179
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 108 transition count 159
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 108 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 81 place count 108 transition count 154
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 93 place count 96 transition count 137
Iterating global reduction 2 with 12 rules applied. Total rules applied 105 place count 96 transition count 137
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 96 transition count 131
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 117 place count 90 transition count 117
Iterating global reduction 3 with 6 rules applied. Total rules applied 123 place count 90 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 90 transition count 115
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 129 place count 86 transition count 110
Iterating global reduction 4 with 4 rules applied. Total rules applied 133 place count 86 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 136 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 137 place count 85 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 138 place count 85 transition count 106
Applied a total of 138 rules in 31 ms. Remains 85 /145 variables (removed 60) and now considering 106/253 (removed 147) transitions.
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 12:14:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:14:59] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 12:14:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:14:59] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 12:14:59] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2022-06-09 12:14:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 12:14:59] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:14:59] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/145 places, 106/253 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/145 places, 106/253 transitions.
Stuttering acceptance computed with spot in 1282 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s78 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 7 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-00 finished in 1771 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 253/253 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 126 transition count 191
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 126 transition count 191
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 126 transition count 189
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 112 transition count 171
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 112 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 73 place count 112 transition count 166
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 83 place count 102 transition count 150
Iterating global reduction 2 with 10 rules applied. Total rules applied 93 place count 102 transition count 150
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 99 place count 102 transition count 144
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 96 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 96 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 114 place count 96 transition count 129
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 117 place count 93 transition count 125
Iterating global reduction 4 with 3 rules applied. Total rules applied 120 place count 93 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 93 transition count 122
Applied a total of 123 rules in 14 ms. Remains 93 /145 variables (removed 52) and now considering 122/253 (removed 131) transitions.
// Phase 1: matrix 122 rows 93 cols
[2022-06-09 12:15:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:01] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 122 rows 93 cols
[2022-06-09 12:15:01] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:15:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-09 12:15:01] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 93 cols
[2022-06-09 12:15:01] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 12:15:01] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/145 places, 122/253 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/145 places, 122/253 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s88 1) (GEQ s85 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-02 finished in 442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 253/253 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 125 transition count 182
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 125 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 125 transition count 180
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 110 transition count 162
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 110 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 76 place count 110 transition count 158
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 97 transition count 139
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 97 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 97 transition count 133
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 114 place count 91 transition count 123
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 91 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 123 place count 91 transition count 120
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 127 place count 87 transition count 115
Iterating global reduction 4 with 4 rules applied. Total rules applied 131 place count 87 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 86 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 86 transition count 111
Applied a total of 136 rules in 18 ms. Remains 86 /145 variables (removed 59) and now considering 111/253 (removed 142) transitions.
// Phase 1: matrix 111 rows 86 cols
[2022-06-09 12:15:01] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:15:01] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 111 rows 86 cols
[2022-06-09 12:15:01] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:15:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 12:15:01] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
// Phase 1: matrix 111 rows 86 cols
[2022-06-09 12:15:01] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 12:15:01] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/145 places, 111/253 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/145 places, 111/253 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s33 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-03 finished in 1151 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(X(F((X(F(p2))||p1))))||p0))))'
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 253/253 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 126 transition count 191
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 126 transition count 191
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 126 transition count 189
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 55 place count 111 transition count 170
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 111 transition count 170
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 111 transition count 164
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 98 transition count 145
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 98 transition count 145
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 98 transition count 139
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 114 place count 92 transition count 129
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 92 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 123 place count 92 transition count 126
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 127 place count 88 transition count 121
Iterating global reduction 4 with 4 rules applied. Total rules applied 131 place count 88 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 88 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 87 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 87 transition count 117
Applied a total of 136 rules in 27 ms. Remains 87 /145 variables (removed 58) and now considering 117/253 (removed 136) transitions.
// Phase 1: matrix 117 rows 87 cols
[2022-06-09 12:15:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:02] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 117 rows 87 cols
[2022-06-09 12:15:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:02] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-09 12:15:02] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2022-06-09 12:15:02] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 117 rows 87 cols
[2022-06-09 12:15:02] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 12:15:03] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/145 places, 117/253 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/145 places, 117/253 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s63 1)), p1:(OR (LT s1 1) (LT s55 1)), p0:(OR (LT s7 1) (LT s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23025 reset in 205 ms.
Product exploration explored 100000 steps with 22921 reset in 191 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 770215 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :{}
Probabilistic random walk after 770215 steps, saw 306573 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 117 rows 87 cols
[2022-06-09 12:15:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:15:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:15:07] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-06-09 12:15:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:15:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:15:07] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))
Knowledge based reduction with 7 factoid took 174 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-04 finished in 4713 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(((G(X(G(p0))) U X(p0))&&G(p1))))))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 253/253 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 126 transition count 194
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 126 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 126 transition count 191
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 56 place count 111 transition count 172
Iterating global reduction 1 with 15 rules applied. Total rules applied 71 place count 111 transition count 172
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 79 place count 111 transition count 164
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 99 transition count 147
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 99 transition count 147
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 99 transition count 142
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 114 place count 93 transition count 127
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 93 transition count 127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 93 transition count 123
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 127 place count 90 transition count 119
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 90 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 132 place count 90 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 133 place count 89 transition count 116
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 89 transition count 116
Applied a total of 134 rules in 29 ms. Remains 89 /145 variables (removed 56) and now considering 116/253 (removed 137) transitions.
// Phase 1: matrix 116 rows 89 cols
[2022-06-09 12:15:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:07] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 116 rows 89 cols
[2022-06-09 12:15:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 12:15:07] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2022-06-09 12:15:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 116 rows 89 cols
[2022-06-09 12:15:07] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 12:15:07] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/145 places, 116/253 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/145 places, 116/253 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s84 1)), p0:(AND (GEQ s1 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-07 finished in 502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(!p0) U !F(p1))&&G(X(X(G(p2)))))))'
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 253/253 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 127 transition count 192
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 127 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 127 transition count 190
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 113 transition count 172
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 113 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 70 place count 113 transition count 168
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 82 place count 101 transition count 150
Iterating global reduction 2 with 12 rules applied. Total rules applied 94 place count 101 transition count 150
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 101 transition count 144
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 105 place count 96 transition count 138
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 96 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 113 place count 96 transition count 135
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 116 place count 93 transition count 131
Iterating global reduction 4 with 3 rules applied. Total rules applied 119 place count 93 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 122 place count 93 transition count 128
Applied a total of 122 rules in 24 ms. Remains 93 /145 variables (removed 52) and now considering 128/253 (removed 125) transitions.
// Phase 1: matrix 128 rows 93 cols
[2022-06-09 12:15:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:08] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 128 rows 93 cols
[2022-06-09 12:15:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:08] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-09 12:15:08] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2022-06-09 12:15:08] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 128 rows 93 cols
[2022-06-09 12:15:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:08] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/145 places, 128/253 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/145 places, 128/253 transitions.
Stuttering acceptance computed with spot in 1083 ms :[(OR (NOT p2) p1), (AND p0 p1), p1, (NOT p2), p1, (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p0 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=0 dest: 5}], [{ cond=(AND p1 p0), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={2} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=1 dest: 5}], [{ cond=(AND p1 p0), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=3 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=3 dest: 7}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=3 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=3 dest: 10}, { cond=(AND p1 p0), acceptance={0, 1, 2} source=3 dest: 11}], [{ cond=(AND p1 p0), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=4 dest: 12}], [{ cond=(AND p1 p0), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={2} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 2} source=5 dest: 13}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={2} source=6 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=6 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 2} source=6 dest: 5}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=7 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=7 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=7 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 2} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1} source=7 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=7 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={1} source=7 dest: 9}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=7 dest: 10}, { cond=(AND p1 p0 p2), acceptance={0, 1} source=7 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={1} source=8 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=8 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=8 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=8 dest: 7}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={0, 1} source=8 dest: 8}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0, 1, 2} source=8 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={1} source=8 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=8 dest: 9}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=8 dest: 10}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 2} source=8 dest: 10}, { cond=(AND p1 p0 p2), acceptance={0, 1} source=8 dest: 11}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1, 2} source=8 dest: 11}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0, 1, 2} source=9 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=9 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=9 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=9 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=9 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 2} source=9 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1} source=9 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=9 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=9 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={1} source=9 dest: 9}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=9 dest: 10}, { cond=(AND p1 p0 p2), acceptance={0, 1} source=9 dest: 11}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=9 dest: 12}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1} source=9 dest: 14}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0, 1, 2} source=10 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={2} source=10 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=10 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=10 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 2} source=10 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=10 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={1} source=10 dest: 9}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=10 dest: 10}, { cond=(AND p1 p0 p2), acceptance={0, 1} source=10 dest: 11}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 2} source=10 dest: 13}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=10 dest: 15}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0, 1, 2} source=11 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=11 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=11 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0, 1, 2} source=11 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=11 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 2} source=11 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1} source=11 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=11 dest: 7}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={0, 1} source=11 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={1} source=11 dest: 9}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=11 dest: 10}, { cond=(AND p1 p0 p2), acceptance={0, 1} source=11 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=12 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=12 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=12 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=12 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=12 dest: 10}, { cond=(AND p1 p0), acceptance={0, 1, 2} source=12 dest: 11}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=12 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={2} source=13 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=13 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=13 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=13 dest: 10}, { cond=(AND p1 p0), acceptance={0, 1, 2} source=13 dest: 11}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 2} source=13 dest: 15}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=14 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=14 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={0, 1} source=14 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=14 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=14 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 2} source=14 dest: 10}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1, 2} source=14 dest: 11}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1} source=14 dest: 14}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=14 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=15 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={2} source=15 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=15 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=15 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={1} source=15 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=15 dest: 9}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=15 dest: 10}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 2} source=15 dest: 10}, { cond=(AND p1 p0 p2), acceptance={0, 1} source=15 dest: 11}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1, 2} source=15 dest: 11}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=15 dest: 15}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 2} source=15 dest: 15}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s88 1)), p0:(AND (GEQ s1 1) (GEQ s40 1)), p2:(OR (LT s7 1) (LT s35 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 23010 reset in 238 ms.
Product exploration explored 100000 steps with 23086 reset in 256 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 3788 ms. Reduced automaton from 16 states, 132 edges and 3 AP to 16 states, 132 edges and 3 AP.
Stuttering acceptance computed with spot in 716 ms :[(OR (NOT p2) p1), (AND p0 p1), p1, (NOT p2), p1, (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 226 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 225 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 229 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 988 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 259 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 218 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 992 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 128 rows 93 cols
[2022-06-09 12:15:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:15:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 12:15:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:15:15] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2022-06-09 12:15:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 12:15:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 12:15:16] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2022-06-09 12:15:16] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-09 12:15:16] [INFO ] After 206ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :3 sat :8
[2022-06-09 12:15:16] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 167 ms.
[2022-06-09 12:15:16] [INFO ] After 1178ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 93/93 places, 128/128 transitions.
Graph (complete) has 296 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 92 transition count 126
Applied a total of 3 rules in 7 ms. Remains 92 /93 variables (removed 1) and now considering 126/128 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/93 places, 126/128 transitions.
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 242 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 508 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 248 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 993 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 224 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 952 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Finished probabilistic random walk after 106549 steps, run visited all 8 properties in 409 ms. (steps per millisecond=260 )
Probabilistic random walk after 106549 steps, saw 44071 distinct states, run finished after 409 ms. (steps per millisecond=260 ) properties seen :8
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND p0 (NOT p1))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 24 factoid took 6262 ms. Reduced automaton from 16 states, 132 edges and 3 AP to 16 states, 100 edges and 3 AP.
Stuttering acceptance computed with spot in 1574 ms :[(OR p1 (AND (NOT p0) (NOT p2))), (AND p0 p1), p1, (AND (NOT p0) (NOT p2)), p1, (AND p0 p1), false, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 (NOT p2)), false]
Stuttering acceptance computed with spot in 729 ms :[(OR p1 (AND (NOT p0) (NOT p2))), (AND p0 p1), p1, (AND (NOT p0) (NOT p2)), p1, (AND p0 p1), false, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 (NOT p2)), false]
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 93 cols
[2022-06-09 12:15:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:26] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 128 rows 93 cols
[2022-06-09 12:15:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:26] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-09 12:15:26] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 93 cols
[2022-06-09 12:15:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:26] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 128/128 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 8198 ms. Reduced automaton from 16 states, 100 edges and 3 AP to 16 states, 100 edges and 3 AP.
Stuttering acceptance computed with spot in 956 ms :[(OR p1 (AND (NOT p0) (NOT p2))), (AND p0 p1), p1, (AND (NOT p0) (NOT p2)), p1, (AND p0 p1), false, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 (NOT p2)), false]
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 229 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 261 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1026 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 947 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 460 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 953 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 128 rows 93 cols
[2022-06-09 12:15:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:15:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 16 ms returned sat
[2022-06-09 12:15:36] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-09 12:15:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:15:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 12:15:36] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-06-09 12:15:36] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-09 12:15:36] [INFO ] After 163ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2022-06-09 12:15:37] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 143 ms.
[2022-06-09 12:15:37] [INFO ] After 735ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 93/93 places, 128/128 transitions.
Graph (complete) has 296 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 92 transition count 126
Applied a total of 3 rules in 6 ms. Remains 92 /93 variables (removed 1) and now considering 126/128 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/93 places, 126/128 transitions.
Incomplete random walk after 10000 steps, including 2275 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 227 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 239 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1032 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 983 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Finished probabilistic random walk after 106549 steps, run visited all 7 properties in 399 ms. (steps per millisecond=267 )
Probabilistic random walk after 106549 steps, saw 44071 distinct states, run finished after 400 ms. (steps per millisecond=266 ) properties seen :7
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (F (AND (NOT p0) p2 p1))]
Knowledge based reduction with 18 factoid took 7674 ms. Reduced automaton from 16 states, 100 edges and 3 AP to 16 states, 100 edges and 3 AP.
Stuttering acceptance computed with spot in 645 ms :[(OR p1 (AND (NOT p0) (NOT p2))), (AND p0 p1), p1, (AND (NOT p0) (NOT p2)), p1, (AND p0 p1), false, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 (NOT p2)), false]
Stuttering acceptance computed with spot in 622 ms :[(OR p1 (AND (NOT p0) (NOT p2))), (AND p0 p1), p1, (AND (NOT p0) (NOT p2)), p1, (AND p0 p1), false, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 (NOT p2)), false]
Stuttering acceptance computed with spot in 689 ms :[(OR p1 (AND (NOT p0) (NOT p2))), (AND p0 p1), p1, (AND (NOT p0) (NOT p2)), p1, (AND p0 p1), false, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) p1 (NOT p2)), false]
Product exploration explored 100000 steps with 22965 reset in 202 ms.
Product exploration explored 100000 steps with 22987 reset in 302 ms.
Built C files in :
/tmp/ltsmin13530953058971062748
[2022-06-09 12:15:49] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13530953058971062748
Running compilation step : cd /tmp/ltsmin13530953058971062748;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 310 ms.
Running link step : cd /tmp/ltsmin13530953058971062748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 171 ms.
Running LTSmin : cd /tmp/ltsmin13530953058971062748;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6561443360295222069.hoa' '--buchi-type=spotba'
LTSmin run took 1271 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-09 finished in 43712 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 253/253 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 125 transition count 186
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 125 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 125 transition count 184
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 109 transition count 164
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 109 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 79 place count 109 transition count 159
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 92 place count 96 transition count 140
Iterating global reduction 2 with 13 rules applied. Total rules applied 105 place count 96 transition count 140
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 96 transition count 134
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 118 place count 89 transition count 118
Iterating global reduction 3 with 7 rules applied. Total rules applied 125 place count 89 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 128 place count 89 transition count 115
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 132 place count 85 transition count 110
Iterating global reduction 4 with 4 rules applied. Total rules applied 136 place count 85 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 139 place count 85 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 84 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 84 transition count 106
Applied a total of 141 rules in 13 ms. Remains 84 /145 variables (removed 61) and now considering 106/253 (removed 147) transitions.
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 12:15:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:51] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 12:15:51] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:15:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 12:15:51] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2022-06-09 12:15:51] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 12:15:51] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:15:51] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/145 places, 106/253 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/145 places, 106/253 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-10 finished in 446 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1)||(X(p2)&&X(p0)))))'
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 253/253 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 127 transition count 192
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 127 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 127 transition count 190
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 51 place count 114 transition count 176
Iterating global reduction 1 with 13 rules applied. Total rules applied 64 place count 114 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 69 place count 114 transition count 171
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 78 place count 105 transition count 156
Iterating global reduction 2 with 9 rules applied. Total rules applied 87 place count 105 transition count 156
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 93 place count 105 transition count 150
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 98 place count 100 transition count 139
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 100 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 100 transition count 138
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 107 place count 97 transition count 134
Iterating global reduction 4 with 3 rules applied. Total rules applied 110 place count 97 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 113 place count 97 transition count 131
Applied a total of 113 rules in 10 ms. Remains 97 /145 variables (removed 48) and now considering 131/253 (removed 122) transitions.
// Phase 1: matrix 131 rows 97 cols
[2022-06-09 12:15:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:15:52] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 131 rows 97 cols
[2022-06-09 12:15:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:52] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-09 12:15:52] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
// Phase 1: matrix 131 rows 97 cols
[2022-06-09 12:15:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:52] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/145 places, 131/253 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/145 places, 131/253 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s37 1) (GEQ s61 1)), p0:(AND (GEQ s1 1) (GEQ s91 1)), p2:(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, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-11 finished in 614 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U (F(X(p0)) U X(p1))))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 253/253 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 126 transition count 185
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 126 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 126 transition count 184
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 54 place count 111 transition count 165
Iterating global reduction 1 with 15 rules applied. Total rules applied 69 place count 111 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 74 place count 111 transition count 160
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 99 transition count 142
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 99 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 104 place count 99 transition count 136
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 94 transition count 127
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 94 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 117 place count 94 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 120 place count 91 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 123 place count 91 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 126 place count 91 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 127 place count 90 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 90 transition count 117
Applied a total of 128 rules in 9 ms. Remains 90 /145 variables (removed 55) and now considering 117/253 (removed 136) transitions.
// Phase 1: matrix 117 rows 90 cols
[2022-06-09 12:15:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:52] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 117 rows 90 cols
[2022-06-09 12:15:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:52] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 12:15:52] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
// Phase 1: matrix 117 rows 90 cols
[2022-06-09 12:15:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:53] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/145 places, 117/253 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/145 places, 117/253 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s44 1)), p0:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-13 finished in 435 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(p0)))||X(p1)))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 253/253 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 126 transition count 189
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 126 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 126 transition count 186
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 112 transition count 168
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 112 transition count 168
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 74 place count 112 transition count 163
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 85 place count 101 transition count 147
Iterating global reduction 2 with 11 rules applied. Total rules applied 96 place count 101 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 100 place count 101 transition count 143
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 106 place count 95 transition count 128
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 95 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 116 place count 95 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 119 place count 92 transition count 120
Iterating global reduction 4 with 3 rules applied. Total rules applied 122 place count 92 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 92 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 91 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 91 transition count 118
Applied a total of 125 rules in 13 ms. Remains 91 /145 variables (removed 54) and now considering 118/253 (removed 135) transitions.
// Phase 1: matrix 118 rows 91 cols
[2022-06-09 12:15:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:15:53] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 118 rows 91 cols
[2022-06-09 12:15:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 12:15:53] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
// Phase 1: matrix 118 rows 91 cols
[2022-06-09 12:15:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:15:53] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/145 places, 118/253 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/145 places, 118/253 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s90 1)), p1:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-14 finished in 435 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 253/253 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 125 transition count 183
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 125 transition count 183
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 125 transition count 182
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 109 transition count 162
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 109 transition count 162
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 78 place count 109 transition count 157
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 91 place count 96 transition count 138
Iterating global reduction 2 with 13 rules applied. Total rules applied 104 place count 96 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 110 place count 96 transition count 132
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 117 place count 89 transition count 116
Iterating global reduction 3 with 7 rules applied. Total rules applied 124 place count 89 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 127 place count 89 transition count 113
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 131 place count 85 transition count 108
Iterating global reduction 4 with 4 rules applied. Total rules applied 135 place count 85 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 138 place count 85 transition count 105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 84 transition count 104
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 84 transition count 104
Applied a total of 140 rules in 20 ms. Remains 84 /145 variables (removed 61) and now considering 104/253 (removed 149) transitions.
// Phase 1: matrix 104 rows 84 cols
[2022-06-09 12:15:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:15:53] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 104 rows 84 cols
[2022-06-09 12:15:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:53] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 12:15:53] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2022-06-09 12:15:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 104 rows 84 cols
[2022-06-09 12:15:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:53] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/145 places, 104/253 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/145 places, 104/253 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s81 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 23001 reset in 137 ms.
Product exploration explored 100000 steps with 23010 reset in 161 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 430 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4505 steps, run visited all 1 properties in 7 ms. (steps per millisecond=643 )
Probabilistic random walk after 4505 steps, saw 2082 distinct states, run finished after 7 ms. (steps per millisecond=643 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 104/104 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 84 cols
[2022-06-09 12:15:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:54] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 104 rows 84 cols
[2022-06-09 12:15:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:15:54] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 12:15:54] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2022-06-09 12:15:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 104 rows 84 cols
[2022-06-09 12:15:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:15:54] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 104/104 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2305 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4505 steps, run visited all 1 properties in 18 ms. (steps per millisecond=250 )
Probabilistic random walk after 4505 steps, saw 2082 distinct states, run finished after 18 ms. (steps per millisecond=250 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22924 reset in 104 ms.
Product exploration explored 100000 steps with 22947 reset in 140 ms.
Built C files in :
/tmp/ltsmin7038807908337801314
[2022-06-09 12:15:55] [INFO ] Computing symmetric may disable matrix : 104 transitions.
[2022-06-09 12:15:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 12:15:55] [INFO ] Computing symmetric may enable matrix : 104 transitions.
[2022-06-09 12:15:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 12:15:55] [INFO ] Computing Do-Not-Accords matrix : 104 transitions.
[2022-06-09 12:15:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 12:15:55] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7038807908337801314
Running compilation step : cd /tmp/ltsmin7038807908337801314;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 212 ms.
Running link step : cd /tmp/ltsmin7038807908337801314;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7038807908337801314;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14445997980548578710.hoa' '--buchi-type=spotba'
LTSmin run took 165 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-15 finished in 2667 ms.
All properties solved by simple procedures.
Total runtime 62919 ms.

BK_STOP 1654776956360

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m07, 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 r312-tall-165472281900212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m07.tgz
mv DBSingleClientW-PT-d1m07 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 ;