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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 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 1.6M 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-d2m08-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716329209910

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-d2m08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 22:06:51] [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 22:06:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:06:51] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2024-05-21 22:06:51] [INFO ] Transformed 4763 places.
[2024-05-21 22:06:51] [INFO ] Transformed 2478 transitions.
[2024-05-21 22:06:51] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 271 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 2 formulas.
Deduced a syphon composed of 3580 places in 15 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 370 places :
Symmetric choice reduction at 1 with 370 rule applications. Total rules 615 place count 767 transition count 1481
Iterating global reduction 1 with 370 rules applied. Total rules applied 985 place count 767 transition count 1481
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 1057 place count 767 transition count 1409
Discarding 300 places :
Symmetric choice reduction at 2 with 300 rule applications. Total rules 1357 place count 467 transition count 1109
Iterating global reduction 2 with 300 rules applied. Total rules applied 1657 place count 467 transition count 1109
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1667 place count 467 transition count 1099
Discarding 224 places :
Symmetric choice reduction at 3 with 224 rule applications. Total rules 1891 place count 243 transition count 794
Iterating global reduction 3 with 224 rules applied. Total rules applied 2115 place count 243 transition count 794
Ensure Unique test removed 284 transitions
Reduce isomorphic transitions removed 284 transitions.
Iterating post reduction 3 with 284 rules applied. Total rules applied 2399 place count 243 transition count 510
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 2416 place count 226 transition count 480
Iterating global reduction 4 with 17 rules applied. Total rules applied 2433 place count 226 transition count 480
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 2465 place count 226 transition count 448
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 2473 place count 218 transition count 440
Iterating global reduction 5 with 8 rules applied. Total rules applied 2481 place count 218 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2482 place count 218 transition count 439
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2489 place count 211 transition count 432
Iterating global reduction 6 with 7 rules applied. Total rules applied 2496 place count 211 transition count 432
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2504 place count 211 transition count 424
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2506 place count 209 transition count 420
Iterating global reduction 7 with 2 rules applied. Total rules applied 2508 place count 209 transition count 420
Applied a total of 2508 rules in 206 ms. Remains 209 /1183 variables (removed 974) and now considering 420/2478 (removed 2058) transitions.
// Phase 1: matrix 420 rows 209 cols
[2024-05-21 22:06:52] [INFO ] Computed 2 invariants in 24 ms
[2024-05-21 22:06:52] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-21 22:06:52] [INFO ] Invariant cache hit.
[2024-05-21 22:06:52] [INFO ] State equation strengthened by 216 read => feed constraints.
[2024-05-21 22:06:53] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2024-05-21 22:06:53] [INFO ] Invariant cache hit.
[2024-05-21 22:06:53] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 209/1183 places, 420/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1436 ms. Remains : 209/1183 places, 420/2478 transitions.
Support contains 35 out of 209 places after structural reductions.
[2024-05-21 22:06:53] [INFO ] Flatten gal took : 61 ms
[2024-05-21 22:06:53] [INFO ] Flatten gal took : 30 ms
[2024-05-21 22:06:53] [INFO ] Input system was already deterministic with 420 transitions.
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 30) seen :4
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 113 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2024-05-21 22:06:54] [INFO ] Invariant cache hit.
[2024-05-21 22:06:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 22:06:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 22:06:56] [INFO ] After 1432ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:25
[2024-05-21 22:06:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 22:06:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 22:06:57] [INFO ] After 1261ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :25
[2024-05-21 22:06:57] [INFO ] State equation strengthened by 216 read => feed constraints.
[2024-05-21 22:07:00] [INFO ] After 2286ms SMT Verify possible using 216 Read/Feed constraints in natural domain returned unsat :1 sat :25
[2024-05-21 22:07:02] [INFO ] After 4727ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :25
Attempting to minimize the solution found.
Minimization took 2406 ms.
[2024-05-21 22:07:05] [INFO ] After 8640ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :25
Fused 26 Parikh solutions to 25 different solutions.
Parikh walk visited 2 properties in 472 ms.
Support contains 28 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 420/420 transitions.
Graph (complete) has 779 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 208 transition count 415
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 202 transition count 399
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 202 transition count 399
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 202 transition count 397
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 200 transition count 395
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 200 transition count 395
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 198 transition count 392
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 198 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 198 transition count 391
Applied a total of 29 rules in 59 ms. Remains 198 /209 variables (removed 11) and now considering 391/420 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 198/209 places, 391/420 transitions.
Incomplete random walk after 10000 steps, including 2275 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Probabilistic random walk after 1000001 steps, saw 389519 distinct states, run finished after 2446 ms. (steps per millisecond=408 ) properties seen :22
Running SMT prover for 1 properties.
// Phase 1: matrix 391 rows 198 cols
[2024-05-21 22:07:08] [INFO ] Computed 2 invariants in 10 ms
[2024-05-21 22:07:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:07:09] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:07:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:07:09] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 22:07:09] [INFO ] State equation strengthened by 197 read => feed constraints.
[2024-05-21 22:07:09] [INFO ] After 92ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 22:07:09] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-21 22:07:09] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 391/391 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 179 transition count 320
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 179 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 179 transition count 318
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 56 place count 163 transition count 296
Iterating global reduction 1 with 16 rules applied. Total rules applied 72 place count 163 transition count 296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 76 place count 163 transition count 292
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 90 place count 149 transition count 268
Iterating global reduction 2 with 14 rules applied. Total rules applied 104 place count 149 transition count 268
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 115 place count 149 transition count 257
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 127 place count 137 transition count 228
Iterating global reduction 3 with 12 rules applied. Total rules applied 139 place count 137 transition count 228
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 147 place count 137 transition count 220
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 154 place count 130 transition count 196
Iterating global reduction 4 with 7 rules applied. Total rules applied 161 place count 130 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 165 place count 130 transition count 192
Applied a total of 165 rules in 36 ms. Remains 130 /198 variables (removed 68) and now considering 192/391 (removed 199) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 130/198 places, 192/391 transitions.
Incomplete random walk after 10000 steps, including 2255 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 452 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 62271 steps, run visited all 1 properties in 85 ms. (steps per millisecond=732 )
Probabilistic random walk after 62271 steps, saw 27866 distinct states, run finished after 85 ms. (steps per millisecond=732 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 5 stabilizing places and 29 stable transitions
Graph (complete) has 844 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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(X((G(p0)&&F(p1)))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 316
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 184 transition count 314
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 166 transition count 291
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 166 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 91 place count 166 transition count 288
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 107 place count 150 transition count 260
Iterating global reduction 2 with 16 rules applied. Total rules applied 123 place count 150 transition count 260
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 133 place count 150 transition count 250
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 144 place count 139 transition count 226
Iterating global reduction 3 with 11 rules applied. Total rules applied 155 place count 139 transition count 226
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 161 place count 139 transition count 220
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 170 place count 130 transition count 194
Iterating global reduction 4 with 9 rules applied. Total rules applied 179 place count 130 transition count 194
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 185 place count 130 transition count 188
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 186 place count 129 transition count 187
Iterating global reduction 5 with 1 rules applied. Total rules applied 187 place count 129 transition count 187
Applied a total of 187 rules in 19 ms. Remains 129 /209 variables (removed 80) and now considering 187/420 (removed 233) transitions.
// Phase 1: matrix 187 rows 129 cols
[2024-05-21 22:07:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 22:07:10] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 22:07:10] [INFO ] Invariant cache hit.
[2024-05-21 22:07:10] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 22:07:10] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-21 22:07:10] [INFO ] Invariant cache hit.
[2024-05-21 22:07:10] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/209 places, 187/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 129/209 places, 187/420 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 294 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s87 1)), p1:(AND (GEQ s1 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-01 finished in 775 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 U (!p1||G(p1)))))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 317
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 185 transition count 315
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 168 transition count 298
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 168 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 86 place count 168 transition count 296
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 102 place count 152 transition count 268
Iterating global reduction 2 with 16 rules applied. Total rules applied 118 place count 152 transition count 268
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 129 place count 152 transition count 257
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 140 place count 141 transition count 230
Iterating global reduction 3 with 11 rules applied. Total rules applied 151 place count 141 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 156 place count 141 transition count 225
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 165 place count 132 transition count 199
Iterating global reduction 4 with 9 rules applied. Total rules applied 174 place count 132 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 180 place count 132 transition count 193
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 181 place count 131 transition count 192
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 131 transition count 192
Applied a total of 182 rules in 41 ms. Remains 131 /209 variables (removed 78) and now considering 192/420 (removed 228) transitions.
// Phase 1: matrix 192 rows 131 cols
[2024-05-21 22:07:10] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:07:10] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 22:07:10] [INFO ] Invariant cache hit.
[2024-05-21 22:07:10] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 22:07:11] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-21 22:07:11] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-21 22:07:11] [INFO ] Invariant cache hit.
[2024-05-21 22:07:11] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/209 places, 192/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 131/209 places, 192/420 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, false, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s54 1) (GEQ s92 1)), p0:(AND (GEQ s8 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 23062 reset in 278 ms.
Product exploration explored 100000 steps with 22955 reset in 200 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 479 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), true, (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 92 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[true, false, (NOT p1)]
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 946 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 938 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 944 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 716214 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :{2=1}
Probabilistic random walk after 716214 steps, saw 288339 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :1
Running SMT prover for 2 properties.
[2024-05-21 22:07:15] [INFO ] Invariant cache hit.
[2024-05-21 22:07:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 22:07:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 22:07:15] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), true, (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 16 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-02 finished in 4681 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((p0||G(F(p1)))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 327
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 185 transition count 325
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 168 transition count 303
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 168 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 86 place count 168 transition count 301
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 101 place count 153 transition count 275
Iterating global reduction 2 with 15 rules applied. Total rules applied 116 place count 153 transition count 275
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 126 place count 153 transition count 265
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 137 place count 142 transition count 232
Iterating global reduction 3 with 11 rules applied. Total rules applied 148 place count 142 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 154 place count 142 transition count 226
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 162 place count 134 transition count 201
Iterating global reduction 4 with 8 rules applied. Total rules applied 170 place count 134 transition count 201
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 175 place count 134 transition count 196
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 176 place count 133 transition count 195
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 133 transition count 195
Applied a total of 177 rules in 57 ms. Remains 133 /209 variables (removed 76) and now considering 195/420 (removed 225) transitions.
// Phase 1: matrix 195 rows 133 cols
[2024-05-21 22:07:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:07:15] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 22:07:15] [INFO ] Invariant cache hit.
[2024-05-21 22:07:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 22:07:15] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-05-21 22:07:15] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-21 22:07:15] [INFO ] Invariant cache hit.
[2024-05-21 22:07:15] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/209 places, 195/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 503 ms. Remains : 133/209 places, 195/420 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s123 1)), p1:(OR (LT s1 1) (LT s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23073 reset in 237 ms.
Product exploration explored 100000 steps with 22925 reset in 197 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 486 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2333 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21301 steps, run visited all 2 properties in 124 ms. (steps per millisecond=171 )
Probabilistic random walk after 21301 steps, saw 10513 distinct states, run finished after 125 ms. (steps per millisecond=170 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 195/195 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2024-05-21 22:07:17] [INFO ] Invariant cache hit.
[2024-05-21 22:07:17] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 22:07:17] [INFO ] Invariant cache hit.
[2024-05-21 22:07:17] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 22:07:17] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-21 22:07:17] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-21 22:07:17] [INFO ] Invariant cache hit.
[2024-05-21 22:07:17] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 626 ms. Remains : 133/133 places, 195/195 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 486 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 420 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 448 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21301 steps, run visited all 2 properties in 95 ms. (steps per millisecond=224 )
Probabilistic random walk after 21301 steps, saw 10513 distinct states, run finished after 95 ms. (steps per millisecond=224 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23098 reset in 149 ms.
Product exploration explored 100000 steps with 22884 reset in 156 ms.
Built C files in :
/tmp/ltsmin12494373840480645819
[2024-05-21 22:07:19] [INFO ] Computing symmetric may disable matrix : 195 transitions.
[2024-05-21 22:07:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:07:19] [INFO ] Computing symmetric may enable matrix : 195 transitions.
[2024-05-21 22:07:19] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:07:19] [INFO ] Computing Do-Not-Accords matrix : 195 transitions.
[2024-05-21 22:07:19] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:07:19] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12494373840480645819
Running compilation step : cd /tmp/ltsmin12494373840480645819;'/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 496 ms.
Running link step : cd /tmp/ltsmin12494373840480645819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin12494373840480645819;'/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/stateBased11140903363374221484.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 195/195 transitions.
Applied a total of 0 rules in 12 ms. Remains 133 /133 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2024-05-21 22:07:34] [INFO ] Invariant cache hit.
[2024-05-21 22:07:34] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 22:07:34] [INFO ] Invariant cache hit.
[2024-05-21 22:07:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 22:07:34] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-21 22:07:34] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 22:07:34] [INFO ] Invariant cache hit.
[2024-05-21 22:07:34] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 453 ms. Remains : 133/133 places, 195/195 transitions.
Built C files in :
/tmp/ltsmin7844549292781569903
[2024-05-21 22:07:34] [INFO ] Computing symmetric may disable matrix : 195 transitions.
[2024-05-21 22:07:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:07:34] [INFO ] Computing symmetric may enable matrix : 195 transitions.
[2024-05-21 22:07:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:07:34] [INFO ] Computing Do-Not-Accords matrix : 195 transitions.
[2024-05-21 22:07:34] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:07:34] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7844549292781569903
Running compilation step : cd /tmp/ltsmin7844549292781569903;'/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 402 ms.
Running link step : cd /tmp/ltsmin7844549292781569903;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7844549292781569903;'/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/stateBased18258674848724340638.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:07:49] [INFO ] Flatten gal took : 13 ms
[2024-05-21 22:07:49] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:07:49] [INFO ] Time to serialize gal into /tmp/LTL16419334234776156418.gal : 2 ms
[2024-05-21 22:07:49] [INFO ] Time to serialize properties into /tmp/LTL18294652175159759584.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/LTL16419334234776156418.gal' '-t' 'CGAL' '-hoa' '/tmp/aut717702088972591110.hoa' '-atoms' '/tmp/LTL18294652175159759584.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/LTL18294652175159759584.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut717702088972591110.hoa
Detected timeout of ITS tools.
[2024-05-21 22:08:05] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:08:05] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:08:05] [INFO ] Time to serialize gal into /tmp/LTL8199280686196198317.gal : 2 ms
[2024-05-21 22:08:05] [INFO ] Time to serialize properties into /tmp/LTL10524497697407290984.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/LTL8199280686196198317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10524497697407290984.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 : !((F((G(F("((s1<1)||(l4112<1))")))||("((s1>=1)&&(l3846>=1))"))))
Formula 0 simplified : G(!"((s1>=1)&&(l3846>=1))" & FG!"((s1<1)||(l4112<1))")
Detected timeout of ITS tools.
[2024-05-21 22:08:20] [INFO ] Flatten gal took : 13 ms
[2024-05-21 22:08:20] [INFO ] Applying decomposition
[2024-05-21 22:08:20] [INFO ] Flatten gal took : 11 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/graph10438824412849511800.txt' '-o' '/tmp/graph10438824412849511800.bin' '-w' '/tmp/graph10438824412849511800.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10438824412849511800.bin' '-l' '-1' '-v' '-w' '/tmp/graph10438824412849511800.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:08:20] [INFO ] Decomposing Gal with order
[2024-05-21 22:08:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:08:20] [INFO ] Removed a total of 212 redundant transitions.
[2024-05-21 22:08:20] [INFO ] Flatten gal took : 50 ms
[2024-05-21 22:08:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 15 ms.
[2024-05-21 22:08:20] [INFO ] Time to serialize gal into /tmp/LTL9466086076241192682.gal : 5 ms
[2024-05-21 22:08:20] [INFO ] Time to serialize properties into /tmp/LTL7408291797160538478.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/LTL9466086076241192682.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7408291797160538478.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...254
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i6.i0.u0.s1<1)||(i8.u16.l4112<1))")))||("((i6.i0.u0.s1>=1)&&(i0.u15.l3846>=1))"))))
Formula 0 simplified : G(!"((i6.i0.u0.s1>=1)&&(i0.u15.l3846>=1))" & FG!"((i6.i0.u0.s1<1)||(i8.u16.l4112<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16211077622886503852
[2024-05-21 22:08:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16211077622886503852
Running compilation step : cd /tmp/ltsmin16211077622886503852;'/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 309 ms.
Running link step : cd /tmp/ltsmin16211077622886503852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16211077622886503852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-03 finished in 95047 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((G(p2)&&X(p3)&&p1))||p0)))'
Support contains 6 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 334
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 334
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 186 transition count 331
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 168 transition count 308
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 168 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 88 place count 168 transition count 305
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 104 place count 152 transition count 277
Iterating global reduction 2 with 16 rules applied. Total rules applied 120 place count 152 transition count 277
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 133 place count 152 transition count 264
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 144 place count 141 transition count 241
Iterating global reduction 3 with 11 rules applied. Total rules applied 155 place count 141 transition count 241
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 161 place count 141 transition count 235
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 169 place count 133 transition count 210
Iterating global reduction 4 with 8 rules applied. Total rules applied 177 place count 133 transition count 210
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 182 place count 133 transition count 205
Applied a total of 182 rules in 16 ms. Remains 133 /209 variables (removed 76) and now considering 205/420 (removed 215) transitions.
// Phase 1: matrix 205 rows 133 cols
[2024-05-21 22:08:50] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 22:08:50] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 22:08:50] [INFO ] Invariant cache hit.
[2024-05-21 22:08:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 22:08:50] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-05-21 22:08:50] [INFO ] Invariant cache hit.
[2024-05-21 22:08:50] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/209 places, 205/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 133/209 places, 205/420 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p1) (NOT p3)), true, (NOT p2), (AND p2 (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(OR (LT s47 1) (LT s55 1)), p1:(AND (GEQ s1 1) (GEQ s98 1)), p2:(AND (GEQ s1 1) (GEQ s94 1) (GEQ s1 1) (GEQ s127 1)), p3:(AND (GEQ s1 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8495 steps with 1960 reset in 17 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-04 finished in 693 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)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 324
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 184 transition count 322
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 165 transition count 298
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 165 transition count 298
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 165 transition count 294
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 111 place count 148 transition count 265
Iterating global reduction 2 with 17 rules applied. Total rules applied 128 place count 148 transition count 265
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 139 place count 148 transition count 254
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 152 place count 135 transition count 218
Iterating global reduction 3 with 13 rules applied. Total rules applied 165 place count 135 transition count 218
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 171 place count 135 transition count 212
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 180 place count 126 transition count 186
Iterating global reduction 4 with 9 rules applied. Total rules applied 189 place count 126 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 195 place count 126 transition count 180
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 125 transition count 179
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 125 transition count 179
Applied a total of 197 rules in 13 ms. Remains 125 /209 variables (removed 84) and now considering 179/420 (removed 241) transitions.
// Phase 1: matrix 179 rows 125 cols
[2024-05-21 22:08:51] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:08:51] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 22:08:51] [INFO ] Invariant cache hit.
[2024-05-21 22:08:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 22:08:51] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-21 22:08:51] [INFO ] Invariant cache hit.
[2024-05-21 22:08:51] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/209 places, 179/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 125/209 places, 179/420 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s92 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 23063 reset in 178 ms.
Product exploration explored 100000 steps with 22976 reset in 178 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 453 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 433 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16734 steps, run visited all 1 properties in 29 ms. (steps per millisecond=577 )
Probabilistic random walk after 16734 steps, saw 8268 distinct states, run finished after 29 ms. (steps per millisecond=577 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-05 finished in 1129 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 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 316
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 184 transition count 314
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 166 transition count 291
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 166 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 91 place count 166 transition count 288
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 107 place count 150 transition count 261
Iterating global reduction 2 with 16 rules applied. Total rules applied 123 place count 150 transition count 261
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 133 place count 150 transition count 251
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 145 place count 138 transition count 216
Iterating global reduction 3 with 12 rules applied. Total rules applied 157 place count 138 transition count 216
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 163 place count 138 transition count 210
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 171 place count 130 transition count 185
Iterating global reduction 4 with 8 rules applied. Total rules applied 179 place count 130 transition count 185
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 184 place count 130 transition count 180
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 185 place count 129 transition count 179
Iterating global reduction 5 with 1 rules applied. Total rules applied 186 place count 129 transition count 179
Applied a total of 186 rules in 27 ms. Remains 129 /209 variables (removed 80) and now considering 179/420 (removed 241) transitions.
// Phase 1: matrix 179 rows 129 cols
[2024-05-21 22:08:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 22:08:52] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 22:08:52] [INFO ] Invariant cache hit.
[2024-05-21 22:08:52] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 22:08:52] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-21 22:08:52] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:08:52] [INFO ] Invariant cache hit.
[2024-05-21 22:08:52] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/209 places, 179/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 405 ms. Remains : 129/209 places, 179/420 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-06 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 s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-06 finished in 454 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)||(p1 U p2)||G(p3))))'
Support contains 6 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 187 transition count 337
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 187 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 187 transition count 336
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 171 transition count 319
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 171 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 80 place count 171 transition count 316
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 94 place count 157 transition count 292
Iterating global reduction 2 with 14 rules applied. Total rules applied 108 place count 157 transition count 292
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 117 place count 157 transition count 283
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 127 place count 147 transition count 250
Iterating global reduction 3 with 10 rules applied. Total rules applied 137 place count 147 transition count 250
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 147 place count 147 transition count 240
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 153 place count 141 transition count 224
Iterating global reduction 4 with 6 rules applied. Total rules applied 159 place count 141 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 163 place count 141 transition count 220
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 140 transition count 219
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 140 transition count 219
Applied a total of 165 rules in 17 ms. Remains 140 /209 variables (removed 69) and now considering 219/420 (removed 201) transitions.
// Phase 1: matrix 219 rows 140 cols
[2024-05-21 22:08:52] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:08:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 22:08:52] [INFO ] Invariant cache hit.
[2024-05-21 22:08:52] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-21 22:08:53] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-05-21 22:08:53] [INFO ] Invariant cache hit.
[2024-05-21 22:08:53] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 140/209 places, 219/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 140/209 places, 219/420 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s98 1) (AND (GEQ s1 1) (GEQ s133 1))), p2:(AND (GEQ s1 1) (GEQ s139 1)), p1:(AND (GEQ s1 1) (GEQ s74 1)), p3:(AND (GEQ s1 1) (GEQ s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 297 ms.
Product exploration explored 100000 steps with 50000 reset in 261 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 521 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 18 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-08 finished in 1320 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(F(p0))&&F(p1))) U G(p2)))'
Support contains 5 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 322
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 186 transition count 320
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 169 transition count 298
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 169 transition count 298
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 85 place count 169 transition count 295
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 100 place count 154 transition count 270
Iterating global reduction 2 with 15 rules applied. Total rules applied 115 place count 154 transition count 270
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 154 transition count 261
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 135 place count 143 transition count 234
Iterating global reduction 3 with 11 rules applied. Total rules applied 146 place count 143 transition count 234
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 154 place count 143 transition count 226
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 162 place count 135 transition count 201
Iterating global reduction 4 with 8 rules applied. Total rules applied 170 place count 135 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 174 place count 135 transition count 197
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 175 place count 134 transition count 196
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 134 transition count 196
Applied a total of 176 rules in 32 ms. Remains 134 /209 variables (removed 75) and now considering 196/420 (removed 224) transitions.
// Phase 1: matrix 196 rows 134 cols
[2024-05-21 22:08:54] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 22:08:54] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 22:08:54] [INFO ] Invariant cache hit.
[2024-05-21 22:08:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-21 22:08:54] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-21 22:08:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:08:54] [INFO ] Invariant cache hit.
[2024-05-21 22:08:54] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/209 places, 196/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 447 ms. Remains : 134/209 places, 196/420 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s49 1) (GEQ s56 1)), p0:(AND (GEQ s1 1) (GEQ s128 1)), p1:(AND (GEQ s1 1) (GEQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-09 finished in 728 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)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 322
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 184 transition count 320
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 166 transition count 297
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 166 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 90 place count 166 transition count 295
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 106 place count 150 transition count 267
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 150 transition count 267
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 133 place count 150 transition count 256
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 145 place count 138 transition count 222
Iterating global reduction 3 with 12 rules applied. Total rules applied 157 place count 138 transition count 222
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 162 place count 138 transition count 217
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 171 place count 129 transition count 191
Iterating global reduction 4 with 9 rules applied. Total rules applied 180 place count 129 transition count 191
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 186 place count 129 transition count 185
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 187 place count 128 transition count 184
Iterating global reduction 5 with 1 rules applied. Total rules applied 188 place count 128 transition count 184
Applied a total of 188 rules in 17 ms. Remains 128 /209 variables (removed 81) and now considering 184/420 (removed 236) transitions.
// Phase 1: matrix 184 rows 128 cols
[2024-05-21 22:08:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:08:54] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 22:08:54] [INFO ] Invariant cache hit.
[2024-05-21 22:08:54] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 22:08:55] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-05-21 22:08:55] [INFO ] Invariant cache hit.
[2024-05-21 22:08:55] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/209 places, 184/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 128/209 places, 184/420 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s116 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 23033 reset in 128 ms.
Product exploration explored 100000 steps with 22959 reset in 134 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 465 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2349 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 441 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21043 steps, run visited all 1 properties in 35 ms. (steps per millisecond=601 )
Probabilistic random walk after 21043 steps, saw 10378 distinct states, run finished after 35 ms. (steps per millisecond=601 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-10 finished in 1178 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((X(!p1)&&p0)))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 326
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 185 transition count 324
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 167 transition count 301
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 167 transition count 301
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 90 place count 167 transition count 297
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 106 place count 151 transition count 269
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 151 transition count 269
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 133 place count 151 transition count 258
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 146 place count 138 transition count 222
Iterating global reduction 3 with 13 rules applied. Total rules applied 159 place count 138 transition count 222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 165 place count 138 transition count 216
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 174 place count 129 transition count 190
Iterating global reduction 4 with 9 rules applied. Total rules applied 183 place count 129 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 188 place count 129 transition count 185
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 189 place count 128 transition count 184
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 128 transition count 184
Applied a total of 190 rules in 17 ms. Remains 128 /209 variables (removed 81) and now considering 184/420 (removed 236) transitions.
// Phase 1: matrix 184 rows 128 cols
[2024-05-21 22:08:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:08:56] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 22:08:56] [INFO ] Invariant cache hit.
[2024-05-21 22:08:56] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 22:08:56] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-21 22:08:56] [INFO ] Invariant cache hit.
[2024-05-21 22:08:56] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/209 places, 184/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 128/209 places, 184/420 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s112 1)) (OR (LT s1 1) (LT s93 1))), p1:(OR (LT s1 1) (LT s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-11 finished in 502 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)&&(p1 U p2))))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 322
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 186 transition count 321
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 64 place count 169 transition count 299
Iterating global reduction 1 with 17 rules applied. Total rules applied 81 place count 169 transition count 299
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 169 transition count 296
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 99 place count 154 transition count 273
Iterating global reduction 2 with 15 rules applied. Total rules applied 114 place count 154 transition count 273
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 125 place count 154 transition count 262
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 135 place count 144 transition count 236
Iterating global reduction 3 with 10 rules applied. Total rules applied 145 place count 144 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 148 place count 144 transition count 233
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 153 place count 139 transition count 228
Iterating global reduction 4 with 5 rules applied. Total rules applied 158 place count 139 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 162 place count 139 transition count 224
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 163 place count 138 transition count 223
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 138 transition count 223
Applied a total of 164 rules in 18 ms. Remains 138 /209 variables (removed 71) and now considering 223/420 (removed 197) transitions.
// Phase 1: matrix 223 rows 138 cols
[2024-05-21 22:08:56] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:08:56] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 22:08:56] [INFO ] Invariant cache hit.
[2024-05-21 22:08:56] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-21 22:08:56] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-05-21 22:08:56] [INFO ] Invariant cache hit.
[2024-05-21 22:08:56] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/209 places, 223/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 521 ms. Remains : 138/209 places, 223/420 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (NOT p0), true, (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (GEQ s1 1) (GEQ s132 1)), p1:(AND (GEQ s1 1) (GEQ s72 1)), p0:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-12 finished in 781 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(X(F(p0))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 331
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 331
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 185 transition count 328
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 167 transition count 305
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 167 transition count 305
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 90 place count 167 transition count 302
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 106 place count 151 transition count 275
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 151 transition count 275
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 135 place count 151 transition count 262
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 147 place count 139 transition count 227
Iterating global reduction 3 with 12 rules applied. Total rules applied 159 place count 139 transition count 227
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 167 place count 139 transition count 219
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 175 place count 131 transition count 194
Iterating global reduction 4 with 8 rules applied. Total rules applied 183 place count 131 transition count 194
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 188 place count 131 transition count 189
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 189 place count 130 transition count 188
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 130 transition count 188
Applied a total of 190 rules in 11 ms. Remains 130 /209 variables (removed 79) and now considering 188/420 (removed 232) transitions.
// Phase 1: matrix 188 rows 130 cols
[2024-05-21 22:08:57] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 22:08:57] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 22:08:57] [INFO ] Invariant cache hit.
[2024-05-21 22:08:57] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-21 22:08:57] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2024-05-21 22:08:57] [INFO ] Invariant cache hit.
[2024-05-21 22:08:57] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/209 places, 188/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 636 ms. Remains : 130/209 places, 188/420 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s1 1) (LT s96 1)) (OR (LT s1 1) (LT s123 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Product exploration explored 100000 steps with 33333 reset in 162 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-13 finished in 1098 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 U (G(!p0)||(!p0&&G(!p1)))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 321
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 185 transition count 319
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 168 transition count 297
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 168 transition count 297
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 87 place count 168 transition count 294
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 102 place count 153 transition count 268
Iterating global reduction 2 with 15 rules applied. Total rules applied 117 place count 153 transition count 268
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 124 place count 153 transition count 261
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 133 place count 144 transition count 246
Iterating global reduction 3 with 9 rules applied. Total rules applied 142 place count 144 transition count 246
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 150 place count 144 transition count 238
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 158 place count 136 transition count 213
Iterating global reduction 4 with 8 rules applied. Total rules applied 166 place count 136 transition count 213
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 171 place count 136 transition count 208
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 172 place count 135 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 135 transition count 207
Applied a total of 173 rules in 23 ms. Remains 135 /209 variables (removed 74) and now considering 207/420 (removed 213) transitions.
// Phase 1: matrix 207 rows 135 cols
[2024-05-21 22:08:58] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 22:08:58] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 22:08:58] [INFO ] Invariant cache hit.
[2024-05-21 22:08:58] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-21 22:08:58] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-21 22:08:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:08:58] [INFO ] Invariant cache hit.
[2024-05-21 22:08:58] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/209 places, 207/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 135/209 places, 207/420 transitions.
Stuttering acceptance computed with spot in 98 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s80 1)), p0:(AND (GEQ s1 1) (GEQ s129 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22892 reset in 148 ms.
Product exploration explored 100000 steps with 22970 reset in 153 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 497 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2309 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 433 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 418 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 445 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 446 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 448 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 437 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1799807 steps, run timeout after 3001 ms. (steps per millisecond=599 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1}
Probabilistic random walk after 1799807 steps, saw 736653 distinct states, run finished after 3001 ms. (steps per millisecond=599 ) properties seen :5
Running SMT prover for 1 properties.
[2024-05-21 22:09:02] [INFO ] Invariant cache hit.
[2024-05-21 22:09:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 22:09:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 22:09:02] [INFO ] After 98ms 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 p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 274 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 104 ms :[p0, p0, (AND p0 p1)]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 207/207 transitions.
Applied a total of 0 rules in 9 ms. Remains 135 /135 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2024-05-21 22:09:03] [INFO ] Invariant cache hit.
[2024-05-21 22:09:03] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 22:09:03] [INFO ] Invariant cache hit.
[2024-05-21 22:09:03] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-21 22:09:03] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-05-21 22:09:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:09:03] [INFO ] Invariant cache hit.
[2024-05-21 22:09:03] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 135/135 places, 207/207 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 497 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2320 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 442 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 452 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 435 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1805661 steps, run timeout after 3001 ms. (steps per millisecond=601 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1}
Probabilistic random walk after 1805661 steps, saw 739143 distinct states, run finished after 3005 ms. (steps per millisecond=600 ) properties seen :5
Running SMT prover for 1 properties.
[2024-05-21 22:09:07] [INFO ] Invariant cache hit.
[2024-05-21 22:09:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 22:09:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 22:09:07] [INFO ] After 103ms 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 p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 242 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 112 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 116 ms :[p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 22934 reset in 140 ms.
Product exploration explored 100000 steps with 22960 reset in 147 ms.
Built C files in :
/tmp/ltsmin488676136186600166
[2024-05-21 22:09:08] [INFO ] Computing symmetric may disable matrix : 207 transitions.
[2024-05-21 22:09:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:09:08] [INFO ] Computing symmetric may enable matrix : 207 transitions.
[2024-05-21 22:09:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:09:08] [INFO ] Computing Do-Not-Accords matrix : 207 transitions.
[2024-05-21 22:09:08] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:09:08] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin488676136186600166
Running compilation step : cd /tmp/ltsmin488676136186600166;'/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 408 ms.
Running link step : cd /tmp/ltsmin488676136186600166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin488676136186600166;'/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/stateBased10397723119066551348.hoa' '--buchi-type=spotba'
LTSmin run took 370 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-14 finished in 10974 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 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 420/420 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 324
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 184 transition count 322
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 165 transition count 298
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 165 transition count 298
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 165 transition count 294
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 111 place count 148 transition count 265
Iterating global reduction 2 with 17 rules applied. Total rules applied 128 place count 148 transition count 265
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 139 place count 148 transition count 254
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 152 place count 135 transition count 218
Iterating global reduction 3 with 13 rules applied. Total rules applied 165 place count 135 transition count 218
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 171 place count 135 transition count 212
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 180 place count 126 transition count 186
Iterating global reduction 4 with 9 rules applied. Total rules applied 189 place count 126 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 195 place count 126 transition count 180
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 125 transition count 179
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 125 transition count 179
Applied a total of 197 rules in 21 ms. Remains 125 /209 variables (removed 84) and now considering 179/420 (removed 241) transitions.
// Phase 1: matrix 179 rows 125 cols
[2024-05-21 22:09:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:09:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 22:09:09] [INFO ] Invariant cache hit.
[2024-05-21 22:09:09] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 22:09:09] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-21 22:09:09] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:09:09] [INFO ] Invariant cache hit.
[2024-05-21 22:09:09] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/209 places, 179/420 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 382 ms. Remains : 125/209 places, 179/420 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s94 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-d2m08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLFireability-15 finished in 434 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((p0||G(F(p1)))))'
[2024-05-21 22:09:09] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3526635967522886884
[2024-05-21 22:09:09] [INFO ] Computing symmetric may disable matrix : 420 transitions.
[2024-05-21 22:09:09] [INFO ] Applying decomposition
[2024-05-21 22:09:09] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:09:09] [INFO ] Computing symmetric may enable matrix : 420 transitions.
[2024-05-21 22:09:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:09:09] [INFO ] Flatten gal took : 19 ms
[2024-05-21 22:09:09] [INFO ] Computing Do-Not-Accords matrix : 420 transitions.
[2024-05-21 22:09:09] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph1433366388155750337.txt' '-o' '/tmp/graph1433366388155750337.bin' '-w' '/tmp/graph1433366388155750337.weights'
[2024-05-21 22:09:10] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3526635967522886884
Running compilation step : cd /tmp/ltsmin3526635967522886884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1433366388155750337.bin' '-l' '-1' '-v' '-w' '/tmp/graph1433366388155750337.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:09:10] [INFO ] Decomposing Gal with order
[2024-05-21 22:09:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:09:10] [INFO ] Removed a total of 356 redundant transitions.
[2024-05-21 22:09:10] [INFO ] Flatten gal took : 80 ms
[2024-05-21 22:09:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 367 labels/synchronizations in 15 ms.
[2024-05-21 22:09:10] [INFO ] Time to serialize gal into /tmp/LTLFireability18186848857641580541.gal : 11 ms
[2024-05-21 22:09:10] [INFO ] Time to serialize properties into /tmp/LTLFireability14052457645590937232.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/LTLFireability18186848857641580541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14052457645590937232.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...278
Read 1 LTL properties
Checking formula 0 : !((F(("((i0.u0.s1>=1)&&(i0.u0.l3846>=1))")||(G(F("((i0.u0.s1<1)||(i6.u19.l4112<1))"))))))
Formula 0 simplified : G(!"((i0.u0.s1>=1)&&(i0.u0.l3846>=1))" & FG!"((i0.u0.s1<1)||(i6.u19.l4112<1))")
Compilation finished in 1014 ms.
Running link step : cd /tmp/ltsmin3526635967522886884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3526635967522886884;'/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' '--ltl' '<>(((LTLAPp0==true)||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 22:29:56] [INFO ] Flatten gal took : 38 ms
[2024-05-21 22:29:56] [INFO ] Time to serialize gal into /tmp/LTLFireability9327846657394861305.gal : 19 ms
[2024-05-21 22:29:56] [INFO ] Time to serialize properties into /tmp/LTLFireability13848205884383252065.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/LTLFireability9327846657394861305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13848205884383252065.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...298
Read 1 LTL properties
Checking formula 0 : !((F(("((s1>=1)&&(l3846>=1))")||(G(F("((s1<1)||(l4112<1))"))))))
Formula 0 simplified : G(!"((s1>=1)&&(l3846>=1))" & FG!"((s1<1)||(l4112<1))")
Detected timeout of ITS tools.
[2024-05-21 22:50:43] [INFO ] Flatten gal took : 43 ms
[2024-05-21 22:50:43] [INFO ] Input system was already deterministic with 420 transitions.
[2024-05-21 22:50:43] [INFO ] Transformed 209 places.
[2024-05-21 22:50:43] [INFO ] Transformed 420 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 22:50:44] [INFO ] Time to serialize gal into /tmp/LTLFireability655098925520828277.gal : 2 ms
[2024-05-21 22:50:44] [INFO ] Time to serialize properties into /tmp/LTLFireability3083142257891466591.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/LTLFireability655098925520828277.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3083142257891466591.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("((s1>=1)&&(l3846>=1))")||(G(F("((s1<1)||(l4112<1))"))))))
Formula 0 simplified : G(!"((s1>=1)&&(l3846>=1))" & FG!"((s1<1)||(l4112<1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8180412 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16039212 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-d2m08"
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-d2m08, 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-171624208400363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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