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-165472282000292.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-d2m10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282000292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.1K Jun 7 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 7 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 17:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Jun 7 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Jun 7 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Jun 7 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 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 1.6M 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-d2m10-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654790385874

Running Version 202205111006
[2022-06-09 15:59:46] [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 15:59:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 15:59:47] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2022-06-09 15:59:47] [INFO ] Transformed 4763 places.
[2022-06-09 15:59:47] [INFO ] Transformed 2478 transitions.
[2022-06-09 15:59:47] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 334 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 377 places :
Symmetric choice reduction at 1 with 377 rule applications. Total rules 622 place count 760 transition count 1424
Iterating global reduction 1 with 377 rules applied. Total rules applied 999 place count 760 transition count 1424
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 1039 place count 760 transition count 1384
Discarding 303 places :
Symmetric choice reduction at 2 with 303 rule applications. Total rules 1342 place count 457 transition count 1081
Iterating global reduction 2 with 303 rules applied. Total rules applied 1645 place count 457 transition count 1081
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1655 place count 457 transition count 1071
Discarding 223 places :
Symmetric choice reduction at 3 with 223 rule applications. Total rules 1878 place count 234 transition count 762
Iterating global reduction 3 with 223 rules applied. Total rules applied 2101 place count 234 transition count 762
Ensure Unique test removed 284 transitions
Reduce isomorphic transitions removed 284 transitions.
Iterating post reduction 3 with 284 rules applied. Total rules applied 2385 place count 234 transition count 478
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 2402 place count 217 transition count 449
Iterating global reduction 4 with 17 rules applied. Total rules applied 2419 place count 217 transition count 449
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 2444 place count 217 transition count 424
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2454 place count 207 transition count 414
Iterating global reduction 5 with 10 rules applied. Total rules applied 2464 place count 207 transition count 414
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2468 place count 207 transition count 410
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2475 place count 200 transition count 403
Iterating global reduction 6 with 7 rules applied. Total rules applied 2482 place count 200 transition count 403
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2491 place count 200 transition count 394
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2492 place count 199 transition count 392
Iterating global reduction 7 with 1 rules applied. Total rules applied 2493 place count 199 transition count 392
Applied a total of 2493 rules in 201 ms. Remains 199 /1183 variables (removed 984) and now considering 392/2478 (removed 2086) transitions.
// Phase 1: matrix 392 rows 199 cols
[2022-06-09 15:59:47] [INFO ] Computed 2 place invariants in 21 ms
[2022-06-09 15:59:47] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 392 rows 199 cols
[2022-06-09 15:59:47] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 15:59:48] [INFO ] State equation strengthened by 202 read => feed constraints.
[2022-06-09 15:59:48] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 199 cols
[2022-06-09 15:59:48] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 15:59:48] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 199/1183 places, 392/2478 transitions.
Finished structural reductions, in 1 iterations. Remains : 199/1183 places, 392/2478 transitions.
Support contains 30 out of 199 places after structural reductions.
[2022-06-09 15:59:49] [INFO ] Flatten gal took : 54 ms
[2022-06-09 15:59:49] [INFO ] Flatten gal took : 31 ms
[2022-06-09 15:59:49] [INFO ] Input system was already deterministic with 392 transitions.
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Finished probabilistic random walk after 116697 steps, run visited all 26 properties in 1183 ms. (steps per millisecond=98 )
Probabilistic random walk after 116697 steps, saw 48376 distinct states, run finished after 1183 ms. (steps per millisecond=98 ) properties seen :26
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' '!(X(X((((G(p0)||p1) U (F(!p2)||p3))&&F(p0)))))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 392/392 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 178 transition count 311
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 178 transition count 311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 47 place count 178 transition count 306
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 165 transition count 289
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 165 transition count 289
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 77 place count 165 transition count 285
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 89 place count 153 transition count 266
Iterating global reduction 2 with 12 rules applied. Total rules applied 101 place count 153 transition count 266
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 109 place count 153 transition count 258
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 117 place count 145 transition count 233
Iterating global reduction 3 with 8 rules applied. Total rules applied 125 place count 145 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 145 transition count 231
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 131 place count 141 transition count 227
Iterating global reduction 4 with 4 rules applied. Total rules applied 135 place count 141 transition count 227
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 141 transition count 224
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 143 place count 136 transition count 202
Iterating global reduction 5 with 5 rules applied. Total rules applied 148 place count 136 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 149 place count 136 transition count 201
Applied a total of 149 rules in 23 ms. Remains 136 /199 variables (removed 63) and now considering 201/392 (removed 191) transitions.
// Phase 1: matrix 201 rows 136 cols
[2022-06-09 15:59:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:59:52] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 201 rows 136 cols
[2022-06-09 15:59:52] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:59:52] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-06-09 15:59:52] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 136 cols
[2022-06-09 15:59:52] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 15:59:52] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/199 places, 201/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/199 places, 201/392 transitions.
Stuttering acceptance computed with spot in 3368 ms :[(OR (NOT p0) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), p2, (NOT p0), (AND p2 (NOT p0)), (AND p2 (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=2 dest: 5}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={0} source=6 dest: 5}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s87 1)), p2:(AND (GEQ s1 1) (GEQ s134 1)), p1:(AND (GEQ s1 1) (GEQ s98 1)), p0:(AND (GEQ s1 1) (GEQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-00 finished in 4135 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(X(X((F(p1)||p0))))))&&F(p2)))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 392/392 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 178 transition count 308
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 178 transition count 308
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 178 transition count 302
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 61 place count 165 transition count 288
Iterating global reduction 1 with 13 rules applied. Total rules applied 74 place count 165 transition count 288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 165 transition count 284
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 90 place count 153 transition count 265
Iterating global reduction 2 with 12 rules applied. Total rules applied 102 place count 153 transition count 265
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 109 place count 153 transition count 258
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 117 place count 145 transition count 234
Iterating global reduction 3 with 8 rules applied. Total rules applied 125 place count 145 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 145 transition count 232
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 131 place count 141 transition count 227
Iterating global reduction 4 with 4 rules applied. Total rules applied 135 place count 141 transition count 227
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 137 place count 139 transition count 225
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 139 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 139 transition count 224
Applied a total of 140 rules in 19 ms. Remains 139 /199 variables (removed 60) and now considering 224/392 (removed 168) transitions.
// Phase 1: matrix 224 rows 139 cols
[2022-06-09 15:59:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:59:56] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 224 rows 139 cols
[2022-06-09 15:59:56] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-09 15:59:56] [INFO ] State equation strengthened by 90 read => feed constraints.
[2022-06-09 15:59:56] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
// Phase 1: matrix 224 rows 139 cols
[2022-06-09 15:59:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:59:56] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 139/199 places, 224/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 139/199 places, 224/392 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s21 1) (GEQ s114 1)), p1:(OR (LT s1 1) (LT s133 1)), p0:(OR (LT s1 1) (LT s73 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-02 finished in 725 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 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 392/392 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 176 transition count 309
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 176 transition count 309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 176 transition count 303
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 67 place count 161 transition count 284
Iterating global reduction 1 with 15 rules applied. Total rules applied 82 place count 161 transition count 284
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 86 place count 161 transition count 280
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 100 place count 147 transition count 258
Iterating global reduction 2 with 14 rules applied. Total rules applied 114 place count 147 transition count 258
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 122 place count 147 transition count 250
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 133 place count 136 transition count 216
Iterating global reduction 3 with 11 rules applied. Total rules applied 144 place count 136 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 136 transition count 215
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 151 place count 130 transition count 208
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 130 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 163 place count 130 transition count 202
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 168 place count 125 transition count 180
Iterating global reduction 5 with 5 rules applied. Total rules applied 173 place count 125 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 174 place count 125 transition count 179
Applied a total of 174 rules in 44 ms. Remains 125 /199 variables (removed 74) and now considering 179/392 (removed 213) transitions.
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 15:59:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:59:57] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 15:59:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:59:57] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-09 15:59:57] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2022-06-09 15:59:57] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 15:59:57] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:59:57] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/199 places, 179/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/199 places, 179/392 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-05 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 s94 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 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-05 finished in 520 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1) U ((p3 U G(X(!p4)))||p2))))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 392/392 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 180 transition count 315
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 180 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 180 transition count 311
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 55 place count 167 transition count 294
Iterating global reduction 1 with 13 rules applied. Total rules applied 68 place count 167 transition count 294
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 167 transition count 290
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 84 place count 155 transition count 271
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 155 transition count 271
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 155 transition count 267
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 108 place count 147 transition count 253
Iterating global reduction 3 with 8 rules applied. Total rules applied 116 place count 147 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 147 transition count 252
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 123 place count 141 transition count 245
Iterating global reduction 4 with 6 rules applied. Total rules applied 129 place count 141 transition count 245
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 134 place count 141 transition count 240
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 137 place count 138 transition count 233
Iterating global reduction 5 with 3 rules applied. Total rules applied 140 place count 138 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 141 place count 138 transition count 232
Applied a total of 141 rules in 20 ms. Remains 138 /199 variables (removed 61) and now considering 232/392 (removed 160) transitions.
// Phase 1: matrix 232 rows 138 cols
[2022-06-09 15:59:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:59:57] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 232 rows 138 cols
[2022-06-09 15:59:57] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:59:57] [INFO ] State equation strengthened by 105 read => feed constraints.
[2022-06-09 15:59:58] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 138 cols
[2022-06-09 15:59:58] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:59:58] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/199 places, 232/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/199 places, 232/392 transitions.
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p2) p4), p4, (AND (NOT p2) p4), (AND (NOT p1) p4), p4, (AND (NOT p1) p4), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p4), acceptance={} source=1 dest: 1}, { cond=p4, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p1 (NOT p4)) (AND (NOT p2) p0 (NOT p4))), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) p1 p4) (AND (NOT p2) p0 p4)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p4)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p4), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0 p4), acceptance={} source=3 dest: 7}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p4)), acceptance={} source=4 dest: 4}, { cond=(AND p3 p4), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p1) p0 (NOT p4)), acceptance={} source=5 dest: 5}, { cond=(AND p3 (NOT p1) p0 p4), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p4:(AND (GEQ s1 1) (GEQ s82 1)), p2:(OR (AND (GEQ s1 1) (GEQ s101 1)) (AND (GEQ s1 1) (GEQ s96 1))), p3:(AND (GEQ s1 1) (GEQ s73 1)), p1:(AND (GEQ s1 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23133 reset in 353 ms.
Product exploration explored 100000 steps with 23013 reset in 248 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 p4) (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1 (NOT p4)) (AND (NOT p2) p0 (NOT p4))))), (X (NOT (OR (AND (NOT p2) p1 p4) (AND (NOT p2) p0 p4)))), (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) p1 p4) (AND (NOT p2) p0 p4))))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 p4)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p1) p0 p4)))), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) p1 (NOT p4)) (AND (NOT p2) p0 (NOT p4)))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) p4)))), (X (X (AND (NOT p1) (NOT p0) (NOT p4))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1462 ms. Reduced automaton from 8 states, 24 edges and 5 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[true, p4, p4, p4]
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 424 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17353 steps, run visited all 1 properties in 41 ms. (steps per millisecond=423 )
Probabilistic random walk after 17353 steps, saw 8578 distinct states, run finished after 42 ms. (steps per millisecond=413 ) properties seen :1
Knowledge obtained : [(AND (NOT p4) (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1 (NOT p4)) (AND (NOT p2) p0 (NOT p4))))), (X (NOT (OR (AND (NOT p2) p1 p4) (AND (NOT p2) p0 p4)))), (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) p1 p4) (AND (NOT p2) p0 p4))))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 p4)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p1) p0 p4)))), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (NOT (OR (AND (NOT p2) p1 (NOT p4)) (AND (NOT p2) p0 (NOT p4)))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) p4)))), (X (X (AND (NOT p1) (NOT p0) (NOT p4))))]
False Knowledge obtained : [(F p4)]
Knowledge based reduction with 26 factoid took 953 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 118 ms :[true, p4, p4, p4]
Stuttering acceptance computed with spot in 106 ms :[true, p4, p4, p4]
Support contains 2 out of 138 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 232/232 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 232/232 (removed 0) transitions.
// Phase 1: matrix 232 rows 138 cols
[2022-06-09 16:00:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:00:01] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 232 rows 138 cols
[2022-06-09 16:00:01] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 16:00:02] [INFO ] State equation strengthened by 105 read => feed constraints.
[2022-06-09 16:00:02] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 138 cols
[2022-06-09 16:00:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:00:02] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 232/232 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 : [(NOT p4), (X (X (NOT p4)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 126 ms :[true, p4, p4, p4]
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 438 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17353 steps, run visited all 1 properties in 44 ms. (steps per millisecond=394 )
Probabilistic random walk after 17353 steps, saw 8578 distinct states, run finished after 44 ms. (steps per millisecond=394 ) properties seen :1
Knowledge obtained : [(NOT p4), (X (X (NOT p4)))]
False Knowledge obtained : [(F p4)]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 111 ms :[true, p4, p4, p4]
Stuttering acceptance computed with spot in 116 ms :[true, p4, p4, p4]
Stuttering acceptance computed with spot in 129 ms :[true, p4, p4, p4]
Product exploration explored 100000 steps with 23075 reset in 166 ms.
Product exploration explored 100000 steps with 23071 reset in 193 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 102 ms :[true, p4, p4, p4]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 232/232 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 134 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 134 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 134 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 132 transition count 208
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 132 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 131 transition count 206
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 131 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 131 transition count 205
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 130 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 130 transition count 197
Applied a total of 19 rules in 37 ms. Remains 130 /138 variables (removed 8) and now considering 197/232 (removed 35) transitions.
[2022-06-09 16:00:03] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 197 rows 130 cols
[2022-06-09 16:00:03] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 16:00:03] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/138 places, 197/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/138 places, 197/232 transitions.
Product exploration explored 100000 steps with 23052 reset in 403 ms.
Product exploration explored 100000 steps with 23018 reset in 383 ms.
Built C files in :
/tmp/ltsmin5416728280194769632
[2022-06-09 16:00:04] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5416728280194769632
Running compilation step : cd /tmp/ltsmin5416728280194769632;'/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 423 ms.
Running link step : cd /tmp/ltsmin5416728280194769632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5416728280194769632;'/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/stateBased12845905378812660005.hoa' '--buchi-type=spotba'
LTSmin run took 890 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-06 finished in 8578 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(F(G(!(p0 U p1))))||F(p2)))||(p3 U p0)))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 392/392 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 178 transition count 313
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 178 transition count 313
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 178 transition count 306
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 166 transition count 290
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 166 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 166 transition count 288
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 86 place count 155 transition count 272
Iterating global reduction 2 with 11 rules applied. Total rules applied 97 place count 155 transition count 272
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 103 place count 155 transition count 266
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 111 place count 147 transition count 242
Iterating global reduction 3 with 8 rules applied. Total rules applied 119 place count 147 transition count 242
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 124 place count 142 transition count 236
Iterating global reduction 3 with 5 rules applied. Total rules applied 129 place count 142 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 132 place count 142 transition count 233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 136 place count 138 transition count 216
Iterating global reduction 4 with 4 rules applied. Total rules applied 140 place count 138 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 138 transition count 215
Applied a total of 141 rules in 44 ms. Remains 138 /199 variables (removed 61) and now considering 215/392 (removed 177) transitions.
// Phase 1: matrix 215 rows 138 cols
[2022-06-09 16:00:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:00:06] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 215 rows 138 cols
[2022-06-09 16:00:06] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 16:00:06] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 16:00:06] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2022-06-09 16:00:06] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 215 rows 138 cols
[2022-06-09 16:00:06] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 16:00:06] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/199 places, 215/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/199 places, 215/392 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s128 1)), p3:(AND (GEQ s1 1) (GEQ s94 1)), p1:(AND (GEQ s1 1) (GEQ s131 1)), p2:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 22998 reset in 284 ms.
Product exploration explored 100000 steps with 23077 reset in 248 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 p0) (NOT p3) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p3))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 539 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 535 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Finished probabilistic random walk after 16485 steps, run visited all 2 properties in 80 ms. (steps per millisecond=206 )
Probabilistic random walk after 16485 steps, saw 8016 distinct states, run finished after 80 ms. (steps per millisecond=206 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p3))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 18 factoid took 2366 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 101 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 3 out of 138 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 215/215 transitions.
Applied a total of 0 rules in 13 ms. Remains 138 /138 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 138 cols
[2022-06-09 16:00:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:00:11] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 215 rows 138 cols
[2022-06-09 16:00:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:00:11] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 16:00:11] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2022-06-09 16:00:11] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 215 rows 138 cols
[2022-06-09 16:00:11] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 16:00:11] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 215/215 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 p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 435 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Finished probabilistic random walk after 16485 steps, run visited all 2 properties in 100 ms. (steps per millisecond=164 )
Probabilistic random walk after 16485 steps, saw 8016 distinct states, run finished after 100 ms. (steps per millisecond=164 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 23047 reset in 143 ms.
Product exploration explored 100000 steps with 22885 reset in 153 ms.
Built C files in :
/tmp/ltsmin17275242535978697961
[2022-06-09 16:00:13] [INFO ] Computing symmetric may disable matrix : 215 transitions.
[2022-06-09 16:00:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:00:13] [INFO ] Computing symmetric may enable matrix : 215 transitions.
[2022-06-09 16:00:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:00:13] [INFO ] Computing Do-Not-Accords matrix : 215 transitions.
[2022-06-09 16:00:13] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:00:13] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17275242535978697961
Running compilation step : cd /tmp/ltsmin17275242535978697961;'/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 405 ms.
Running link step : cd /tmp/ltsmin17275242535978697961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17275242535978697961;'/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/stateBased7766790379798139867.hoa' '--buchi-type=spotba'
LTSmin run took 1722 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-07 finished in 9336 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 392/392 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 177 transition count 317
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 177 transition count 317
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 177 transition count 310
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 65 place count 163 transition count 292
Iterating global reduction 1 with 14 rules applied. Total rules applied 79 place count 163 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 83 place count 163 transition count 288
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 96 place count 150 transition count 267
Iterating global reduction 2 with 13 rules applied. Total rules applied 109 place count 150 transition count 267
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 118 place count 150 transition count 258
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 128 place count 140 transition count 226
Iterating global reduction 3 with 10 rules applied. Total rules applied 138 place count 140 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 140 transition count 225
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 144 place count 135 transition count 219
Iterating global reduction 4 with 5 rules applied. Total rules applied 149 place count 135 transition count 219
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 154 place count 135 transition count 214
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 158 place count 131 transition count 193
Iterating global reduction 5 with 4 rules applied. Total rules applied 162 place count 131 transition count 193
Applied a total of 162 rules in 14 ms. Remains 131 /199 variables (removed 68) and now considering 193/392 (removed 199) transitions.
// Phase 1: matrix 193 rows 131 cols
[2022-06-09 16:00:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:00:15] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 193 rows 131 cols
[2022-06-09 16:00:15] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 16:00:15] [INFO ] State equation strengthened by 69 read => feed constraints.
[2022-06-09 16:00:15] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 131 cols
[2022-06-09 16:00:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:00:15] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/199 places, 193/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/199 places, 193/392 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s129 1)), p0:(OR (LT s1 1) (LT s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Product exploration explored 100000 steps with 50000 reset in 259 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) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-08 finished in 1106 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((G(X(p0)) U !p1) U (F((p0 U G(p0))) U p2)))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 392/392 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 178 transition count 311
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 178 transition count 311
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 50 place count 178 transition count 303
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 62 place count 166 transition count 288
Iterating global reduction 1 with 12 rules applied. Total rules applied 74 place count 166 transition count 288
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 166 transition count 284
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 155 transition count 267
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 155 transition count 267
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 155 transition count 261
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 115 place count 146 transition count 229
Iterating global reduction 3 with 9 rules applied. Total rules applied 124 place count 146 transition count 229
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 146 transition count 226
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 131 place count 142 transition count 221
Iterating global reduction 4 with 4 rules applied. Total rules applied 135 place count 142 transition count 221
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 142 transition count 218
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 142 place count 138 transition count 197
Iterating global reduction 5 with 4 rules applied. Total rules applied 146 place count 138 transition count 197
Applied a total of 146 rules in 35 ms. Remains 138 /199 variables (removed 61) and now considering 197/392 (removed 195) transitions.
// Phase 1: matrix 197 rows 138 cols
[2022-06-09 16:00:16] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 16:00:16] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 197 rows 138 cols
[2022-06-09 16:00:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:00:16] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-09 16:00:16] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2022-06-09 16:00:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 197 rows 138 cols
[2022-06-09 16:00:16] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 16:00:17] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/199 places, 197/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/199 places, 197/392 transitions.
Stuttering acceptance computed with spot in 121 ms :[p2, true, (AND p2 p0), p0, p0]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s131 1)), p2:(AND (GEQ s45 1) (GEQ s78 1)), p0:(AND (GEQ s1 1) (GEQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 23031 reset in 150 ms.
Product exploration explored 100000 steps with 22969 reset in 153 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 p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 849 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[p2, true, (AND p2 p0), p0, p0]
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 1008 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 445 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 438 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1677864 steps, run timeout after 3001 ms. (steps per millisecond=559 ) properties seen :{0=1, 1=1, 2=1, 4=1}
Probabilistic random walk after 1677864 steps, saw 693773 distinct states, run finished after 3001 ms. (steps per millisecond=559 ) properties seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 138 cols
[2022-06-09 16:00:21] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 16:00:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 16:00:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:00:22] [INFO ] After 52ms 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 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F p2)]
Knowledge based reduction with 12 factoid took 619 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 156 ms :[p2, true, (AND p2 p0), p0, p0]
Stuttering acceptance computed with spot in 134 ms :[p2, true, (AND p2 p0), p0, p0]
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 138 cols
[2022-06-09 16:00:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:00:23] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 197 rows 138 cols
[2022-06-09 16:00:23] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 16:00:23] [INFO ] State equation strengthened by 63 read => feed constraints.
[2022-06-09 16:00:23] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2022-06-09 16:00:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 197 rows 138 cols
[2022-06-09 16:00:23] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 16:00:23] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 197/197 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 p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 349 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 158 ms :[p2, true, (AND p2 p0), p0, p0]
Incomplete random walk after 10000 steps, including 2305 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 435 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 447 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 432 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Finished probabilistic random walk after 23429 steps, run visited all 4 properties in 158 ms. (steps per millisecond=148 )
Probabilistic random walk after 23429 steps, saw 11459 distinct states, run finished after 159 ms. (steps per millisecond=147 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F p2)]
Knowledge based reduction with 9 factoid took 402 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 1077 ms :[p2, true, (AND p2 p0), p0, p0]
Stuttering acceptance computed with spot in 160 ms :[p2, true, (AND p2 p0), p0, p0]
Stuttering acceptance computed with spot in 139 ms :[p2, true, (AND p2 p0), p0, p0]
Product exploration explored 100000 steps with 23063 reset in 154 ms.
Product exploration explored 100000 steps with 22899 reset in 154 ms.
Built C files in :
/tmp/ltsmin8380981502075913119
[2022-06-09 16:00:26] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2022-06-09 16:00:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:00:26] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2022-06-09 16:00:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:00:26] [INFO ] Computing Do-Not-Accords matrix : 197 transitions.
[2022-06-09 16:00:26] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:00:26] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8380981502075913119
Running compilation step : cd /tmp/ltsmin8380981502075913119;'/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 396 ms.
Running link step : cd /tmp/ltsmin8380981502075913119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8380981502075913119;'/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/stateBased4018531519541145920.hoa' '--buchi-type=spotba'
LTSmin run took 1139 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-11 finished in 11472 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(!p1)))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 392/392 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 177 transition count 308
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 177 transition count 308
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 177 transition count 302
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 164 transition count 285
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 164 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 79 place count 164 transition count 282
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 92 place count 151 transition count 261
Iterating global reduction 2 with 13 rules applied. Total rules applied 105 place count 151 transition count 261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 113 place count 151 transition count 253
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 122 place count 142 transition count 231
Iterating global reduction 3 with 9 rules applied. Total rules applied 131 place count 142 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 142 transition count 230
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 137 place count 137 transition count 224
Iterating global reduction 4 with 5 rules applied. Total rules applied 142 place count 137 transition count 224
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 147 place count 137 transition count 219
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 151 place count 133 transition count 198
Iterating global reduction 5 with 4 rules applied. Total rules applied 155 place count 133 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 156 place count 133 transition count 197
Applied a total of 156 rules in 25 ms. Remains 133 /199 variables (removed 66) and now considering 197/392 (removed 195) transitions.
// Phase 1: matrix 197 rows 133 cols
[2022-06-09 16:00:28] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 16:00:28] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 197 rows 133 cols
[2022-06-09 16:00:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:00:28] [INFO ] State equation strengthened by 69 read => feed constraints.
[2022-06-09 16:00:28] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2022-06-09 16:00:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 197 rows 133 cols
[2022-06-09 16:00:28] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 16:00:28] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/199 places, 197/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/199 places, 197/392 transitions.
Stuttering acceptance computed with spot in 1146 ms :[p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s126 1)), p0:(OR (AND (GEQ s8 1) (GEQ s55 1)) (AND (GEQ s1 1) (GEQ s126 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 23043 reset in 155 ms.
Product exploration explored 100000 steps with 23047 reset in 162 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)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 787 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2316 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 413 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 958 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1002 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1769604 steps, run timeout after 3001 ms. (steps per millisecond=589 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 1769604 steps, saw 704746 distinct states, run finished after 3001 ms. (steps per millisecond=589 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 133 cols
[2022-06-09 16:00:34] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 16:00:34] [INFO ] After 31ms 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 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 10 factoid took 1739 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[p1, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[p1, (NOT p0), (NOT p0)]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 197/197 transitions.
Applied a total of 0 rules in 18 ms. Remains 133 /133 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 133 cols
[2022-06-09 16:00:36] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 16:00:36] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 197 rows 133 cols
[2022-06-09 16:00:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:00:36] [INFO ] State equation strengthened by 69 read => feed constraints.
[2022-06-09 16:00:36] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2022-06-09 16:00:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 197 rows 133 cols
[2022-06-09 16:00:36] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 16:00:36] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 197/197 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 p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[p1, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2312 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 963 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 7338 steps, run visited all 2 properties in 35 ms. (steps per millisecond=209 )
Probabilistic random walk after 7338 steps, saw 3375 distinct states, run finished after 35 ms. (steps per millisecond=209 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 561 ms :[p1, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[p1, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 434 ms :[p1, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23037 reset in 152 ms.
Product exploration explored 100000 steps with 22925 reset in 151 ms.
Built C files in :
/tmp/ltsmin15681402114671028414
[2022-06-09 16:00:38] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2022-06-09 16:00:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:00:38] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2022-06-09 16:00:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:00:38] [INFO ] Computing Do-Not-Accords matrix : 197 transitions.
[2022-06-09 16:00:38] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:00:38] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15681402114671028414
Running compilation step : cd /tmp/ltsmin15681402114671028414;'/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 395 ms.
Running link step : cd /tmp/ltsmin15681402114671028414;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15681402114671028414;'/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/stateBased15668929588375757062.hoa' '--buchi-type=spotba'
LTSmin run took 113 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-12 finished in 11210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p1)&&p0))||G(p2)))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 392/392 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 178 transition count 305
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 178 transition count 305
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 178 transition count 301
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 164 transition count 283
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 164 transition count 283
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 164 transition count 280
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 90 place count 151 transition count 260
Iterating global reduction 2 with 13 rules applied. Total rules applied 103 place count 151 transition count 260
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 111 place count 151 transition count 252
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 121 place count 141 transition count 225
Iterating global reduction 3 with 10 rules applied. Total rules applied 131 place count 141 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 141 transition count 224
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 138 place count 135 transition count 217
Iterating global reduction 4 with 6 rules applied. Total rules applied 144 place count 135 transition count 217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 149 place count 135 transition count 212
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 153 place count 131 transition count 197
Iterating global reduction 5 with 4 rules applied. Total rules applied 157 place count 131 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 158 place count 131 transition count 196
Applied a total of 158 rules in 24 ms. Remains 131 /199 variables (removed 68) and now considering 196/392 (removed 196) transitions.
// Phase 1: matrix 196 rows 131 cols
[2022-06-09 16:00:39] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 16:00:39] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 196 rows 131 cols
[2022-06-09 16:00:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:00:39] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-09 16:00:39] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2022-06-09 16:00:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 196 rows 131 cols
[2022-06-09 16:00:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 16:00:39] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/199 places, 196/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/199 places, 196/392 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(AND (GEQ s8 1) (GEQ s53 1)), p0:(AND (GEQ s1 1) (GEQ s66 1)), p2:(AND (GEQ s1 1) (GEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-13 finished in 574 ms.
All properties solved by simple procedures.
Total runtime 52899 ms.

BK_STOP 1654790440012

--------------------
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-d2m10"
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-d2m10, 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-165472282000292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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