Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 9.5K Feb 26 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:22 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-d0m06-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678238078051

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 01:14:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 01:14:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:14:39] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-08 01:14:39] [INFO ] Transformed 553 places.
[2023-03-08 01:14:39] [INFO ] Transformed 150 transitions.
[2023-03-08 01:14:39] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 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 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 34 place count 86 transition count 116
Iterating global reduction 1 with 16 rules applied. Total rules applied 50 place count 86 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 86 transition count 115
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 80 transition count 109
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 80 transition count 109
Applied a total of 63 rules in 21 ms. Remains 80 /109 variables (removed 29) and now considering 109/150 (removed 41) transitions.
// Phase 1: matrix 109 rows 80 cols
[2023-03-08 01:14:39] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-08 01:14:40] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-08 01:14:40] [INFO ] Invariant cache hit.
[2023-03-08 01:14:40] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 01:14:40] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2023-03-08 01:14:40] [INFO ] Invariant cache hit.
[2023-03-08 01:14:40] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/109 places, 109/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 594 ms. Remains : 80/109 places, 109/150 transitions.
Support contains 34 out of 80 places after structural reductions.
[2023-03-08 01:14:40] [INFO ] Flatten gal took : 27 ms
[2023-03-08 01:14:40] [INFO ] Flatten gal took : 11 ms
[2023-03-08 01:14:40] [INFO ] Input system was already deterministic with 109 transitions.
Support contains 32 out of 80 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2274 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 28) seen :18
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1075 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1030 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1010 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1060 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-08 01:14:41] [INFO ] Invariant cache hit.
[2023-03-08 01:14:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:14:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:14:41] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 01:14:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:14:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:14:42] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-08 01:14:42] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 01:14:42] [INFO ] After 175ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-08 01:14:42] [INFO ] After 332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 134 ms.
[2023-03-08 01:14:42] [INFO ] After 710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 13 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 109/109 transitions.
Graph (complete) has 236 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 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 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 76 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 76 transition count 99
Applied a total of 8 rules in 14 ms. Remains 76 /80 variables (removed 4) and now considering 99/109 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 76/80 places, 99/109 transitions.
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 981 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 514 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1043 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 507 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1015 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1066 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 529 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Finished probabilistic random walk after 16358 steps, run visited all 10 properties in 134 ms. (steps per millisecond=122 )
Probabilistic random walk after 16358 steps, saw 7476 distinct states, run finished after 135 ms. (steps per millisecond=121 ) properties seen :10
Computed a total of 6 stabilizing places and 15 stable transitions
Graph (complete) has 264 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 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 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 67 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 67 transition count 88
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 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 64 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 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 35 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 62 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 60 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 59 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 49 place count 59 transition count 69
Applied a total of 49 rules in 12 ms. Remains 59 /80 variables (removed 21) and now considering 69/109 (removed 40) transitions.
// Phase 1: matrix 69 rows 59 cols
[2023-03-08 01:14:43] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 01:14:43] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 01:14:43] [INFO ] Invariant cache hit.
[2023-03-08 01:14:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:14:43] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-08 01:14:43] [INFO ] Invariant cache hit.
[2023-03-08 01:14:43] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/80 places, 69/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 59/80 places, 69/109 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s42 1)) (AND (GEQ s1 1) (GEQ s53 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-00 finished in 437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||G(p2)))))'
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 70 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 70 transition count 93
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 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 69 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 69 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 69 transition count 88
Applied a total of 25 rules in 17 ms. Remains 69 /80 variables (removed 11) and now considering 88/109 (removed 21) transitions.
// Phase 1: matrix 88 rows 69 cols
[2023-03-08 01:14:44] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:14:44] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:14:44] [INFO ] Invariant cache hit.
[2023-03-08 01:14:44] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 01:14:44] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-08 01:14:44] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:14:44] [INFO ] Invariant cache hit.
[2023-03-08 01:14:44] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/80 places, 88/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 69/80 places, 88/109 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s46 1)), p0:(AND (GEQ s22 1) (GEQ s43 1)), p2:(AND (GEQ s1 1) (GEQ s66 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-02 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(G(p1)&&(p2||G(p0)))))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 90
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 69 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 69 transition count 86
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 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 67 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 67 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 66 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 65 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 64 transition count 74
Applied a total of 37 rules in 15 ms. Remains 64 /80 variables (removed 16) and now considering 74/109 (removed 35) transitions.
// Phase 1: matrix 74 rows 64 cols
[2023-03-08 01:14:44] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:14:44] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:14:44] [INFO ] Invariant cache hit.
[2023-03-08 01:14:44] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:14:44] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-08 01:14:44] [INFO ] Invariant cache hit.
[2023-03-08 01:14:44] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/80 places, 74/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 64/80 places, 74/109 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s62 1)), p1:(OR (LT s1 1) (LT s60 1)), p2:(AND (GEQ s1 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-03 finished in 344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p1)&&p0))&&!(G(!p2) U (p1 U p3)))))'
Support contains 6 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 68 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 68 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 26 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 66 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 66 transition count 82
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 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 65 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 65 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 64 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 63 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 63 transition count 75
Applied a total of 39 rules in 14 ms. Remains 63 /80 variables (removed 17) and now considering 75/109 (removed 34) transitions.
// Phase 1: matrix 75 rows 63 cols
[2023-03-08 01:14:44] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 01:14:44] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 01:14:44] [INFO ] Invariant cache hit.
[2023-03-08 01:14:44] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:14:45] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-08 01:14:45] [INFO ] Invariant cache hit.
[2023-03-08 01:14:45] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/80 places, 75/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 63/80 places, 75/109 transitions.
Stuttering acceptance computed with spot in 284 ms :[true, (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) p3), (OR (NOT p1) (NOT p0) p3), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0) (AND (NOT p2) p3)), (OR (NOT p0) (NOT p1) p3)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p3 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p3) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 p3 p0), acceptance={} source=5 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={} source=5 dest: 5}], [{ cond=(OR (NOT p1) p3 (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(AND (GEQ s22 1) (GEQ s36 1)), p0:(AND (GEQ s1 1) (GEQ s61 1)), p2:(AND (GEQ s1 1) (GEQ s33 1)), p3:(AND (GEQ s1 1) (GEQ s28 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-04 finished in 499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 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 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 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 62 transition count 72
Applied a total of 40 rules in 13 ms. Remains 62 /80 variables (removed 18) and now considering 72/109 (removed 37) transitions.
// Phase 1: matrix 72 rows 62 cols
[2023-03-08 01:14:45] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:14:45] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 01:14:45] [INFO ] Invariant cache hit.
[2023-03-08 01:14:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:14:45] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-08 01:14:45] [INFO ] Invariant cache hit.
[2023-03-08 01:14:45] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/80 places, 72/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 62/80 places, 72/109 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s35 1)) (AND (GEQ s1 1) (GEQ s54 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-05 finished in 270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 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 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 66 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 66 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 30 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 63 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 59 transition count 69
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 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 58 transition count 64
Applied a total of 51 rules in 13 ms. Remains 58 /80 variables (removed 22) and now considering 64/109 (removed 45) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 01:14:45] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:14:45] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 01:14:45] [INFO ] Invariant cache hit.
[2023-03-08 01:14:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:14:45] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 01:14:45] [INFO ] Invariant cache hit.
[2023-03-08 01:14:45] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/80 places, 64/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 58/80 places, 64/109 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-06 finished in 241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 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 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 66 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 66 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 30 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 63 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 59 transition count 69
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 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 58 transition count 64
Applied a total of 51 rules in 13 ms. Remains 58 /80 variables (removed 22) and now considering 64/109 (removed 45) transitions.
[2023-03-08 01:14:45] [INFO ] Invariant cache hit.
[2023-03-08 01:14:45] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 01:14:45] [INFO ] Invariant cache hit.
[2023-03-08 01:14:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:14:45] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-08 01:14:46] [INFO ] Invariant cache hit.
[2023-03-08 01:14:46] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/80 places, 64/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 58/80 places, 64/109 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-07 finished in 273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||(F(p2)&&p1))&&(p3||G(F(p0))))))'
Support contains 6 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 92
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 92
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 71 transition count 90
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 71 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 20 place count 71 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 70 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 70 transition count 87
Applied a total of 22 rules in 9 ms. Remains 70 /80 variables (removed 10) and now considering 87/109 (removed 22) transitions.
// Phase 1: matrix 87 rows 70 cols
[2023-03-08 01:14:46] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 01:14:46] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 01:14:46] [INFO ] Invariant cache hit.
[2023-03-08 01:14:46] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 01:14:46] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-08 01:14:46] [INFO ] Invariant cache hit.
[2023-03-08 01:14:46] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/80 places, 87/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 70/80 places, 87/109 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s24 1) (GEQ s38 1)), p1:(AND (GEQ s1 1) (GEQ s53 1)), p2:(AND (GEQ s1 1) (GEQ s67 1)), p3:(AND (GEQ s1 1) (GEQ s64 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-08 finished in 477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(G((p2 U !p0)))&&p1))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 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 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 65 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 65 transition count 79
Applied a total of 32 rules in 3 ms. Remains 65 /80 variables (removed 15) and now considering 79/109 (removed 30) transitions.
// Phase 1: matrix 79 rows 65 cols
[2023-03-08 01:14:46] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:14:46] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 01:14:46] [INFO ] Invariant cache hit.
[2023-03-08 01:14:46] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:14:46] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-08 01:14:46] [INFO ] Invariant cache hit.
[2023-03-08 01:14:46] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/80 places, 79/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 65/80 places, 79/109 transitions.
Stuttering acceptance computed with spot in 395 ms :[true, (NOT p0), (OR (NOT p1) p0), true, p0, p0]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s15 1) (LT s36 1)), p1:(AND (GEQ s15 1) (GEQ s36 1)), p2:(AND (GEQ s1 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-09 finished in 614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(!p1)||p0)))))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 96
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 69 transition count 92
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 69 transition count 92
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 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 67 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 66 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 65 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 65 transition count 80
Applied a total of 35 rules in 8 ms. Remains 65 /80 variables (removed 15) and now considering 80/109 (removed 29) transitions.
// Phase 1: matrix 80 rows 65 cols
[2023-03-08 01:14:47] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:14:47] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 01:14:47] [INFO ] Invariant cache hit.
[2023-03-08 01:14:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:14:47] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-08 01:14:47] [INFO ] Invariant cache hit.
[2023-03-08 01:14:47] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/80 places, 80/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 65/80 places, 80/109 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, 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 s1 1) (GEQ s63 1)), p0:(OR (AND (GEQ s1 1) (GEQ s43 1)) (AND (GEQ s1 1) (GEQ s38 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22978 reset in 220 ms.
Product exploration explored 100000 steps with 22896 reset in 158 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 212 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2311 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 01:14:48] [INFO ] Invariant cache hit.
[2023-03-08 01:14:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:14:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:14:48] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 01:14:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:14:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:14:48] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 01:14:48] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:14:48] [INFO ] After 12ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 01:14:48] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 01:14:48] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 80/80 transitions.
Graph (complete) has 192 edges and 65 vertex of which 64 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 64 transition count 79
Applied a total of 2 rules in 4 ms. Remains 64 /65 variables (removed 1) and now considering 79/80 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 64/65 places, 79/80 transitions.
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8355 steps, run visited all 1 properties in 14 ms. (steps per millisecond=596 )
Probabilistic random walk after 8355 steps, saw 3646 distinct states, run finished after 14 ms. (steps per millisecond=596 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-08 01:14:49] [INFO ] Invariant cache hit.
[2023-03-08 01:14:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 01:14:49] [INFO ] Invariant cache hit.
[2023-03-08 01:14:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:14:49] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-08 01:14:49] [INFO ] Invariant cache hit.
[2023-03-08 01:14:49] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 65/65 places, 80/80 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 212 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2263 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 01:14:49] [INFO ] Invariant cache hit.
[2023-03-08 01:14:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:14:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:14:49] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 01:14:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:14:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:14:49] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 01:14:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:14:49] [INFO ] After 10ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 01:14:49] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 01:14:49] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 80/80 transitions.
Graph (complete) has 192 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 79
Applied a total of 2 rules in 7 ms. Remains 64 /65 variables (removed 1) and now considering 79/80 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 64/65 places, 79/80 transitions.
Incomplete random walk after 10000 steps, including 2307 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 488 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8355 steps, run visited all 1 properties in 12 ms. (steps per millisecond=696 )
Probabilistic random walk after 8355 steps, saw 3646 distinct states, run finished after 12 ms. (steps per millisecond=696 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 22967 reset in 125 ms.
Product exploration explored 100000 steps with 22854 reset in 111 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 80/80 transitions.
Applied a total of 0 rules in 11 ms. Remains 65 /65 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-08 01:14:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:14:51] [INFO ] Invariant cache hit.
[2023-03-08 01:14:51] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 65/65 places, 80/80 transitions.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-08 01:14:51] [INFO ] Invariant cache hit.
[2023-03-08 01:14:51] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:14:51] [INFO ] Invariant cache hit.
[2023-03-08 01:14:51] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:14:51] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-08 01:14:51] [INFO ] Invariant cache hit.
[2023-03-08 01:14:51] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 65/65 places, 80/80 transitions.
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-10 finished in 4070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0)) U p1)))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 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 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 68 transition count 85
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 68 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 26 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 66 transition count 79
Iterating global reduction 1 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 76
Iterating global reduction 1 with 2 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
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 63 transition count 73
Applied a total of 38 rules in 4 ms. Remains 63 /80 variables (removed 17) and now considering 73/109 (removed 36) transitions.
// Phase 1: matrix 73 rows 63 cols
[2023-03-08 01:14:51] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:14:51] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:14:51] [INFO ] Invariant cache hit.
[2023-03-08 01:14:51] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:14:51] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-08 01:14:51] [INFO ] Invariant cache hit.
[2023-03-08 01:14:51] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/80 places, 73/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 63/80 places, 73/109 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s29 1)), p0:(AND (GEQ s1 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 2 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-11 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(!p0))))||(X(F(!p2))&&p1))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 96
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 68 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 68 transition count 91
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 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 65 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 65 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 33 place count 65 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 63 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 63 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 61 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 61 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 60 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 60 transition count 72
Applied a total of 47 rules in 15 ms. Remains 60 /80 variables (removed 20) and now considering 72/109 (removed 37) transitions.
// Phase 1: matrix 72 rows 60 cols
[2023-03-08 01:14:51] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:14:51] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 01:14:51] [INFO ] Invariant cache hit.
[2023-03-08 01:14:51] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 01:14:51] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-08 01:14:51] [INFO ] Invariant cache hit.
[2023-03-08 01:14:51] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/80 places, 72/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 60/80 places, 72/109 transitions.
Stuttering acceptance computed with spot in 688 ms :[true, p2, p0, (AND p2 p0), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p2 p0), (AND p2 p0), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=p1, acceptance={} source=5 dest: 7}, { cond=(NOT p1), acceptance={} source=5 dest: 9}], [{ cond=p2, acceptance={} source=6 dest: 3}], [{ cond=p2, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 5}], [{ cond=true, acceptance={} source=9 dest: 4}]], initial=8, aps=[p2:(AND (GEQ s1 1) (GEQ s26 1)), p0:(AND (GEQ s1 1) (GEQ s42 1)), p1:(AND (GEQ s1 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20940 steps with 4832 reset in 34 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-12 finished in 941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 109/109 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 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 66 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 66 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 30 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 64 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 62 transition count 74
Iterating global reduction 1 with 2 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 15 ms. Remains 61 /80 variables (removed 19) and now considering 71/109 (removed 38) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 01:14:52] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:14:52] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 01:14:52] [INFO ] Invariant cache hit.
[2023-03-08 01:14:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:14:52] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-08 01:14:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:14:52] [INFO ] Invariant cache hit.
[2023-03-08 01:14:52] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/80 places, 71/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 61/80 places, 71/109 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-13 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:(OR (AND (GEQ s1 1) (GEQ s52 1)) (AND (GEQ s1 1) (GEQ s26 1))), p1:(AND (GEQ s1 1) (GEQ s26 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 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-13 finished in 244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 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 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 65 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 65 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 65 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 64 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 63 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 63 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 63 transition count 72
Applied a total of 39 rules in 5 ms. Remains 63 /80 variables (removed 17) and now considering 72/109 (removed 37) transitions.
// Phase 1: matrix 72 rows 63 cols
[2023-03-08 01:14:52] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:14:52] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 01:14:52] [INFO ] Invariant cache hit.
[2023-03-08 01:14:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:14:52] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-08 01:14:52] [INFO ] Invariant cache hit.
[2023-03-08 01:14:52] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/80 places, 72/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 63/80 places, 72/109 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s1 1) (LT s61 1)) (GEQ s1 1) (GEQ s37 1)), p0:(OR (LT s1 1) (LT s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-14 finished in 366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 68 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 65 transition count 81
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 63 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 60 transition count 70
Applied a total of 45 rules in 7 ms. Remains 60 /80 variables (removed 20) and now considering 70/109 (removed 39) transitions.
// Phase 1: matrix 70 rows 60 cols
[2023-03-08 01:14:53] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:14:53] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 01:14:53] [INFO ] Invariant cache hit.
[2023-03-08 01:14:53] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:14:53] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-08 01:14:53] [INFO ] Invariant cache hit.
[2023-03-08 01:14:53] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/80 places, 70/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 413 ms. Remains : 60/80 places, 70/109 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22983 reset in 125 ms.
Product exploration explored 100000 steps with 22868 reset in 142 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 514 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4178 steps, run visited all 1 properties in 8 ms. (steps per millisecond=522 )
Probabilistic random walk after 4178 steps, saw 1880 distinct states, run finished after 8 ms. (steps per millisecond=522 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 01:14:54] [INFO ] Invariant cache hit.
[2023-03-08 01:14:54] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 01:14:54] [INFO ] Invariant cache hit.
[2023-03-08 01:14:54] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:14:54] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 01:14:54] [INFO ] Invariant cache hit.
[2023-03-08 01:14:54] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 60/60 places, 70/70 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2333 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4178 steps, run visited all 1 properties in 8 ms. (steps per millisecond=522 )
Probabilistic random walk after 4178 steps, saw 1880 distinct states, run finished after 8 ms. (steps per millisecond=522 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22996 reset in 99 ms.
Product exploration explored 100000 steps with 22994 reset in 102 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 01:14:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:14:55] [INFO ] Invariant cache hit.
[2023-03-08 01:14:56] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 60/60 places, 70/70 transitions.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 01:14:56] [INFO ] Invariant cache hit.
[2023-03-08 01:14:56] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 01:14:56] [INFO ] Invariant cache hit.
[2023-03-08 01:14:56] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:14:56] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-08 01:14:56] [INFO ] Invariant cache hit.
[2023-03-08 01:14:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 60/60 places, 70/70 transitions.
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-15 finished in 3173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(!p1)||p0)))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d0m06-LTLFireability-10
Stuttering acceptance computed with spot in 195 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 96
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 69 transition count 92
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 69 transition count 92
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 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 67 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 66 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 65 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 65 transition count 80
Applied a total of 35 rules in 18 ms. Remains 65 /80 variables (removed 15) and now considering 80/109 (removed 29) transitions.
// Phase 1: matrix 80 rows 65 cols
[2023-03-08 01:14:56] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:14:56] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 01:14:56] [INFO ] Invariant cache hit.
[2023-03-08 01:14:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:14:56] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-08 01:14:56] [INFO ] Invariant cache hit.
[2023-03-08 01:14:56] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 65/80 places, 80/109 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 189 ms. Remains : 65/80 places, 80/109 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, 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 s1 1) (GEQ s63 1)), p0:(OR (AND (GEQ s1 1) (GEQ s43 1)) (AND (GEQ s1 1) (GEQ s38 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23130 reset in 91 ms.
Product exploration explored 100000 steps with 22920 reset in 88 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 212 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 511 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Finished probabilistic random walk after 8367 steps, run visited all 2 properties in 21 ms. (steps per millisecond=398 )
Probabilistic random walk after 8367 steps, saw 3652 distinct states, run finished after 21 ms. (steps per millisecond=398 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-08 01:14:57] [INFO ] Invariant cache hit.
[2023-03-08 01:14:57] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 01:14:57] [INFO ] Invariant cache hit.
[2023-03-08 01:14:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:14:58] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-08 01:14:58] [INFO ] Invariant cache hit.
[2023-03-08 01:14:58] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 65/65 places, 80/80 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 212 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2311 resets, run finished after 110 ms. (steps per millisecond=90 ) 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
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Finished probabilistic random walk after 8367 steps, run visited all 2 properties in 17 ms. (steps per millisecond=492 )
Probabilistic random walk after 8367 steps, saw 3652 distinct states, run finished after 18 ms. (steps per millisecond=464 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 22908 reset in 93 ms.
Product exploration explored 100000 steps with 22850 reset in 92 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-08 01:14:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:14:59] [INFO ] Invariant cache hit.
[2023-03-08 01:14:59] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 65/65 places, 80/80 transitions.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-08 01:14:59] [INFO ] Invariant cache hit.
[2023-03-08 01:14:59] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 01:14:59] [INFO ] Invariant cache hit.
[2023-03-08 01:14:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:14:59] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-08 01:14:59] [INFO ] Invariant cache hit.
[2023-03-08 01:15:00] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 65/65 places, 80/80 transitions.
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-10 finished in 3723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d0m06-LTLFireability-15
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 68 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 65 transition count 81
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 63 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 60 transition count 70
Applied a total of 45 rules in 15 ms. Remains 60 /80 variables (removed 20) and now considering 70/109 (removed 39) transitions.
// Phase 1: matrix 70 rows 60 cols
[2023-03-08 01:15:00] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:15:00] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 01:15:00] [INFO ] Invariant cache hit.
[2023-03-08 01:15:00] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:15:00] [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.
[2023-03-08 01:15:00] [INFO ] Invariant cache hit.
[2023-03-08 01:15:00] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 60/80 places, 70/109 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 178 ms. Remains : 60/80 places, 70/109 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22867 reset in 76 ms.
Product exploration explored 100000 steps with 23095 reset in 87 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 493 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4178 steps, run visited all 1 properties in 12 ms. (steps per millisecond=348 )
Probabilistic random walk after 4178 steps, saw 1880 distinct states, run finished after 12 ms. (steps per millisecond=348 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 01:15:01] [INFO ] Invariant cache hit.
[2023-03-08 01:15:01] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 01:15:01] [INFO ] Invariant cache hit.
[2023-03-08 01:15:01] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:15:01] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 01:15:01] [INFO ] Invariant cache hit.
[2023-03-08 01:15:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 60/60 places, 70/70 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 511 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4178 steps, run visited all 1 properties in 19 ms. (steps per millisecond=219 )
Probabilistic random walk after 4178 steps, saw 1880 distinct states, run finished after 20 ms. (steps per millisecond=208 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23011 reset in 81 ms.
Product exploration explored 100000 steps with 22848 reset in 88 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 01:15:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:15:02] [INFO ] Invariant cache hit.
[2023-03-08 01:15:02] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 60/60 places, 70/70 transitions.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 01:15:02] [INFO ] Invariant cache hit.
[2023-03-08 01:15:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 01:15:02] [INFO ] Invariant cache hit.
[2023-03-08 01:15:02] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:15:02] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-08 01:15:02] [INFO ] Invariant cache hit.
[2023-03-08 01:15:02] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 60/60 places, 70/70 transitions.
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-15 finished in 2707 ms.
[2023-03-08 01:15:02] [INFO ] Flatten gal took : 7 ms
[2023-03-08 01:15:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 01:15:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 80 places, 109 transitions and 427 arcs took 1 ms.
Total runtime 23285 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d0m06
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA DBSingleClientW-PT-d0m06-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d0m06-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678238104010

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DBSingleClientW-PT-d0m06-LTLFireability-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DBSingleClientW-PT-d0m06-LTLFireability-10
lola: result : false
lola: markings : 687
lola: fired transitions : 1237
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 DBSingleClientW-PT-d0m06-LTLFireability-15
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DBSingleClientW-PT-d0m06-LTLFireability-15
lola: result : false
lola: markings : 383
lola: fired transitions : 665
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d0m06-LTLFireability-10: LTL false LTL model checker
DBSingleClientW-PT-d0m06-LTLFireability-15: LTL false LTL model checker


Time elapsed: 1 secs. Pages in use: 1

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-d0m06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DBSingleClientW-PT-d0m06, 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 r103-tall-167814478000196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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