Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Apr 12 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 12:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716325273960

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 21:01:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:01:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:01:15] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-21 21:01:15] [INFO ] Transformed 1440 places.
[2024-05-21 21:01:15] [INFO ] Transformed 672 transitions.
[2024-05-21 21:01:15] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 181 place count 246 transition count 412
Iterating global reduction 1 with 80 rules applied. Total rules applied 261 place count 246 transition count 412
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 269 place count 246 transition count 404
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 330 place count 185 transition count 343
Iterating global reduction 2 with 61 rules applied. Total rules applied 391 place count 185 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 393 place count 185 transition count 341
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 423 place count 155 transition count 297
Iterating global reduction 3 with 30 rules applied. Total rules applied 453 place count 155 transition count 297
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 480 place count 155 transition count 270
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 485 place count 150 transition count 263
Iterating global reduction 4 with 5 rules applied. Total rules applied 490 place count 150 transition count 263
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 493 place count 147 transition count 260
Iterating global reduction 4 with 3 rules applied. Total rules applied 496 place count 147 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 498 place count 145 transition count 258
Iterating global reduction 4 with 2 rules applied. Total rules applied 500 place count 145 transition count 258
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 501 place count 144 transition count 256
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 144 transition count 256
Applied a total of 502 rules in 72 ms. Remains 144 /347 variables (removed 203) and now considering 256/672 (removed 416) transitions.
// Phase 1: matrix 256 rows 144 cols
[2024-05-21 21:01:16] [INFO ] Computed 2 invariants in 13 ms
[2024-05-21 21:01:16] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-21 21:01:16] [INFO ] Invariant cache hit.
[2024-05-21 21:01:16] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-21 21:01:16] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2024-05-21 21:01:16] [INFO ] Invariant cache hit.
[2024-05-21 21:01:16] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/347 places, 256/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1026 ms. Remains : 144/347 places, 256/672 transitions.
Support contains 31 out of 144 places after structural reductions.
[2024-05-21 21:01:16] [INFO ] Flatten gal took : 46 ms
[2024-05-21 21:01:16] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:01:16] [INFO ] Input system was already deterministic with 256 transitions.
Support contains 29 out of 144 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Finished probabilistic random walk after 101330 steps, run visited all 27 properties in 696 ms. (steps per millisecond=145 )
Probabilistic random walk after 101330 steps, saw 40497 distinct states, run finished after 697 ms. (steps per millisecond=145 ) properties seen :27
Parikh walk visited 0 properties in 0 ms.
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 545 edges and 144 vertex of which 143 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(F((!(p0 U p1)||G(!p0)))))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 189
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 189
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 122 transition count 184
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 62 place count 109 transition count 168
Iterating global reduction 1 with 13 rules applied. Total rules applied 75 place count 109 transition count 168
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 80 place count 109 transition count 163
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 91 place count 98 transition count 146
Iterating global reduction 2 with 11 rules applied. Total rules applied 102 place count 98 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 98 transition count 140
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 116 place count 90 transition count 122
Iterating global reduction 3 with 8 rules applied. Total rules applied 124 place count 90 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 128 place count 90 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 132 place count 86 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 136 place count 86 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 139 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 85 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 85 transition count 110
Applied a total of 141 rules in 39 ms. Remains 85 /144 variables (removed 59) and now considering 110/256 (removed 146) transitions.
// Phase 1: matrix 110 rows 85 cols
[2024-05-21 21:01:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:01:18] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 21:01:18] [INFO ] Invariant cache hit.
[2024-05-21 21:01:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 21:01:19] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-21 21:01:19] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:01:19] [INFO ] Invariant cache hit.
[2024-05-21 21:01:19] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/144 places, 110/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 293 ms. Remains : 85/144 places, 110/256 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 175 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s60 1)), p0:(AND (GEQ s2 1) (GEQ s82 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23089 reset in 245 ms.
Product exploration explored 100000 steps with 23060 reset in 168 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 96 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 509 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1541 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 2813252 steps, run timeout after 3001 ms. (steps per millisecond=937 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 2813252 steps, saw 1115516 distinct states, run finished after 3007 ms. (steps per millisecond=935 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-21 21:01:23] [INFO ] Invariant cache hit.
[2024-05-21 21:01:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:01:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:01:23] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 180 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 67 ms :[(AND p1 p0), (AND p1 p0)]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 110/110 transitions.
Applied a total of 0 rules in 10 ms. Remains 85 /85 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 21:01:23] [INFO ] Invariant cache hit.
[2024-05-21 21:01:23] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 21:01:23] [INFO ] Invariant cache hit.
[2024-05-21 21:01:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 21:01:23] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-21 21:01:23] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:01:23] [INFO ] Invariant cache hit.
[2024-05-21 21:01:24] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 85/85 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 457 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1532 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 2394472 steps, run timeout after 3001 ms. (steps per millisecond=797 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 2394472 steps, saw 946455 distinct states, run finished after 3001 ms. (steps per millisecond=797 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-21 21:01:27] [INFO ] Invariant cache hit.
[2024-05-21 21:01:27] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-21 21:01:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:01:27] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 177 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 77 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 143 ms :[(AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 23008 reset in 101 ms.
Product exploration explored 100000 steps with 23027 reset in 109 ms.
Built C files in :
/tmp/ltsmin9244990941542184059
[2024-05-21 21:01:28] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-21 21:01:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:01:28] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-21 21:01:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:01:28] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-21 21:01:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:01:28] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9244990941542184059
Running compilation step : cd /tmp/ltsmin9244990941542184059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 322 ms.
Running link step : cd /tmp/ltsmin9244990941542184059;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9244990941542184059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3677391051213367656.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 110/110 transitions.
Applied a total of 0 rules in 9 ms. Remains 85 /85 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 21:01:43] [INFO ] Invariant cache hit.
[2024-05-21 21:01:43] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 21:01:43] [INFO ] Invariant cache hit.
[2024-05-21 21:01:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 21:01:43] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-21 21:01:43] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:01:43] [INFO ] Invariant cache hit.
[2024-05-21 21:01:43] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 280 ms. Remains : 85/85 places, 110/110 transitions.
Built C files in :
/tmp/ltsmin7704299950634011242
[2024-05-21 21:01:43] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-21 21:01:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:01:43] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-21 21:01:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:01:43] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-21 21:01:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:01:43] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7704299950634011242
Running compilation step : cd /tmp/ltsmin7704299950634011242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin7704299950634011242;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin7704299950634011242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3145392535660177901.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:01:58] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:01:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:01:58] [INFO ] Time to serialize gal into /tmp/LTL17474843570864210331.gal : 2 ms
[2024-05-21 21:01:58] [INFO ] Time to serialize properties into /tmp/LTL8260210904006994775.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17474843570864210331.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4172786055728306905.hoa' '-atoms' '/tmp/LTL8260210904006994775.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8260210904006994775.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4172786055728306905.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t49, t57, t67, t68, t69, t71, t73, t74, t75, t76, t170, t200, t201, t20...431
Computing Next relation with stutter on 1.72112e+06 deadlock states
10 unique states visited
0 strongly connected components in search stack
18 transitions explored
10 items max in DFS search stack
1227 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.2992,290500,1,0,240,970750,264,116,3183,995958,402
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-00 finished in 53592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 180
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 121 transition count 176
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 108 transition count 160
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 108 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 108 transition count 156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 98 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 98 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 98 transition count 135
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 113 place count 91 transition count 119
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 91 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 123 place count 91 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 127 place count 87 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 131 place count 87 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 87 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 86 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 86 transition count 108
Applied a total of 136 rules in 23 ms. Remains 86 /144 variables (removed 58) and now considering 108/256 (removed 148) transitions.
// Phase 1: matrix 108 rows 86 cols
[2024-05-21 21:02:12] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 21:02:12] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 21:02:12] [INFO ] Invariant cache hit.
[2024-05-21 21:02:12] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:02:12] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-21 21:02:12] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:02:12] [INFO ] Invariant cache hit.
[2024-05-21 21:02:12] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/144 places, 108/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 316 ms. Remains : 86/144 places, 108/256 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s28 1) (LT s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23033 reset in 188 ms.
Product exploration explored 100000 steps with 22943 reset in 108 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 977 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16094 steps, run visited all 1 properties in 23 ms. (steps per millisecond=699 )
Probabilistic random walk after 16094 steps, saw 7657 distinct states, run finished after 24 ms. (steps per millisecond=670 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 108/108 transitions.
Applied a total of 0 rules in 11 ms. Remains 86 /86 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-21 21:02:13] [INFO ] Invariant cache hit.
[2024-05-21 21:02:13] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 21:02:13] [INFO ] Invariant cache hit.
[2024-05-21 21:02:13] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:02:13] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-21 21:02:13] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:02:13] [INFO ] Invariant cache hit.
[2024-05-21 21:02:13] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 86/86 places, 108/108 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 972 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16094 steps, run visited all 1 properties in 22 ms. (steps per millisecond=731 )
Probabilistic random walk after 16094 steps, saw 7657 distinct states, run finished after 22 ms. (steps per millisecond=731 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22963 reset in 105 ms.
Product exploration explored 100000 steps with 22954 reset in 110 ms.
Built C files in :
/tmp/ltsmin3787344746136896617
[2024-05-21 21:02:14] [INFO ] Computing symmetric may disable matrix : 108 transitions.
[2024-05-21 21:02:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:02:14] [INFO ] Computing symmetric may enable matrix : 108 transitions.
[2024-05-21 21:02:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:02:14] [INFO ] Computing Do-Not-Accords matrix : 108 transitions.
[2024-05-21 21:02:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:02:14] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3787344746136896617
Running compilation step : cd /tmp/ltsmin3787344746136896617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 226 ms.
Running link step : cd /tmp/ltsmin3787344746136896617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3787344746136896617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14074777089315863741.hoa' '--buchi-type=spotba'
LTSmin run took 12763 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-01 finished in 15208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 185
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 121 transition count 179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 109 transition count 164
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 109 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 81 place count 109 transition count 159
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 99 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 99 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 106 place count 99 transition count 139
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 113 place count 92 transition count 122
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 92 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 126 place count 92 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 129 place count 89 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 132 place count 89 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 88 transition count 110
Applied a total of 136 rules in 30 ms. Remains 88 /144 variables (removed 56) and now considering 110/256 (removed 146) transitions.
// Phase 1: matrix 110 rows 88 cols
[2024-05-21 21:02:27] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:02:27] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 21:02:27] [INFO ] Invariant cache hit.
[2024-05-21 21:02:27] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 21:02:27] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-21 21:02:27] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:02:27] [INFO ] Invariant cache hit.
[2024-05-21 21:02:27] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/144 places, 110/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 88/144 places, 110/256 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22954 reset in 108 ms.
Product exploration explored 100000 steps with 22864 reset in 111 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17459 steps, run visited all 1 properties in 23 ms. (steps per millisecond=759 )
Probabilistic random walk after 17459 steps, saw 8309 distinct states, run finished after 23 ms. (steps per millisecond=759 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 8 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 21:02:28] [INFO ] Invariant cache hit.
[2024-05-21 21:02:28] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 21:02:28] [INFO ] Invariant cache hit.
[2024-05-21 21:02:28] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 21:02:28] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-21 21:02:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:02:28] [INFO ] Invariant cache hit.
[2024-05-21 21:02:28] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 88/88 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17459 steps, run visited all 1 properties in 23 ms. (steps per millisecond=759 )
Probabilistic random walk after 17459 steps, saw 8309 distinct states, run finished after 24 ms. (steps per millisecond=727 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22856 reset in 101 ms.
Product exploration explored 100000 steps with 22954 reset in 102 ms.
Built C files in :
/tmp/ltsmin7699532650942088289
[2024-05-21 21:02:29] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-21 21:02:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:02:29] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-21 21:02:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:02:29] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-21 21:02:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:02:29] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7699532650942088289
Running compilation step : cd /tmp/ltsmin7699532650942088289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 244 ms.
Running link step : cd /tmp/ltsmin7699532650942088289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7699532650942088289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8046613749375671772.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 11 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 21:02:44] [INFO ] Invariant cache hit.
[2024-05-21 21:02:44] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 21:02:44] [INFO ] Invariant cache hit.
[2024-05-21 21:02:44] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 21:02:45] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-21 21:02:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 21:02:45] [INFO ] Invariant cache hit.
[2024-05-21 21:02:45] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 88/88 places, 110/110 transitions.
Built C files in :
/tmp/ltsmin15470463953874564995
[2024-05-21 21:02:45] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-21 21:02:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:02:45] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-21 21:02:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:02:45] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-21 21:02:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:02:45] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15470463953874564995
Running compilation step : cd /tmp/ltsmin15470463953874564995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 237 ms.
Running link step : cd /tmp/ltsmin15470463953874564995;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15470463953874564995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16288352456698705798.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:03:00] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:03:00] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:03:00] [INFO ] Time to serialize gal into /tmp/LTL13505677306335194515.gal : 2 ms
[2024-05-21 21:03:00] [INFO ] Time to serialize properties into /tmp/LTL13150775377492153847.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13505677306335194515.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10199514819264875290.hoa' '-atoms' '/tmp/LTL13150775377492153847.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13150775377492153847.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10199514819264875290.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t49, t57, t67, t68, t91, t92, t98, t170, t200, t202, t206, t207, t208, ...422
Computing Next relation with stutter on 2.74477e+06 deadlock states
Detected timeout of ITS tools.
[2024-05-21 21:03:15] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:03:15] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:03:15] [INFO ] Time to serialize gal into /tmp/LTL3092676847882129872.gal : 2 ms
[2024-05-21 21:03:15] [INFO ] Time to serialize properties into /tmp/LTL11722385443323735483.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3092676847882129872.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11722385443323735483.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l1216<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1216<1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t49, t57, t67, t68, t91, t92, t98, t170, t200, t202, t206, t207, t208, ...422
Computing Next relation with stutter on 2.74477e+06 deadlock states
Detected timeout of ITS tools.
[2024-05-21 21:03:30] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:03:30] [INFO ] Applying decomposition
[2024-05-21 21:03:30] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9114239049258919297.txt' '-o' '/tmp/graph9114239049258919297.bin' '-w' '/tmp/graph9114239049258919297.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9114239049258919297.bin' '-l' '-1' '-v' '-w' '/tmp/graph9114239049258919297.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:03:30] [INFO ] Decomposing Gal with order
[2024-05-21 21:03:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:03:30] [INFO ] Removed a total of 108 redundant transitions.
[2024-05-21 21:03:30] [INFO ] Flatten gal took : 37 ms
[2024-05-21 21:03:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 8 ms.
[2024-05-21 21:03:30] [INFO ] Time to serialize gal into /tmp/LTL16692301083834400532.gal : 2 ms
[2024-05-21 21:03:30] [INFO ] Time to serialize properties into /tmp/LTL11733931676827087322.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16692301083834400532.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11733931676827087322.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u1.s1<1)||(i6.u17.l1216<1))"))))
Formula 0 simplified : FG!"((i0.u1.s1<1)||(i6.u17.l1216<1))"
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t11, t57, t91, t92, t98, t170, t200, t202, t206, t207, t209, t214, t215, t216, t220, ...430
Computing Next relation with stutter on 2.74477e+06 deadlock states
10 unique states visited
0 strongly connected components in search stack
18 transitions explored
10 items max in DFS search stack
406 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.07636,113032,1,0,132271,18577,1630,505488,625,139926,280802
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-03 finished in 67602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(((p1 U p2)&&F(p3)))||p0))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 123 transition count 190
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 123 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 123 transition count 187
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 112 transition count 173
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 112 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 112 transition count 169
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 103 transition count 154
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 103 transition count 154
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 95 place count 103 transition count 148
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 98 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 98 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 108 place count 98 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 111 place count 95 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 114 place count 95 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 117 place count 95 transition count 133
Applied a total of 117 rules in 15 ms. Remains 95 /144 variables (removed 49) and now considering 133/256 (removed 123) transitions.
// Phase 1: matrix 133 rows 95 cols
[2024-05-21 21:03:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:03:35] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 21:03:35] [INFO ] Invariant cache hit.
[2024-05-21 21:03:35] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-21 21:03:35] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-21 21:03:35] [INFO ] Invariant cache hit.
[2024-05-21 21:03:35] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/144 places, 133/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 95/144 places, 133/256 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s88 1)) (AND (GEQ s1 1) (GEQ s46 1))), p2:(AND (GEQ s1 1) (GEQ s82 1)), p1:(AND (GEQ s1 1) (GEQ s88 1)), p3:(AND (GEQ s1 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-04 finished in 571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 180
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 121 transition count 176
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 62 place count 109 transition count 161
Iterating global reduction 1 with 12 rules applied. Total rules applied 74 place count 109 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 109 transition count 157
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 98 transition count 140
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 98 transition count 140
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 98 transition count 134
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 113 place count 91 transition count 122
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 91 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 91 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 128 place count 87 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 87 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 135 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 86 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 86 transition count 110
Applied a total of 137 rules in 23 ms. Remains 86 /144 variables (removed 58) and now considering 110/256 (removed 146) transitions.
// Phase 1: matrix 110 rows 86 cols
[2024-05-21 21:03:35] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:03:35] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 21:03:35] [INFO ] Invariant cache hit.
[2024-05-21 21:03:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 21:03:36] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-21 21:03:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:03:36] [INFO ] Invariant cache hit.
[2024-05-21 21:03:36] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/144 places, 110/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 273 ms. Remains : 86/144 places, 110/256 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-05 finished in 355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((p1||X(F(p2))))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 123 transition count 194
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 123 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 123 transition count 190
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 58 place count 111 transition count 175
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 111 transition count 175
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 111 transition count 170
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 84 place count 102 transition count 156
Iterating global reduction 2 with 9 rules applied. Total rules applied 93 place count 102 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 100 place count 102 transition count 149
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 106 place count 96 transition count 134
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 96 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 115 place count 96 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 118 place count 93 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 93 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 123 place count 93 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 92 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 92 transition count 125
Applied a total of 125 rules in 13 ms. Remains 92 /144 variables (removed 52) and now considering 125/256 (removed 131) transitions.
// Phase 1: matrix 125 rows 92 cols
[2024-05-21 21:03:36] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:03:36] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 21:03:36] [INFO ] Invariant cache hit.
[2024-05-21 21:03:36] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-21 21:03:36] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-21 21:03:36] [INFO ] Invariant cache hit.
[2024-05-21 21:03:36] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/144 places, 125/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 92/144 places, 125/256 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s84 1)), p0:(OR (LT s1 1) (LT s62 1)), p2:(OR (LT s25 1) (LT s55 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 318 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-06 finished in 945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0) U !p1)||F((F(G(p1))&&p2)))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 183
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 122 transition count 181
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 59 place count 109 transition count 165
Iterating global reduction 1 with 13 rules applied. Total rules applied 72 place count 109 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 77 place count 109 transition count 160
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 98 transition count 143
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 98 transition count 143
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 105 place count 98 transition count 137
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 112 place count 91 transition count 125
Iterating global reduction 3 with 7 rules applied. Total rules applied 119 place count 91 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 123 place count 91 transition count 121
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 127 place count 87 transition count 117
Iterating global reduction 4 with 4 rules applied. Total rules applied 131 place count 87 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 87 transition count 114
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 86 transition count 113
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 86 transition count 113
Applied a total of 136 rules in 15 ms. Remains 86 /144 variables (removed 58) and now considering 113/256 (removed 143) transitions.
// Phase 1: matrix 113 rows 86 cols
[2024-05-21 21:03:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:03:37] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 21:03:37] [INFO ] Invariant cache hit.
[2024-05-21 21:03:37] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 21:03:37] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-21 21:03:37] [INFO ] Invariant cache hit.
[2024-05-21 21:03:37] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/144 places, 113/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 86/144 places, 113/256 transitions.
Stuttering acceptance computed with spot in 258 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), (AND (NOT p1) p0), (AND (NOT p2) p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s44 1)), p2:(AND (GEQ s1 1) (GEQ s84 1)), p0:(AND (GEQ s1 1) (GEQ s84 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]]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-07 finished in 541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F((p1||G(!p2)||X(p3))))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 123 transition count 194
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 123 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 123 transition count 190
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 57 place count 112 transition count 179
Iterating global reduction 1 with 11 rules applied. Total rules applied 68 place count 112 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 73 place count 112 transition count 174
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 103 transition count 159
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 103 transition count 159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 99 place count 103 transition count 151
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 97 transition count 136
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 97 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 97 transition count 135
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 116 place count 93 transition count 131
Iterating global reduction 4 with 4 rules applied. Total rules applied 120 place count 93 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 93 transition count 128
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 92 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 92 transition count 127
Applied a total of 125 rules in 20 ms. Remains 92 /144 variables (removed 52) and now considering 127/256 (removed 129) transitions.
// Phase 1: matrix 127 rows 92 cols
[2024-05-21 21:03:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:03:37] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 21:03:37] [INFO ] Invariant cache hit.
[2024-05-21 21:03:37] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 21:03:37] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-21 21:03:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:03:37] [INFO ] Invariant cache hit.
[2024-05-21 21:03:37] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/144 places, 127/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 92/144 places, 127/256 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s34 1) (GEQ s59 1)), p1:(AND (OR (LT s34 1) (LT s59 1)) (OR (LT s1 1) (LT s63 1))), p2:(AND (GEQ s1 1) (GEQ s81 1)), p3:(OR (LT s1 1) (LT s63...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22815 reset in 120 ms.
Product exploration explored 100000 steps with 23041 reset in 129 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 319 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Finished probabilistic random walk after 26119 steps, run visited all 3 properties in 96 ms. (steps per millisecond=272 )
Probabilistic random walk after 26119 steps, saw 11985 distinct states, run finished after 96 ms. (steps per millisecond=272 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p2 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Support contains 5 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 127/127 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-21 21:03:39] [INFO ] Invariant cache hit.
[2024-05-21 21:03:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 21:03:39] [INFO ] Invariant cache hit.
[2024-05-21 21:03:39] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 21:03:39] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-21 21:03:39] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 21:03:39] [INFO ] Invariant cache hit.
[2024-05-21 21:03:39] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 268 ms. Remains : 92/92 places, 127/127 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 319 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Finished probabilistic random walk after 26119 steps, run visited all 3 properties in 96 ms. (steps per millisecond=272 )
Probabilistic random walk after 26119 steps, saw 11985 distinct states, run finished after 96 ms. (steps per millisecond=272 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p2 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Product exploration explored 100000 steps with 22788 reset in 120 ms.
Product exploration explored 100000 steps with 22796 reset in 127 ms.
Built C files in :
/tmp/ltsmin2448441661751045411
[2024-05-21 21:03:40] [INFO ] Computing symmetric may disable matrix : 127 transitions.
[2024-05-21 21:03:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:03:40] [INFO ] Computing symmetric may enable matrix : 127 transitions.
[2024-05-21 21:03:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:03:40] [INFO ] Computing Do-Not-Accords matrix : 127 transitions.
[2024-05-21 21:03:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:03:40] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2448441661751045411
Running compilation step : cd /tmp/ltsmin2448441661751045411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 258 ms.
Running link step : cd /tmp/ltsmin2448441661751045411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2448441661751045411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6394342074515127687.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 127/127 transitions.
Applied a total of 0 rules in 14 ms. Remains 92 /92 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-21 21:03:55] [INFO ] Invariant cache hit.
[2024-05-21 21:03:55] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 21:03:55] [INFO ] Invariant cache hit.
[2024-05-21 21:03:55] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 21:03:55] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-21 21:03:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:03:56] [INFO ] Invariant cache hit.
[2024-05-21 21:03:56] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 92/92 places, 127/127 transitions.
Built C files in :
/tmp/ltsmin3248360562150585429
[2024-05-21 21:03:56] [INFO ] Computing symmetric may disable matrix : 127 transitions.
[2024-05-21 21:03:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:03:56] [INFO ] Computing symmetric may enable matrix : 127 transitions.
[2024-05-21 21:03:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:03:56] [INFO ] Computing Do-Not-Accords matrix : 127 transitions.
[2024-05-21 21:03:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:03:56] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3248360562150585429
Running compilation step : cd /tmp/ltsmin3248360562150585429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 265 ms.
Running link step : cd /tmp/ltsmin3248360562150585429;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3248360562150585429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3794442527109917389.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:04:11] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:04:11] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:04:11] [INFO ] Time to serialize gal into /tmp/LTL15258116585477703098.gal : 1 ms
[2024-05-21 21:04:11] [INFO ] Time to serialize properties into /tmp/LTL5327364101201990378.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15258116585477703098.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13769981664685240705.hoa' '-atoms' '/tmp/LTL5327364101201990378.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5327364101201990378.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13769981664685240705.hoa
Detected timeout of ITS tools.
[2024-05-21 21:04:26] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:04:26] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:04:26] [INFO ] Time to serialize gal into /tmp/LTL6562906658215693439.gal : 1 ms
[2024-05-21 21:04:26] [INFO ] Time to serialize properties into /tmp/LTL12379850097630804823.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6562906658215693439.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12379850097630804823.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((G("((p124>=1)&&(l532>=1))"))||(F((("(((p124<1)||(l532<1))&&((s1<1)||(l612<1)))")||(G("((s1<1)||(l1018<1))")))||(X("((s1<1)||(l61...168
Formula 0 simplified : F(F!"((p124>=1)&&(l532>=1))" & G(!"(((p124<1)||(l532<1))&&((s1<1)||(l612<1)))" & F!"((s1<1)||(l1018<1))" & X!"((s1<1)||(l612<1))"))
Detected timeout of ITS tools.
[2024-05-21 21:04:41] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:04:41] [INFO ] Applying decomposition
[2024-05-21 21:04:41] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7310354353525339346.txt' '-o' '/tmp/graph7310354353525339346.bin' '-w' '/tmp/graph7310354353525339346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7310354353525339346.bin' '-l' '-1' '-v' '-w' '/tmp/graph7310354353525339346.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:04:41] [INFO ] Decomposing Gal with order
[2024-05-21 21:04:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:04:41] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-21 21:04:41] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:04:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 3 ms.
[2024-05-21 21:04:41] [INFO ] Time to serialize gal into /tmp/LTL4489833502405355260.gal : 2 ms
[2024-05-21 21:04:41] [INFO ] Time to serialize properties into /tmp/LTL13935078534854238613.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4489833502405355260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13935078534854238613.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((G("((u2.p124>=1)&&(i1.u7.l532>=1))"))||(F((("(((u2.p124<1)||(i1.u7.l532<1))&&((u2.s1<1)||(u0.l612<1)))")||(G("((u2.s1<1)||(i5.u1...208
Formula 0 simplified : F(F!"((u2.p124>=1)&&(i1.u7.l532>=1))" & G(!"(((u2.p124<1)||(i1.u7.l532<1))&&((u2.s1<1)||(u0.l612<1)))" & F!"((u2.s1<1)||(i5.u12.l101...194
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t11, t49, t67, t119, t121, t122, t123, t124, t125, t170, t200, t202, t206, t209, t214...454
Computing Next relation with stutter on 3.73528e+06 deadlock states
10 unique states visited
0 strongly connected components in search stack
18 transitions explored
10 items max in DFS search stack
1090 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.9363,235716,1,0,165849,154503,1529,741404,1252,1.63035e+06,423818
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-08 finished in 76230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 185
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 121 transition count 179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 109 transition count 164
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 109 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 81 place count 109 transition count 159
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 99 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 99 transition count 144
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 107 place count 99 transition count 138
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 92 transition count 121
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 92 transition count 121
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 127 place count 92 transition count 115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 130 place count 89 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 89 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 135 place count 89 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 88 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 88 transition count 109
Applied a total of 137 rules in 15 ms. Remains 88 /144 variables (removed 56) and now considering 109/256 (removed 147) transitions.
// Phase 1: matrix 109 rows 88 cols
[2024-05-21 21:04:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:04:53] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 21:04:53] [INFO ] Invariant cache hit.
[2024-05-21 21:04:53] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:04:54] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-21 21:04:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:04:54] [INFO ] Invariant cache hit.
[2024-05-21 21:04:54] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/144 places, 109/256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 88/144 places, 109/256 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-09 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0) U !p1)&&(p2||X((p3||G(p4)))))))'
Support contains 6 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 125 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 125 transition count 201
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 125 transition count 195
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 115 transition count 182
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 115 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 115 transition count 178
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 107 transition count 167
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 107 transition count 167
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 89 place count 107 transition count 162
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 94 place count 102 transition count 153
Iterating global reduction 3 with 5 rules applied. Total rules applied 99 place count 102 transition count 153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 102 transition count 149
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 106 place count 99 transition count 146
Iterating global reduction 4 with 3 rules applied. Total rules applied 109 place count 99 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 99 transition count 145
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 111 place count 98 transition count 144
Iterating global reduction 5 with 1 rules applied. Total rules applied 112 place count 98 transition count 144
Applied a total of 112 rules in 10 ms. Remains 98 /144 variables (removed 46) and now considering 144/256 (removed 112) transitions.
// Phase 1: matrix 144 rows 98 cols
[2024-05-21 21:04:54] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:04:54] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 21:04:54] [INFO ] Invariant cache hit.
[2024-05-21 21:04:54] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-21 21:04:54] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-21 21:04:54] [INFO ] Invariant cache hit.
[2024-05-21 21:04:54] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/144 places, 144/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 98/144 places, 144/256 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR p1 (AND (NOT p2) (NOT p3) (NOT p4))), (OR p1 (AND (NOT p2) (NOT p3) (NOT p4))), p0, p1, (AND (NOT p4) (NOT p3)), true, (NOT p4)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) p4), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p4), acceptance={} source=6 dest: 5}, { cond=p4, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s68 1)), p0:(AND (GEQ s1 1) (GEQ s88 1)), p2:(AND (GEQ s1 1) (GEQ s58 1)), p3:(AND (GEQ s1 1) (GEQ s92 1)), p4:(AND (GEQ s1 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-10 finished in 545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1&&X(G(p2))))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 122 transition count 179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 59 place count 110 transition count 164
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 110 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 76 place count 110 transition count 159
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 100 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 100 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 100 transition count 139
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 107 place count 94 transition count 128
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 94 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 117 place count 94 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 120 place count 91 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 123 place count 91 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 91 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 90 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 90 transition count 118
Applied a total of 127 rules in 12 ms. Remains 90 /144 variables (removed 54) and now considering 118/256 (removed 138) transitions.
// Phase 1: matrix 118 rows 90 cols
[2024-05-21 21:04:54] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:04:54] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 21:04:54] [INFO ] Invariant cache hit.
[2024-05-21 21:04:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 21:04:54] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-21 21:04:54] [INFO ] Invariant cache hit.
[2024-05-21 21:04:54] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/144 places, 118/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 90/144 places, 118/256 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s88 1) (GEQ s46 1)), p1:(OR (LT s1 1) (LT s46 1)), p2:(OR (LT s1 1) (LT s88 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]]
Product exploration explored 100000 steps with 22871 reset in 127 ms.
Product exploration explored 100000 steps with 22965 reset in 138 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), true, (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 124 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 2312 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 444 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished probabilistic random walk after 13141 steps, run visited all 2 properties in 45 ms. (steps per millisecond=292 )
Probabilistic random walk after 13141 steps, saw 6210 distinct states, run finished after 46 ms. (steps per millisecond=285 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), true, (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p1)) (NOT p2))), (F (NOT (OR (AND p0 p2) (AND p2 p1))))]
Property proved to be false thanks to negative knowledge :(F (OR (AND (NOT p0) (NOT p1)) (NOT p2)))
Knowledge based reduction with 12 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-12 finished in 1146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 122 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 110 transition count 163
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 110 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 77 place count 110 transition count 158
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 87 place count 100 transition count 142
Iterating global reduction 2 with 10 rules applied. Total rules applied 97 place count 100 transition count 142
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 102 place count 100 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 108 place count 94 transition count 126
Iterating global reduction 3 with 6 rules applied. Total rules applied 114 place count 94 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 118 place count 94 transition count 122
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 121 place count 91 transition count 119
Iterating global reduction 4 with 3 rules applied. Total rules applied 124 place count 91 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 91 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 90 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 90 transition count 117
Applied a total of 127 rules in 14 ms. Remains 90 /144 variables (removed 54) and now considering 117/256 (removed 139) transitions.
// Phase 1: matrix 117 rows 90 cols
[2024-05-21 21:04:55] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:04:55] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 21:04:55] [INFO ] Invariant cache hit.
[2024-05-21 21:04:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 21:04:56] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-21 21:04:56] [INFO ] Invariant cache hit.
[2024-05-21 21:04:56] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/144 places, 117/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 90/144 places, 117/256 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s78 1)), p1:(OR (LT s1 1) (LT s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22973 reset in 112 ms.
Product exploration explored 100000 steps with 22836 reset in 113 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 435 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:04:56] [INFO ] Invariant cache hit.
[2024-05-21 21:04:56] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-21 21:04:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:04:56] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:04:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:04:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:04:56] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 21:04:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 21:04:56] [INFO ] After 21ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:04:56] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-21 21:04:56] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 117/117 transitions.
Graph (complete) has 282 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 86 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 86 transition count 109
Applied a total of 11 rules in 10 ms. Remains 86 /90 variables (removed 4) and now considering 109/117 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 86/90 places, 109/117 transitions.
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8656 steps, run visited all 1 properties in 13 ms. (steps per millisecond=665 )
Probabilistic random walk after 8656 steps, saw 4022 distinct states, run finished after 13 ms. (steps per millisecond=665 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 117/117 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 21:04:57] [INFO ] Invariant cache hit.
[2024-05-21 21:04:57] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 21:04:57] [INFO ] Invariant cache hit.
[2024-05-21 21:04:57] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 21:04:57] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-21 21:04:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:04:57] [INFO ] Invariant cache hit.
[2024-05-21 21:04:57] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 90/90 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 141 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:04:57] [INFO ] Invariant cache hit.
[2024-05-21 21:04:58] [INFO ] [Real]Absence check using 1 positive place invariants in 29 ms returned sat
[2024-05-21 21:04:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 31 ms returned sat
[2024-05-21 21:04:59] [INFO ] After 1207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:04:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:04:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:04:59] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 21:04:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 21:04:59] [INFO ] After 19ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:04:59] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-21 21:04:59] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 117/117 transitions.
Graph (complete) has 282 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 86 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 86 transition count 109
Applied a total of 11 rules in 8 ms. Remains 86 /90 variables (removed 4) and now considering 109/117 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 86/90 places, 109/117 transitions.
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 512 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8656 steps, run visited all 1 properties in 16 ms. (steps per millisecond=541 )
Probabilistic random walk after 8656 steps, saw 4022 distinct states, run finished after 31 ms. (steps per millisecond=279 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22902 reset in 110 ms.
Product exploration explored 100000 steps with 22922 reset in 106 ms.
Built C files in :
/tmp/ltsmin4706695111675004632
[2024-05-21 21:04:59] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-21 21:04:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:04:59] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-21 21:04:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:04:59] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-21 21:04:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:04:59] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4706695111675004632
Running compilation step : cd /tmp/ltsmin4706695111675004632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 245 ms.
Running link step : cd /tmp/ltsmin4706695111675004632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4706695111675004632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5604017370309801965.hoa' '--buchi-type=spotba'
LTSmin run took 132 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-14 finished in 4519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 256/256 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 120 transition count 179
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 120 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 120 transition count 175
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 107 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 107 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 83 place count 107 transition count 154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 93 place count 97 transition count 139
Iterating global reduction 2 with 10 rules applied. Total rules applied 103 place count 97 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 109 place count 97 transition count 133
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 116 place count 90 transition count 117
Iterating global reduction 3 with 7 rules applied. Total rules applied 123 place count 90 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 126 place count 90 transition count 114
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 130 place count 86 transition count 110
Iterating global reduction 4 with 4 rules applied. Total rules applied 134 place count 86 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 85 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 85 transition count 106
Applied a total of 139 rules in 14 ms. Remains 85 /144 variables (removed 59) and now considering 106/256 (removed 150) transitions.
// Phase 1: matrix 106 rows 85 cols
[2024-05-21 21:05:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:05:00] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 21:05:00] [INFO ] Invariant cache hit.
[2024-05-21 21:05:00] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:05:00] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-21 21:05:00] [INFO ] Invariant cache hit.
[2024-05-21 21:05:00] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/144 places, 106/256 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 85/144 places, 106/256 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 288 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-15 finished in 608 ms.
All properties solved by simple procedures.
Total runtime 225633 ms.

BK_STOP 1716325501856

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DBSingleClientW-PT-d1m07, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624208300323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m07.tgz
mv DBSingleClientW-PT-d1m07 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;