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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.6K Jun 7 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 7 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 17:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Jun 7 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 7 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Jun 7 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 119K 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-d0m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654774528705

Running Version 202205111006
[2022-06-09 11:35:29] [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 11:35:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 11:35:30] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-06-09 11:35:30] [INFO ] Transformed 553 places.
[2022-06-09 11:35:30] [INFO ] Transformed 150 transitions.
[2022-06-09 11:35:30] [INFO ] Parsed PT model containing 553 places and 150 transitions in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 33 place count 87 transition count 117
Iterating global reduction 1 with 15 rules applied. Total rules applied 48 place count 87 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 87 transition count 116
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 81 transition count 110
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 81 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 80 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 80 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 80 transition count 107
Applied a total of 64 rules in 31 ms. Remains 80 /109 variables (removed 29) and now considering 107/150 (removed 43) transitions.
// Phase 1: matrix 107 rows 80 cols
[2022-06-09 11:35:30] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 11:35:30] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 107 rows 80 cols
[2022-06-09 11:35:30] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:35:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-09 11:35:30] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 80 cols
[2022-06-09 11:35:30] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:35:30] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/109 places, 107/150 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/109 places, 107/150 transitions.
Support contains 23 out of 80 places after structural reductions.
[2022-06-09 11:35:30] [INFO ] Flatten gal took : 32 ms
[2022-06-09 11:35:30] [INFO ] Flatten gal took : 14 ms
[2022-06-09 11:35:30] [INFO ] Input system was already deterministic with 107 transitions.
Support contains 22 out of 80 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2269 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 20) seen :11
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 1017 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 531 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 524 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 511 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 519 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 107 rows 80 cols
[2022-06-09 11:35:32] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:35:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:35:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 11:35:32] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-09 11:35:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:35:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:35:32] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-09 11:35:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-09 11:35:32] [INFO ] After 90ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-09 11:35:32] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 98 ms.
[2022-06-09 11:35:32] [INFO ] After 477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 28 ms.
Support contains 7 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 107/107 transitions.
Graph (complete) has 241 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 79 transition count 106
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 74 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 74 transition count 99
Applied a total of 12 rules in 15 ms. Remains 74 /80 variables (removed 6) and now considering 99/107 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 74/80 places, 99/107 transitions.
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 512 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 542 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 514 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 99 rows 74 cols
[2022-06-09 11:35:33] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:35:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:35:33] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-09 11:35:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:35:33] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-09 11:35:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-06-09 11:35:33] [INFO ] After 82ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-09 11:35:33] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-06-09 11:35:33] [INFO ] After 358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 46 ms.
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 74/74 places, 99/99 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 73 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 73 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 72 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 72 transition count 95
Applied a total of 4 rules in 11 ms. Remains 72 /74 variables (removed 2) and now considering 95/99 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 72/74 places, 95/99 transitions.
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 523 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 511 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 517 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Finished probabilistic random walk after 27588 steps, run visited all 5 properties in 142 ms. (steps per millisecond=194 )
Probabilistic random walk after 27588 steps, saw 12205 distinct states, run finished after 142 ms. (steps per millisecond=194 ) properties seen :5
Computed a total of 5 stabilizing places and 5 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(X((X(p1)&&p0)))))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 107/107 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 71 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 67 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 66 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 65 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 64 transition count 75
Applied a total of 36 rules in 17 ms. Remains 64 /80 variables (removed 16) and now considering 75/107 (removed 32) transitions.
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:35:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:34] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:35:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:35:34] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-06-09 11:35:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:35:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:34] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/80 places, 75/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/80 places, 75/107 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s25 1)), p1:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-00 finished in 485 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 107/107 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 89
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 89
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 67 transition count 84
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 65 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 63 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 61 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 60 transition count 68
Applied a total of 46 rules in 11 ms. Remains 60 /80 variables (removed 20) and now considering 68/107 (removed 39) transitions.
// Phase 1: matrix 68 rows 60 cols
[2022-06-09 11:35:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:35] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 68 rows 60 cols
[2022-06-09 11:35:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:35:35] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:35:35] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 68 rows 60 cols
[2022-06-09 11:35:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:35] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/80 places, 68/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/80 places, 68/107 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s10 1) (GEQ s22 1)), p0:(AND (GEQ s1 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-01 finished in 377 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(p0)||X(p1))))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 107/107 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 93
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 68 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 68 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 67 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 67 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 66 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 66 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 65 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 65 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 64 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 64 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 64 transition count 82
Applied a total of 34 rules in 15 ms. Remains 64 /80 variables (removed 16) and now considering 82/107 (removed 25) transitions.
// Phase 1: matrix 82 rows 64 cols
[2022-06-09 11:35:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:35:35] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 82 rows 64 cols
[2022-06-09 11:35:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:35] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-09 11:35:35] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-06-09 11:35:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 82 rows 64 cols
[2022-06-09 11:35:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:35:35] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/80 places, 82/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/80 places, 82/107 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s62 1) (GEQ s1 1) (GEQ s44 1)), p1:(AND (GEQ s1 1) (GEQ s57 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-02 finished in 234 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 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 107/107 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 70 transition count 85
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 65 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 63 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 61 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 59 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 58 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 58 transition count 64
Applied a total of 50 rules in 26 ms. Remains 58 /80 variables (removed 22) and now considering 64/107 (removed 43) transitions.
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:35:35] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:35:35] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:35:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:35:35] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2022-06-09 11:35:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:35:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:36] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/80 places, 64/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/80 places, 64/107 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-03 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 s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-03 finished in 372 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(!F(p0)))) U p0))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 107/107 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 71 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 71 transition count 90
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 66 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 66 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 64 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 62 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 60 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 59 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 59 transition count 69
Applied a total of 48 rules in 12 ms. Remains 59 /80 variables (removed 21) and now considering 69/107 (removed 38) transitions.
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:35:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:36] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:35:36] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 11:35:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:35:36] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:35:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:36] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/80 places, 69/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/80 places, 69/107 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), true, p0, true]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-04 finished in 351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(((F(G(p0))||p1) U !p2)))))'
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 107/107 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 94
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 69 transition count 90
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 69 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 68 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 67 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 66 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 66 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 66 transition count 82
Applied a total of 31 rules in 22 ms. Remains 66 /80 variables (removed 14) and now considering 82/107 (removed 25) transitions.
// Phase 1: matrix 82 rows 66 cols
[2022-06-09 11:35:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:36] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 82 rows 66 cols
[2022-06-09 11:35:36] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:35:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 11:35:36] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2022-06-09 11:35:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 82 rows 66 cols
[2022-06-09 11:35:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:36] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/80 places, 82/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/80 places, 82/107 transitions.
Stuttering acceptance computed with spot in 157 ms :[p2, (AND (NOT p0) p2), p2, (AND (NOT p0) p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p0) (AND p1 p0)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p1 p0), acceptance={1} source=1 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={1} source=3 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 p1 p0), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s45 1)), p1:(AND (GEQ s1 1) (GEQ s64 1) (GEQ s45 1)), p0:(AND (GEQ s19 1) (GEQ s24 1))], nbAcceptance=2, 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 22710 reset in 289 ms.
Product exploration explored 100000 steps with 22868 reset in 177 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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (OR (AND (NOT p2) p0) (AND p1 p0)))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p2) p0) (AND p1 p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 855 ms. Reduced automaton from 4 states, 15 edges and 3 AP to 4 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 154 ms :[p2, (AND (NOT p0) p2), p2, (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 516 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 82 rows 66 cols
[2022-06-09 11:35:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:35:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:35:38] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-06-09 11:35:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:35:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 11:35:38] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-06-09 11:35:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 11:35:38] [INFO ] After 11ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2022-06-09 11:35:38] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-09 11:35:38] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 82/82 transitions.
Graph (complete) has 196 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 81
Applied a total of 2 rules in 4 ms. Remains 65 /66 variables (removed 1) and now considering 81/82 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/66 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 518 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20669 steps, run visited all 1 properties in 67 ms. (steps per millisecond=308 )
Probabilistic random walk after 20669 steps, saw 9258 distinct states, run finished after 67 ms. (steps per millisecond=308 ) properties seen :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (OR (AND (NOT p2) p0) (AND p1 p0)))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p2) p0) (AND p1 p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p1) p2)), (F (OR (AND p0 p1) (AND p0 (NOT p2)))), (F p2), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 19 factoid took 955 ms. Reduced automaton from 4 states, 15 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), p2]
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), p2]
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 82/82 transitions.
Applied a total of 0 rules in 12 ms. Remains 66 /66 variables (removed 0) and now considering 82/82 (removed 0) transitions.
// Phase 1: matrix 82 rows 66 cols
[2022-06-09 11:35:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:40] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 82 rows 66 cols
[2022-06-09 11:35:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 11:35:40] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2022-06-09 11:35:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 82 rows 66 cols
[2022-06-09 11:35:40] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:35:40] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 82/82 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 (AND (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (OR p1 (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 356 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), p2]
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 66 cols
[2022-06-09 11:35:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:35:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:35:40] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 11:35:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:35:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:35:41] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 11:35:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 11:35:41] [INFO ] After 11ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 11:35:41] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-09 11:35:41] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 82/82 transitions.
Graph (complete) has 196 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 64 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 64 transition count 79
Applied a total of 5 rules in 7 ms. Remains 64 /66 variables (removed 2) and now considering 79/82 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/66 places, 79/82 transitions.
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 497 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20350 steps, run visited all 1 properties in 27 ms. (steps per millisecond=753 )
Probabilistic random walk after 20350 steps, saw 9087 distinct states, run finished after 27 ms. (steps per millisecond=753 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (OR p1 (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (OR p1 (NOT p2)))), (F (AND p1 p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 485 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), p2]
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), p2]
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), p2]
Product exploration explored 100000 steps with 22950 reset in 119 ms.
Product exploration explored 100000 steps with 22905 reset in 207 ms.
Built C files in :
/tmp/ltsmin5919952969312807164
[2022-06-09 11:35:42] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2022-06-09 11:35:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:35:42] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2022-06-09 11:35:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:35:42] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2022-06-09 11:35:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:35:42] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5919952969312807164
Running compilation step : cd /tmp/ltsmin5919952969312807164;'/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 304 ms.
Running link step : cd /tmp/ltsmin5919952969312807164;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5919952969312807164;'/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/stateBased14990029511600652994.hoa' '--buchi-type=spotba'
LTSmin run took 78 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-05 finished in 6527 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((((p0 U !X(p1))&&!p1) U X(p1)))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 107/107 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 71 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 71 transition count 86
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 66 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 66 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 64 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 62 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 60 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 60 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 59 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 59 transition count 66
Applied a total of 47 rules in 8 ms. Remains 59 /80 variables (removed 21) and now considering 66/107 (removed 41) transitions.
// Phase 1: matrix 66 rows 59 cols
[2022-06-09 11:35:43] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:35:43] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 66 rows 59 cols
[2022-06-09 11:35:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:35:43] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 59 cols
[2022-06-09 11:35:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:35:43] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/80 places, 66/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/80 places, 66/107 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s6 1) (GEQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-06 finished in 314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||p1))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 107/107 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 71 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 71 transition count 86
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 66 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 66 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 65 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 64 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 62 transition count 73
Applied a total of 39 rules in 8 ms. Remains 62 /80 variables (removed 18) and now considering 73/107 (removed 34) transitions.
// Phase 1: matrix 73 rows 62 cols
[2022-06-09 11:35:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:43] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 73 rows 62 cols
[2022-06-09 11:35:43] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:35:43] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:35:43] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 73 rows 62 cols
[2022-06-09 11:35:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:35:43] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/80 places, 73/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/80 places, 73/107 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s16 1) (GEQ s23 1)), p0:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-08 finished in 304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||X(G(X(p1)))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 107/107 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 71 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 71 transition count 86
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 66 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 66 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 64 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 62 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 61 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 61 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 61 transition count 70
Applied a total of 41 rules in 9 ms. Remains 61 /80 variables (removed 19) and now considering 70/107 (removed 37) transitions.
// Phase 1: matrix 70 rows 61 cols
[2022-06-09 11:35:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:43] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 70 rows 61 cols
[2022-06-09 11:35:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:35:43] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:35:43] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 70 rows 61 cols
[2022-06-09 11:35:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:35:43] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/80 places, 70/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/80 places, 70/107 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s18 1) (GEQ s23 1)), p0:(AND (GEQ s1 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-09 finished in 353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F(p1))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 107/107 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 89
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 89
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 70 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 70 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 70 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 69 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 68 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 68 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 67 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 67 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 66 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 66 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 66 transition count 78
Applied a total of 32 rules in 10 ms. Remains 66 /80 variables (removed 14) and now considering 78/107 (removed 29) transitions.
// Phase 1: matrix 78 rows 66 cols
[2022-06-09 11:35:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:44] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 78 rows 66 cols
[2022-06-09 11:35:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:44] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-09 11:35:44] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 78 rows 66 cols
[2022-06-09 11:35:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:44] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/80 places, 78/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/80 places, 78/107 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s61 1)), p0:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-11 finished in 321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(F(!p0)||p1))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 107/107 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 70 transition count 85
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 65 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 61 transition count 71
Applied a total of 42 rules in 9 ms. Remains 61 /80 variables (removed 19) and now considering 71/107 (removed 36) transitions.
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:35:44] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:35:44] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:35:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:35:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:35:44] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:35:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:35:44] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/80 places, 71/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/80 places, 71/107 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s51 1)), p0:(OR (LT s1 1) (LT s59 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 5 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-12 finished in 307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((G(p0)||p1)))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 107/107 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 71 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 71 transition count 86
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 68 transition count 83
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 68 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 68 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 67 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 66 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 65 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 64 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 64 transition count 74
Applied a total of 36 rules in 15 ms. Remains 64 /80 variables (removed 16) and now considering 74/107 (removed 33) transitions.
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:35:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:35:44] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:35:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:35:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:35:44] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2022-06-09 11:35:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:35:44] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:35:44] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/80 places, 74/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/80 places, 74/107 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s60 1)), p1:(AND (GEQ s1 1) (GEQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-14 finished in 289 ms.
All properties solved by simple procedures.
Total runtime 15034 ms.

BK_STOP 1654774544961

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

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