Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.2K Feb 26 15:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 15:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 15:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 15:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678256482291

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 06:21:23] [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]
[2023-03-08 06:21:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:21:24] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-08 06:21:24] [INFO ] Transformed 4763 places.
[2023-03-08 06:21:24] [INFO ] Transformed 2478 transitions.
[2023-03-08 06:21:24] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3580 places in 14 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 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 1499
Iterating global reduction 1 with 370 rules applied. Total rules applied 985 place count 767 transition count 1499
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 1427
Discarding 293 places :
Symmetric choice reduction at 2 with 293 rule applications. Total rules 1350 place count 474 transition count 1134
Iterating global reduction 2 with 293 rules applied. Total rules applied 1643 place count 474 transition count 1134
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1650 place count 474 transition count 1127
Discarding 216 places :
Symmetric choice reduction at 3 with 216 rule applications. Total rules 1866 place count 258 transition count 830
Iterating global reduction 3 with 216 rules applied. Total rules applied 2082 place count 258 transition count 830
Ensure Unique test removed 283 transitions
Reduce isomorphic transitions removed 283 transitions.
Iterating post reduction 3 with 283 rules applied. Total rules applied 2365 place count 258 transition count 547
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 2378 place count 245 transition count 528
Iterating global reduction 4 with 13 rules applied. Total rules applied 2391 place count 245 transition count 528
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 2407 place count 245 transition count 512
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2414 place count 238 transition count 505
Iterating global reduction 5 with 7 rules applied. Total rules applied 2421 place count 238 transition count 505
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2424 place count 238 transition count 502
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2429 place count 233 transition count 497
Iterating global reduction 6 with 5 rules applied. Total rules applied 2434 place count 233 transition count 497
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2438 place count 233 transition count 493
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2440 place count 231 transition count 489
Iterating global reduction 7 with 2 rules applied. Total rules applied 2442 place count 231 transition count 489
Applied a total of 2442 rules in 191 ms. Remains 231 /1183 variables (removed 952) and now considering 489/2478 (removed 1989) transitions.
// Phase 1: matrix 489 rows 231 cols
[2023-03-08 06:21:24] [INFO ] Computed 2 place invariants in 21 ms
[2023-03-08 06:21:24] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-08 06:21:24] [INFO ] Invariant cache hit.
[2023-03-08 06:21:25] [INFO ] State equation strengthened by 266 read => feed constraints.
[2023-03-08 06:21:25] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
[2023-03-08 06:21:25] [INFO ] Invariant cache hit.
[2023-03-08 06:21:26] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 231/1183 places, 489/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1746 ms. Remains : 231/1183 places, 489/2478 transitions.
Support contains 46 out of 231 places after structural reductions.
[2023-03-08 06:21:26] [INFO ] Flatten gal took : 56 ms
[2023-03-08 06:21:26] [INFO ] Flatten gal took : 29 ms
[2023-03-08 06:21:26] [INFO ] Input system was already deterministic with 489 transitions.
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 35) seen :2
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 36 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-03-08 06:21:27] [INFO ] Invariant cache hit.
[2023-03-08 06:21:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 06:21:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 06:21:28] [INFO ] After 697ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:30
[2023-03-08 06:21:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-08 06:21:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:21:30] [INFO ] After 1698ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :29
[2023-03-08 06:21:30] [INFO ] State equation strengthened by 266 read => feed constraints.
[2023-03-08 06:21:33] [INFO ] After 3279ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :2 sat :29
[2023-03-08 06:21:36] [INFO ] After 6857ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :29
Attempting to minimize the solution found.
Minimization took 2860 ms.
[2023-03-08 06:21:39] [INFO ] After 11730ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :29
Fused 31 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 634 ms.
Support contains 41 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 489/489 transitions.
Graph (complete) has 876 edges and 231 vertex of which 230 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 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 230 transition count 482
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 229 transition count 481
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 229 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 228 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 228 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 227 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 227 transition count 478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 227 transition count 476
Applied a total of 16 rules in 68 ms. Remains 227 /231 variables (removed 4) and now considering 476/489 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 227/231 places, 476/489 transitions.
Incomplete random walk after 10000 steps, including 2309 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 111 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 35 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) 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 28) seen :0
Finished probabilistic random walk after 482568 steps, run visited all 28 properties in 2506 ms. (steps per millisecond=192 )
Probabilistic random walk after 482568 steps, saw 186933 distinct states, run finished after 2506 ms. (steps per millisecond=192 ) properties seen :28
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 35 stable transitions
Graph (complete) has 951 edges and 231 vertex of which 230 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(G(p1))))||G(p2))))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 204 transition count 364
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 204 transition count 364
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 204 transition count 361
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 80 place count 181 transition count 333
Iterating global reduction 1 with 23 rules applied. Total rules applied 103 place count 181 transition count 333
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 111 place count 181 transition count 325
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 131 place count 161 transition count 291
Iterating global reduction 2 with 20 rules applied. Total rules applied 151 place count 161 transition count 291
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 160 place count 161 transition count 282
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 173 place count 148 transition count 257
Iterating global reduction 3 with 13 rules applied. Total rules applied 186 place count 148 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 189 place count 148 transition count 254
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 198 place count 139 transition count 245
Iterating global reduction 4 with 9 rules applied. Total rules applied 207 place count 139 transition count 245
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 214 place count 139 transition count 238
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 219 place count 134 transition count 223
Iterating global reduction 5 with 5 rules applied. Total rules applied 224 place count 134 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 228 place count 134 transition count 219
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 231 place count 131 transition count 199
Iterating global reduction 6 with 3 rules applied. Total rules applied 234 place count 131 transition count 199
Applied a total of 234 rules in 23 ms. Remains 131 /231 variables (removed 100) and now considering 199/489 (removed 290) transitions.
// Phase 1: matrix 199 rows 131 cols
[2023-03-08 06:21:43] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 06:21:44] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-08 06:21:44] [INFO ] Invariant cache hit.
[2023-03-08 06:21:44] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-08 06:21:44] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-08 06:21:44] [INFO ] Invariant cache hit.
[2023-03-08 06:21:44] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/231 places, 199/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 131/231 places, 199/489 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s71 1)), p0:(AND (GEQ s1 1) (GEQ s95 1)), p1:(AND (GEQ s48 1) (GEQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-00 finished in 885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||(F(p2)&&p1)))))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 204 transition count 367
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 204 transition count 367
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 204 transition count 363
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 183 transition count 333
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 183 transition count 333
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 107 place count 183 transition count 326
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 126 place count 164 transition count 295
Iterating global reduction 2 with 19 rules applied. Total rules applied 145 place count 164 transition count 295
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 154 place count 164 transition count 286
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 167 place count 151 transition count 261
Iterating global reduction 3 with 13 rules applied. Total rules applied 180 place count 151 transition count 261
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 190 place count 151 transition count 251
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 198 place count 143 transition count 243
Iterating global reduction 4 with 8 rules applied. Total rules applied 206 place count 143 transition count 243
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 212 place count 143 transition count 237
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 217 place count 138 transition count 222
Iterating global reduction 5 with 5 rules applied. Total rules applied 222 place count 138 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 225 place count 138 transition count 219
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 228 place count 135 transition count 199
Iterating global reduction 6 with 3 rules applied. Total rules applied 231 place count 135 transition count 199
Applied a total of 231 rules in 29 ms. Remains 135 /231 variables (removed 96) and now considering 199/489 (removed 290) transitions.
// Phase 1: matrix 199 rows 135 cols
[2023-03-08 06:21:44] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 06:21:44] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 06:21:44] [INFO ] Invariant cache hit.
[2023-03-08 06:21:44] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-08 06:21:45] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-08 06:21:45] [INFO ] Invariant cache hit.
[2023-03-08 06:21:45] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/231 places, 199/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 135/231 places, 199/489 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s128 1) (OR (LT s8 1) (LT s56 1))), p2:(AND (GEQ s1 1) (GEQ s129 1)), p0:(AND (GEQ s1 1) (GEQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-01 finished in 650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 205 transition count 377
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 205 transition count 377
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 205 transition count 373
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 77 place count 184 transition count 346
Iterating global reduction 1 with 21 rules applied. Total rules applied 98 place count 184 transition count 346
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 107 place count 184 transition count 337
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 125 place count 166 transition count 306
Iterating global reduction 2 with 18 rules applied. Total rules applied 143 place count 166 transition count 306
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 153 place count 166 transition count 296
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 164 place count 155 transition count 277
Iterating global reduction 3 with 11 rules applied. Total rules applied 175 place count 155 transition count 277
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 182 place count 155 transition count 270
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 188 place count 149 transition count 264
Iterating global reduction 4 with 6 rules applied. Total rules applied 194 place count 149 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 196 place count 149 transition count 262
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 198 place count 147 transition count 260
Iterating global reduction 5 with 2 rules applied. Total rules applied 200 place count 147 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 203 place count 147 transition count 257
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 206 place count 144 transition count 237
Iterating global reduction 6 with 3 rules applied. Total rules applied 209 place count 144 transition count 237
Applied a total of 209 rules in 55 ms. Remains 144 /231 variables (removed 87) and now considering 237/489 (removed 252) transitions.
// Phase 1: matrix 237 rows 144 cols
[2023-03-08 06:21:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 06:21:45] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 06:21:45] [INFO ] Invariant cache hit.
[2023-03-08 06:21:45] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 06:21:45] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2023-03-08 06:21:45] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 06:21:45] [INFO ] Invariant cache hit.
[2023-03-08 06:21:46] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/231 places, 237/489 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 595 ms. Remains : 144/231 places, 237/489 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s135 1)) (AND (GEQ s26 1) (GEQ s116 1) (GEQ s1 1) (GEQ s100 1)) (AND (GEQ s1 1) (GEQ s138 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-02 finished in 646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p2)&&p1)||p0))))'
Support contains 7 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 203 transition count 360
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 203 transition count 360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 203 transition count 356
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 82 place count 181 transition count 325
Iterating global reduction 1 with 22 rules applied. Total rules applied 104 place count 181 transition count 325
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 111 place count 181 transition count 318
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 130 place count 162 transition count 286
Iterating global reduction 2 with 19 rules applied. Total rules applied 149 place count 162 transition count 286
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 157 place count 162 transition count 278
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 170 place count 149 transition count 254
Iterating global reduction 3 with 13 rules applied. Total rules applied 183 place count 149 transition count 254
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 186 place count 149 transition count 251
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 195 place count 140 transition count 242
Iterating global reduction 4 with 9 rules applied. Total rules applied 204 place count 140 transition count 242
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 211 place count 140 transition count 235
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 216 place count 135 transition count 220
Iterating global reduction 5 with 5 rules applied. Total rules applied 221 place count 135 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 224 place count 135 transition count 217
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 227 place count 132 transition count 197
Iterating global reduction 6 with 3 rules applied. Total rules applied 230 place count 132 transition count 197
Applied a total of 230 rules in 16 ms. Remains 132 /231 variables (removed 99) and now considering 197/489 (removed 292) transitions.
// Phase 1: matrix 197 rows 132 cols
[2023-03-08 06:21:46] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-08 06:21:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 06:21:46] [INFO ] Invariant cache hit.
[2023-03-08 06:21:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 06:21:46] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-08 06:21:46] [INFO ] Invariant cache hit.
[2023-03-08 06:21:46] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/231 places, 197/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 132/231 places, 197/489 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s92 1)) (AND (GEQ s42 1) (GEQ s106 1))), p1:(AND (GEQ s10 1) (GEQ s100 1)), p2:(AND (GEQ s1 1) (GEQ s92 1) (GEQ s1 1) (GEQ s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-03 finished in 582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!(p0 U p1)&&X((F(p0)||G(p2)))) U p2))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 204 transition count 372
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 204 transition count 372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 204 transition count 368
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 182 transition count 338
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 182 transition count 338
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 110 place count 182 transition count 330
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 129 place count 163 transition count 297
Iterating global reduction 2 with 19 rules applied. Total rules applied 148 place count 163 transition count 297
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 158 place count 163 transition count 287
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 170 place count 151 transition count 267
Iterating global reduction 3 with 12 rules applied. Total rules applied 182 place count 151 transition count 267
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 186 place count 151 transition count 263
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 193 place count 144 transition count 256
Iterating global reduction 4 with 7 rules applied. Total rules applied 200 place count 144 transition count 256
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 207 place count 144 transition count 249
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 211 place count 140 transition count 234
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 140 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 218 place count 140 transition count 231
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 221 place count 137 transition count 211
Iterating global reduction 6 with 3 rules applied. Total rules applied 224 place count 137 transition count 211
Applied a total of 224 rules in 18 ms. Remains 137 /231 variables (removed 94) and now considering 211/489 (removed 278) transitions.
// Phase 1: matrix 211 rows 137 cols
[2023-03-08 06:21:46] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 06:21:46] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 06:21:46] [INFO ] Invariant cache hit.
[2023-03-08 06:21:46] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-08 06:21:47] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2023-03-08 06:21:47] [INFO ] Invariant cache hit.
[2023-03-08 06:21:47] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/231 places, 211/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 137/231 places, 211/489 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), true, p1, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s117 1)), p1:(OR (AND (GEQ s1 1) (GEQ s100 1)) (AND (GEQ s1 1) (GEQ s131 1))), p0:(AND (GEQ s1 1) (GEQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-08 finished in 708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))&&(X(p1)||F(p2)))))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 204 transition count 361
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 204 transition count 361
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 204 transition count 357
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 183 transition count 328
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 183 transition count 328
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 106 place count 183 transition count 322
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 126 place count 163 transition count 288
Iterating global reduction 2 with 20 rules applied. Total rules applied 146 place count 163 transition count 288
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 155 place count 163 transition count 279
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 168 place count 150 transition count 258
Iterating global reduction 3 with 13 rules applied. Total rules applied 181 place count 150 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 185 place count 150 transition count 254
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 193 place count 142 transition count 246
Iterating global reduction 4 with 8 rules applied. Total rules applied 201 place count 142 transition count 246
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 208 place count 142 transition count 239
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 212 place count 138 transition count 225
Iterating global reduction 5 with 4 rules applied. Total rules applied 216 place count 138 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 219 place count 138 transition count 222
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 221 place count 136 transition count 209
Iterating global reduction 6 with 2 rules applied. Total rules applied 223 place count 136 transition count 209
Applied a total of 223 rules in 16 ms. Remains 136 /231 variables (removed 95) and now considering 209/489 (removed 280) transitions.
// Phase 1: matrix 209 rows 136 cols
[2023-03-08 06:21:47] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 06:21:47] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 06:21:47] [INFO ] Invariant cache hit.
[2023-03-08 06:21:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 06:21:47] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-08 06:21:47] [INFO ] Invariant cache hit.
[2023-03-08 06:21:47] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/231 places, 209/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 136/231 places, 209/489 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s130 1)), p0:(AND (GEQ s8 1) (GEQ s56 1)), p1:(OR (LT s9 1) (LT s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 3 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-10 finished in 647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(p1&&X(p2)))))))'
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 202 transition count 359
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 202 transition count 359
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 202 transition count 355
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 85 place count 179 transition count 323
Iterating global reduction 1 with 23 rules applied. Total rules applied 108 place count 179 transition count 323
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 116 place count 179 transition count 315
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 135 place count 160 transition count 283
Iterating global reduction 2 with 19 rules applied. Total rules applied 154 place count 160 transition count 283
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 163 place count 160 transition count 274
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 175 place count 148 transition count 250
Iterating global reduction 3 with 12 rules applied. Total rules applied 187 place count 148 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 193 place count 148 transition count 244
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 201 place count 140 transition count 236
Iterating global reduction 4 with 8 rules applied. Total rules applied 209 place count 140 transition count 236
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 215 place count 140 transition count 230
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 221 place count 134 transition count 207
Iterating global reduction 5 with 6 rules applied. Total rules applied 227 place count 134 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 230 place count 134 transition count 204
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 232 place count 132 transition count 189
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 132 transition count 189
Applied a total of 234 rules in 15 ms. Remains 132 /231 variables (removed 99) and now considering 189/489 (removed 300) transitions.
// Phase 1: matrix 189 rows 132 cols
[2023-03-08 06:21:48] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 06:21:48] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-08 06:21:48] [INFO ] Invariant cache hit.
[2023-03-08 06:21:48] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 06:21:48] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-08 06:21:48] [INFO ] Invariant cache hit.
[2023-03-08 06:21:48] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/231 places, 189/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 132/231 places, 189/489 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s126 1)), p1:(OR (LT s1 1) (LT s97 1)), p2:(OR (LT s1 1) (LT s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28514 reset in 222 ms.
Product exploration explored 100000 steps with 28567 reset in 209 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 477 edges and 132 vertex of which 131 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 p0 p1 p2), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 432 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 432 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 437 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-08 06:21:50] [INFO ] Invariant cache hit.
[2023-03-08 06:21:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 06:21:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:21:50] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-08 06:21:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 06:21:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:21:50] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-08 06:21:50] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 06:21:50] [INFO ] After 161ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2023-03-08 06:21:50] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-08 06:21:50] [INFO ] After 730ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 189/189 transitions.
Graph (complete) has 446 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 186
Applied a total of 4 rules in 6 ms. Remains 131 /132 variables (removed 1) and now considering 186/189 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 131/132 places, 186/189 transitions.
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 425 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 444 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 435 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Finished probabilistic random walk after 62757 steps, run visited all 5 properties in 307 ms. (steps per millisecond=204 )
Probabilistic random walk after 62757 steps, saw 28492 distinct states, run finished after 307 ms. (steps per millisecond=204 ) properties seen :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 841 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 189/189 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2023-03-08 06:21:52] [INFO ] Invariant cache hit.
[2023-03-08 06:21:52] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 06:21:52] [INFO ] Invariant cache hit.
[2023-03-08 06:21:52] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 06:21:53] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-08 06:21:53] [INFO ] Invariant cache hit.
[2023-03-08 06:21:53] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 544 ms. Remains : 132/132 places, 189/189 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 477 edges and 132 vertex of which 131 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 : [(AND p1 p0 p2), (X (X (AND p0 p1))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 437 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 423 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 434 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 438 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 06:21:54] [INFO ] Invariant cache hit.
[2023-03-08 06:21:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 06:21:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:21:54] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 06:21:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 06:21:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:21:54] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 06:21:54] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 06:21:54] [INFO ] After 134ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 06:21:55] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-08 06:21:55] [INFO ] After 657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 189/189 transitions.
Graph (complete) has 446 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 186
Applied a total of 4 rules in 10 ms. Remains 131 /132 variables (removed 1) and now considering 186/189 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 131/132 places, 186/189 transitions.
Incomplete random walk after 10000 steps, including 2314 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 437 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 438 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 436 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 435 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Finished probabilistic random walk after 62757 steps, run visited all 5 properties in 346 ms. (steps per millisecond=181 )
Probabilistic random walk after 62757 steps, saw 28492 distinct states, run finished after 346 ms. (steps per millisecond=181 ) properties seen :5
Knowledge obtained : [(AND p1 p0 p2), (X (X (AND p0 p1))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p2) (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 4 factoid took 1925 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 28548 reset in 166 ms.
Product exploration explored 100000 steps with 28581 reset in 186 ms.
Built C files in :
/tmp/ltsmin10215125204870460702
[2023-03-08 06:21:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10215125204870460702
Running compilation step : cd /tmp/ltsmin10215125204870460702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 376 ms.
Running link step : cd /tmp/ltsmin10215125204870460702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10215125204870460702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13080427374306473342.hoa' '--buchi-type=spotba'
LTSmin run took 131 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-11 finished in 11998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U (F(p1) U p2)))||G(p3)))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 205 transition count 368
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 205 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 205 transition count 364
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 76 place count 185 transition count 335
Iterating global reduction 1 with 20 rules applied. Total rules applied 96 place count 185 transition count 335
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 102 place count 185 transition count 329
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 119 place count 168 transition count 303
Iterating global reduction 2 with 17 rules applied. Total rules applied 136 place count 168 transition count 303
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 145 place count 168 transition count 294
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 155 place count 158 transition count 274
Iterating global reduction 3 with 10 rules applied. Total rules applied 165 place count 158 transition count 274
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 170 place count 158 transition count 269
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 177 place count 151 transition count 262
Iterating global reduction 4 with 7 rules applied. Total rules applied 184 place count 151 transition count 262
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 189 place count 151 transition count 257
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 194 place count 146 transition count 235
Iterating global reduction 5 with 5 rules applied. Total rules applied 199 place count 146 transition count 235
Applied a total of 199 rules in 32 ms. Remains 146 /231 variables (removed 85) and now considering 235/489 (removed 254) transitions.
// Phase 1: matrix 235 rows 146 cols
[2023-03-08 06:22:00] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 06:22:00] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-08 06:22:00] [INFO ] Invariant cache hit.
[2023-03-08 06:22:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-08 06:22:00] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2023-03-08 06:22:00] [INFO ] Invariant cache hit.
[2023-03-08 06:22:00] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/231 places, 235/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 770 ms. Remains : 146/231 places, 235/489 transitions.
Stuttering acceptance computed with spot in 428 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s83 1)), p2:(AND (GEQ s1 1) (GEQ s139 1)), p1:(AND (GEQ s1 1) (GEQ s136 1)), p0:(AND (GEQ s1 1) (GEQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-12 finished in 1220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (X((p0||G(!p1)))||G(!p0))))))))'
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 202 transition count 353
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 202 transition count 353
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 202 transition count 349
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 85 place count 179 transition count 318
Iterating global reduction 1 with 23 rules applied. Total rules applied 108 place count 179 transition count 318
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 115 place count 179 transition count 311
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 136 place count 158 transition count 276
Iterating global reduction 2 with 21 rules applied. Total rules applied 157 place count 158 transition count 276
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 166 place count 158 transition count 267
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 179 place count 145 transition count 242
Iterating global reduction 3 with 13 rules applied. Total rules applied 192 place count 145 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 196 place count 145 transition count 238
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 204 place count 137 transition count 230
Iterating global reduction 4 with 8 rules applied. Total rules applied 212 place count 137 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 218 place count 137 transition count 224
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 224 place count 131 transition count 201
Iterating global reduction 5 with 6 rules applied. Total rules applied 230 place count 131 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 233 place count 131 transition count 198
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 236 place count 128 transition count 178
Iterating global reduction 6 with 3 rules applied. Total rules applied 239 place count 128 transition count 178
Applied a total of 239 rules in 12 ms. Remains 128 /231 variables (removed 103) and now considering 178/489 (removed 311) transitions.
// Phase 1: matrix 178 rows 128 cols
[2023-03-08 06:22:01] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 06:22:01] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 06:22:01] [INFO ] Invariant cache hit.
[2023-03-08 06:22:01] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 06:22:01] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-08 06:22:01] [INFO ] Invariant cache hit.
[2023-03-08 06:22:01] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/231 places, 178/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 128/231 places, 178/489 transitions.
Stuttering acceptance computed with spot in 184 ms :[p0, p0, false, false, false]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s111 1)), p1:(AND (GEQ s45 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 37300 reset in 203 ms.
Product exploration explored 100000 steps with 37383 reset in 193 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[p0, p0, false, false, false]
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 950 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 06:22:03] [INFO ] Invariant cache hit.
[2023-03-08 06:22:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 06:22:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:22:03] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 06:22:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 06:22:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:22:03] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-08 06:22:03] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 06:22:03] [INFO ] After 23ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-08 06:22:03] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 06:22:03] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 5 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 127/128 places, 175/178 transitions.
Incomplete random walk after 10000 steps, including 2275 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 43 ms. (steps per millisecond=490 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 43 ms. (steps per millisecond=490 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 495 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 140 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-08 06:22:04] [INFO ] Invariant cache hit.
[2023-03-08 06:22:04] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 06:22:04] [INFO ] Invariant cache hit.
[2023-03-08 06:22:04] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 06:22:04] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2023-03-08 06:22:04] [INFO ] Invariant cache hit.
[2023-03-08 06:22:04] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 717 ms. Remains : 128/128 places, 178/178 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 935 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 06:22:05] [INFO ] Invariant cache hit.
[2023-03-08 06:22:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 06:22:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:22:05] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 06:22:05] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 06:22:05] [INFO ] After 11ms SMT Verify possible using 54 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 06:22:05] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 06:22:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 06:22:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:22:05] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 06:22:05] [INFO ] After 11ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 06:22:05] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 06:22:05] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 12 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 127/128 places, 175/178 transitions.
Incomplete random walk after 10000 steps, including 2304 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 955 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 35 ms. (steps per millisecond=602 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 35 ms. (steps per millisecond=602 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1383 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 143 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 153 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 37355 reset in 166 ms.
Product exploration explored 100000 steps with 37290 reset in 173 ms.
Built C files in :
/tmp/ltsmin5160923515489694167
[2023-03-08 06:22:07] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5160923515489694167
Running compilation step : cd /tmp/ltsmin5160923515489694167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 258 ms.
Running link step : cd /tmp/ltsmin5160923515489694167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5160923515489694167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3778942640998597988.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-08 06:22:22] [INFO ] Invariant cache hit.
[2023-03-08 06:22:23] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 06:22:23] [INFO ] Invariant cache hit.
[2023-03-08 06:22:23] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 06:22:23] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-08 06:22:23] [INFO ] Invariant cache hit.
[2023-03-08 06:22:23] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 128/128 places, 178/178 transitions.
Built C files in :
/tmp/ltsmin8530248101607002751
[2023-03-08 06:22:23] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8530248101607002751
Running compilation step : cd /tmp/ltsmin8530248101607002751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 259 ms.
Running link step : cd /tmp/ltsmin8530248101607002751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8530248101607002751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13555263581780323092.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 06:22:38] [INFO ] Flatten gal took : 11 ms
[2023-03-08 06:22:38] [INFO ] Flatten gal took : 11 ms
[2023-03-08 06:22:38] [INFO ] Time to serialize gal into /tmp/LTL2650648546038500629.gal : 26 ms
[2023-03-08 06:22:39] [INFO ] Time to serialize properties into /tmp/LTL9271391201088405936.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2650648546038500629.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9171506515371525935.hoa' '-atoms' '/tmp/LTL9271391201088405936.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9271391201088405936.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9171506515371525935.hoa
Detected timeout of ITS tools.
[2023-03-08 06:22:54] [INFO ] Flatten gal took : 10 ms
[2023-03-08 06:22:54] [INFO ] Flatten gal took : 9 ms
[2023-03-08 06:22:54] [INFO ] Time to serialize gal into /tmp/LTL9411020550989508301.gal : 6 ms
[2023-03-08 06:22:54] [INFO ] Time to serialize properties into /tmp/LTL8429643802573067.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9411020550989508301.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8429643802573067.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...272
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((s1>=1)&&(l3659>=1))"))U((X(("((s1>=1)&&(l3659>=1))")||(G(!("((p362>=1)&&(l2273>=1))")))))||(G(!("((s1>=1)&&(l3659>=1))...191
Formula 0 simplified : FG(!"((s1<1)||(l3659<1))" | X("((s1>=1)&&(l3659>=1))" M X(!"((s1>=1)&&(l3659>=1))" & F"((p362>=1)&&(l2273>=1))")))
Detected timeout of ITS tools.
[2023-03-08 06:23:09] [INFO ] Flatten gal took : 15 ms
[2023-03-08 06:23:09] [INFO ] Applying decomposition
[2023-03-08 06:23:09] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph566309729336603003.txt' '-o' '/tmp/graph566309729336603003.bin' '-w' '/tmp/graph566309729336603003.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph566309729336603003.bin' '-l' '-1' '-v' '-w' '/tmp/graph566309729336603003.weights' '-q' '0' '-e' '0.001'
[2023-03-08 06:23:09] [INFO ] Decomposing Gal with order
[2023-03-08 06:23:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 06:23:09] [INFO ] Removed a total of 215 redundant transitions.
[2023-03-08 06:23:09] [INFO ] Flatten gal took : 119 ms
[2023-03-08 06:23:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 25 ms.
[2023-03-08 06:23:09] [INFO ] Time to serialize gal into /tmp/LTL6669231127431359348.gal : 13 ms
[2023-03-08 06:23:09] [INFO ] Time to serialize properties into /tmp/LTL3883967234402128591.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6669231127431359348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3883967234402128591.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((i0.u0.s1>=1)&&(i7.u15.l3659>=1))"))U((X(("((i0.u0.s1>=1)&&(i7.u15.l3659>=1))")||(G(!("((i7.u15.p362>=1)&&(i5.i1.u18.l2...260
Formula 0 simplified : FG(!"((i0.u0.s1<1)||(i7.u15.l3659<1))" | X("((i0.u0.s1>=1)&&(i7.u15.l3659>=1))" M X(!"((i0.u0.s1>=1)&&(i7.u15.l3659>=1))" & F"((i7.u...193
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11588722332592654892
[2023-03-08 06:23:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11588722332592654892
Running compilation step : cd /tmp/ltsmin11588722332592654892;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 259 ms.
Running link step : cd /tmp/ltsmin11588722332592654892;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11588722332592654892;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((!(LTLAPp0==true) U (X(((LTLAPp0==true)||[](!(LTLAPp1==true))))||[](!(LTLAPp0==true)))))&&!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-13 finished in 98509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)||X(F(p1)))))'
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 202 transition count 359
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 202 transition count 359
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 202 transition count 355
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 85 place count 179 transition count 323
Iterating global reduction 1 with 23 rules applied. Total rules applied 108 place count 179 transition count 323
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 116 place count 179 transition count 315
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 136 place count 159 transition count 281
Iterating global reduction 2 with 20 rules applied. Total rules applied 156 place count 159 transition count 281
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 165 place count 159 transition count 272
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 177 place count 147 transition count 252
Iterating global reduction 3 with 12 rules applied. Total rules applied 189 place count 147 transition count 252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 193 place count 147 transition count 248
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 200 place count 140 transition count 241
Iterating global reduction 4 with 7 rules applied. Total rules applied 207 place count 140 transition count 241
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 213 place count 140 transition count 235
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 218 place count 135 transition count 213
Iterating global reduction 5 with 5 rules applied. Total rules applied 223 place count 135 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 226 place count 135 transition count 210
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 229 place count 132 transition count 190
Iterating global reduction 6 with 3 rules applied. Total rules applied 232 place count 132 transition count 190
Applied a total of 232 rules in 37 ms. Remains 132 /231 variables (removed 99) and now considering 190/489 (removed 299) transitions.
// Phase 1: matrix 190 rows 132 cols
[2023-03-08 06:23:39] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 06:23:39] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 06:23:39] [INFO ] Invariant cache hit.
[2023-03-08 06:23:39] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-08 06:23:40] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-08 06:23:40] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-08 06:23:40] [INFO ] Invariant cache hit.
[2023-03-08 06:23:40] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/231 places, 190/489 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 437 ms. Remains : 132/231 places, 190/489 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s126 1)), p1:(AND (GEQ s1 1) (GEQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23026 reset in 125 ms.
Product exploration explored 100000 steps with 22945 reset in 132 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 479 edges and 132 vertex of which 131 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 : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 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 83 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 432 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1698 steps, run visited all 2 properties in 14 ms. (steps per millisecond=121 )
Probabilistic random walk after 1698 steps, saw 899 distinct states, run finished after 14 ms. (steps per millisecond=121 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 122 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 53 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 190/190 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2023-03-08 06:23:41] [INFO ] Invariant cache hit.
[2023-03-08 06:23:41] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 06:23:41] [INFO ] Invariant cache hit.
[2023-03-08 06:23:41] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-08 06:23:41] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-08 06:23:41] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 06:23:41] [INFO ] Invariant cache hit.
[2023-03-08 06:23:41] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 420 ms. Remains : 132/132 places, 190/190 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 479 edges and 132 vertex of which 131 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 : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 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 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 429 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 413 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1698 steps, run visited all 2 properties in 10 ms. (steps per millisecond=169 )
Probabilistic random walk after 1698 steps, saw 899 distinct states, run finished after 10 ms. (steps per millisecond=169 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 155 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 p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 23088 reset in 127 ms.
Product exploration explored 100000 steps with 22847 reset in 134 ms.
Built C files in :
/tmp/ltsmin14290814577842428612
[2023-03-08 06:23:42] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2023-03-08 06:23:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 06:23:42] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2023-03-08 06:23:42] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 06:23:42] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2023-03-08 06:23:42] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 06:23:42] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14290814577842428612
Running compilation step : cd /tmp/ltsmin14290814577842428612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 384 ms.
Running link step : cd /tmp/ltsmin14290814577842428612;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14290814577842428612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10420794414325872035.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 190/190 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2023-03-08 06:23:57] [INFO ] Invariant cache hit.
[2023-03-08 06:23:57] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 06:23:57] [INFO ] Invariant cache hit.
[2023-03-08 06:23:57] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-08 06:23:57] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-08 06:23:57] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 06:23:57] [INFO ] Invariant cache hit.
[2023-03-08 06:23:57] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 399 ms. Remains : 132/132 places, 190/190 transitions.
Built C files in :
/tmp/ltsmin18237201355418364459
[2023-03-08 06:23:58] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2023-03-08 06:23:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 06:23:58] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2023-03-08 06:23:58] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 06:23:58] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2023-03-08 06:23:58] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 06:23:58] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18237201355418364459
Running compilation step : cd /tmp/ltsmin18237201355418364459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 379 ms.
Running link step : cd /tmp/ltsmin18237201355418364459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18237201355418364459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16074873090287212921.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 06:24:13] [INFO ] Flatten gal took : 28 ms
[2023-03-08 06:24:13] [INFO ] Flatten gal took : 19 ms
[2023-03-08 06:24:13] [INFO ] Time to serialize gal into /tmp/LTL4581616549476677800.gal : 13 ms
[2023-03-08 06:24:13] [INFO ] Time to serialize properties into /tmp/LTL17885361894163840056.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4581616549476677800.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4065036497920839642.hoa' '-atoms' '/tmp/LTL17885361894163840056.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17885361894163840056.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4065036497920839642.hoa
Detected timeout of ITS tools.
[2023-03-08 06:24:28] [INFO ] Flatten gal took : 8 ms
[2023-03-08 06:24:28] [INFO ] Flatten gal took : 20 ms
[2023-03-08 06:24:28] [INFO ] Time to serialize gal into /tmp/LTL6339798863890091121.gal : 1 ms
[2023-03-08 06:24:28] [INFO ] Time to serialize properties into /tmp/LTL15590148301127318413.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6339798863890091121.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15590148301127318413.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1<1)||(l4129<1))"))||(X(F("((s1>=1)&&(l3657>=1))"))))))
Formula 0 simplified : F(G!"((s1<1)||(l4129<1))" & XG!"((s1>=1)&&(l3657>=1))")
Detected timeout of ITS tools.
[2023-03-08 06:24:43] [INFO ] Flatten gal took : 8 ms
[2023-03-08 06:24:43] [INFO ] Applying decomposition
[2023-03-08 06:24:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8110050034178907428.txt' '-o' '/tmp/graph8110050034178907428.bin' '-w' '/tmp/graph8110050034178907428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8110050034178907428.bin' '-l' '-1' '-v' '-w' '/tmp/graph8110050034178907428.weights' '-q' '0' '-e' '0.001'
[2023-03-08 06:24:43] [INFO ] Decomposing Gal with order
[2023-03-08 06:24:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 06:24:43] [INFO ] Removed a total of 194 redundant transitions.
[2023-03-08 06:24:43] [INFO ] Flatten gal took : 20 ms
[2023-03-08 06:24:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 22 ms.
[2023-03-08 06:24:43] [INFO ] Time to serialize gal into /tmp/LTL9886735928748034840.gal : 15 ms
[2023-03-08 06:24:43] [INFO ] Time to serialize properties into /tmp/LTL17247924007997686369.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9886735928748034840.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17247924007997686369.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((i0.u2.s1<1)||(i6.u19.l4129<1))"))||(X(F("((i0.u2.s1>=1)&&(u15.l3657>=1))"))))))
Formula 0 simplified : F(G!"((i0.u2.s1<1)||(i6.u19.l4129<1))" & XG!"((i0.u2.s1>=1)&&(u15.l3657>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6061914531437311057
[2023-03-08 06:24:58] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6061914531437311057
Running compilation step : cd /tmp/ltsmin6061914531437311057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 280 ms.
Running link step : cd /tmp/ltsmin6061914531437311057;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6061914531437311057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-14 finished in 93962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 201 transition count 352
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 201 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 201 transition count 348
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 88 place count 177 transition count 315
Iterating global reduction 1 with 24 rules applied. Total rules applied 112 place count 177 transition count 315
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 120 place count 177 transition count 307
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 141 place count 156 transition count 272
Iterating global reduction 2 with 21 rules applied. Total rules applied 162 place count 156 transition count 272
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 171 place count 156 transition count 263
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 185 place count 142 transition count 237
Iterating global reduction 3 with 14 rules applied. Total rules applied 199 place count 142 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 203 place count 142 transition count 233
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 212 place count 133 transition count 224
Iterating global reduction 4 with 9 rules applied. Total rules applied 221 place count 133 transition count 224
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 228 place count 133 transition count 217
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 233 place count 128 transition count 199
Iterating global reduction 5 with 5 rules applied. Total rules applied 238 place count 128 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 241 place count 128 transition count 196
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 244 place count 125 transition count 176
Iterating global reduction 6 with 3 rules applied. Total rules applied 247 place count 125 transition count 176
Applied a total of 247 rules in 14 ms. Remains 125 /231 variables (removed 106) and now considering 176/489 (removed 313) transitions.
// Phase 1: matrix 176 rows 125 cols
[2023-03-08 06:25:13] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 06:25:13] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 06:25:13] [INFO ] Invariant cache hit.
[2023-03-08 06:25:13] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 06:25:13] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-08 06:25:13] [INFO ] Invariant cache hit.
[2023-03-08 06:25:14] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/231 places, 176/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 381 ms. Remains : 125/231 places, 176/489 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23030 reset in 208 ms.
Product exploration explored 100000 steps with 22900 reset in 153 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 450 edges and 125 vertex of which 124 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 45002 steps, run visited all 1 properties in 70 ms. (steps per millisecond=642 )
Probabilistic random walk after 45002 steps, saw 21034 distinct states, run finished after 70 ms. (steps per millisecond=642 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 06:25:15] [INFO ] Invariant cache hit.
[2023-03-08 06:25:15] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 06:25:15] [INFO ] Invariant cache hit.
[2023-03-08 06:25:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 06:25:15] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-08 06:25:15] [INFO ] Invariant cache hit.
[2023-03-08 06:25:15] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 125/125 places, 176/176 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 450 edges and 125 vertex of which 124 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 45002 steps, run visited all 1 properties in 80 ms. (steps per millisecond=562 )
Probabilistic random walk after 45002 steps, saw 21034 distinct states, run finished after 81 ms. (steps per millisecond=555 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23057 reset in 120 ms.
Product exploration explored 100000 steps with 23042 reset in 128 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 176/176 transitions.
Applied a total of 0 rules in 21 ms. Remains 125 /125 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 06:25:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 06:25:17] [INFO ] Invariant cache hit.
[2023-03-08 06:25:17] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 125/125 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin4563833877417352471
[2023-03-08 06:25:17] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4563833877417352471
Running compilation step : cd /tmp/ltsmin4563833877417352471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 277 ms.
Running link step : cd /tmp/ltsmin4563833877417352471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4563833877417352471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4714134686993680062.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 06:25:32] [INFO ] Invariant cache hit.
[2023-03-08 06:25:32] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 06:25:32] [INFO ] Invariant cache hit.
[2023-03-08 06:25:32] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 06:25:32] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-08 06:25:32] [INFO ] Invariant cache hit.
[2023-03-08 06:25:32] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 125/125 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin17358985411203594419
[2023-03-08 06:25:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17358985411203594419
Running compilation step : cd /tmp/ltsmin17358985411203594419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 285 ms.
Running link step : cd /tmp/ltsmin17358985411203594419;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17358985411203594419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11255745694493911493.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 06:25:48] [INFO ] Flatten gal took : 41 ms
[2023-03-08 06:25:48] [INFO ] Flatten gal took : 7 ms
[2023-03-08 06:25:48] [INFO ] Time to serialize gal into /tmp/LTL9669731554889759074.gal : 1 ms
[2023-03-08 06:25:48] [INFO ] Time to serialize properties into /tmp/LTL11514478427264507059.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9669731554889759074.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16822120429579136386.hoa' '-atoms' '/tmp/LTL11514478427264507059.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11514478427264507059.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16822120429579136386.hoa
Detected timeout of ITS tools.
[2023-03-08 06:26:03] [INFO ] Flatten gal took : 7 ms
[2023-03-08 06:26:03] [INFO ] Flatten gal took : 5 ms
[2023-03-08 06:26:03] [INFO ] Time to serialize gal into /tmp/LTL4496860183568394013.gal : 1 ms
[2023-03-08 06:26:03] [INFO ] Time to serialize properties into /tmp/LTL6243438393885677346.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4496860183568394013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6243438393885677346.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("((s1<1)||(l3085<1))"))))))
Formula 0 simplified : XXXF!"((s1<1)||(l3085<1))"
Detected timeout of ITS tools.
[2023-03-08 06:26:18] [INFO ] Flatten gal took : 6 ms
[2023-03-08 06:26:18] [INFO ] Applying decomposition
[2023-03-08 06:26:18] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16774475653934052468.txt' '-o' '/tmp/graph16774475653934052468.bin' '-w' '/tmp/graph16774475653934052468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16774475653934052468.bin' '-l' '-1' '-v' '-w' '/tmp/graph16774475653934052468.weights' '-q' '0' '-e' '0.001'
[2023-03-08 06:26:18] [INFO ] Decomposing Gal with order
[2023-03-08 06:26:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 06:26:18] [INFO ] Removed a total of 197 redundant transitions.
[2023-03-08 06:26:18] [INFO ] Flatten gal took : 16 ms
[2023-03-08 06:26:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 4 ms.
[2023-03-08 06:26:18] [INFO ] Time to serialize gal into /tmp/LTL1323066384257589083.gal : 2 ms
[2023-03-08 06:26:18] [INFO ] Time to serialize properties into /tmp/LTL8518648369648625837.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1323066384257589083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8518648369648625837.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("((i5.u0.s1<1)||(i5.u0.l3085<1))"))))))
Formula 0 simplified : XXXF!"((i5.u0.s1<1)||(i5.u0.l3085<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2723605195117619988
[2023-03-08 06:26:33] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2723605195117619988
Running compilation step : cd /tmp/ltsmin2723605195117619988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 272 ms.
Running link step : cd /tmp/ltsmin2723605195117619988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin2723605195117619988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-15 finished in 94848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (X((p0||G(!p1)))||G(!p0))))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d2m10-LTLFireability-13
Stuttering acceptance computed with spot in 161 ms :[p0, p0, false, false, false]
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 202 transition count 353
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 202 transition count 353
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 202 transition count 349
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 85 place count 179 transition count 318
Iterating global reduction 1 with 23 rules applied. Total rules applied 108 place count 179 transition count 318
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 115 place count 179 transition count 311
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 136 place count 158 transition count 276
Iterating global reduction 2 with 21 rules applied. Total rules applied 157 place count 158 transition count 276
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 166 place count 158 transition count 267
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 179 place count 145 transition count 242
Iterating global reduction 3 with 13 rules applied. Total rules applied 192 place count 145 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 196 place count 145 transition count 238
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 204 place count 137 transition count 230
Iterating global reduction 4 with 8 rules applied. Total rules applied 212 place count 137 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 218 place count 137 transition count 224
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 224 place count 131 transition count 201
Iterating global reduction 5 with 6 rules applied. Total rules applied 230 place count 131 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 233 place count 131 transition count 198
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 236 place count 128 transition count 178
Iterating global reduction 6 with 3 rules applied. Total rules applied 239 place count 128 transition count 178
Applied a total of 239 rules in 35 ms. Remains 128 /231 variables (removed 103) and now considering 178/489 (removed 311) transitions.
// Phase 1: matrix 178 rows 128 cols
[2023-03-08 06:26:48] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-08 06:26:49] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-08 06:26:49] [INFO ] Invariant cache hit.
[2023-03-08 06:26:49] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 06:26:49] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2023-03-08 06:26:49] [INFO ] Invariant cache hit.
[2023-03-08 06:26:49] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 128/231 places, 178/489 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 879 ms. Remains : 128/231 places, 178/489 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s111 1)), p1:(AND (GEQ s45 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 37350 reset in 148 ms.
Product exploration explored 100000 steps with 37341 reset in 190 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[p0, p0, false, false, false]
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 976 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 422 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 06:26:50] [INFO ] Invariant cache hit.
[2023-03-08 06:26:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 06:26:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:26:50] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 06:26:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 06:26:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:26:50] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-08 06:26:50] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 06:26:50] [INFO ] After 24ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-08 06:26:50] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 06:26:50] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 8 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 127/128 places, 175/178 transitions.
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 42 ms. (steps per millisecond=502 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 54 ms. (steps per millisecond=390 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 493 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 148 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-08 06:26:51] [INFO ] Invariant cache hit.
[2023-03-08 06:26:51] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-08 06:26:51] [INFO ] Invariant cache hit.
[2023-03-08 06:26:52] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 06:26:52] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2023-03-08 06:26:52] [INFO ] Invariant cache hit.
[2023-03-08 06:26:52] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 726 ms. Remains : 128/128 places, 178/178 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2323 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 957 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 06:26:52] [INFO ] Invariant cache hit.
[2023-03-08 06:26:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 06:26:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:26:52] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 06:26:52] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 06:26:52] [INFO ] After 11ms SMT Verify possible using 54 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 06:26:52] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 06:26:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 06:26:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:26:52] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 06:26:52] [INFO ] After 11ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 06:26:52] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 06:26:52] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 4 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 127/128 places, 175/178 transitions.
Incomplete random walk after 10000 steps, including 2311 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 34 ms. (steps per millisecond=620 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 34 ms. (steps per millisecond=620 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 383 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 159 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 155 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 37365 reset in 153 ms.
Product exploration explored 100000 steps with 37276 reset in 150 ms.
Built C files in :
/tmp/ltsmin4338271986110859750
[2023-03-08 06:26:54] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4338271986110859750
Running compilation step : cd /tmp/ltsmin4338271986110859750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 246 ms.
Running link step : cd /tmp/ltsmin4338271986110859750;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4338271986110859750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4427135850169523965.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-08 06:27:09] [INFO ] Invariant cache hit.
[2023-03-08 06:27:09] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 06:27:09] [INFO ] Invariant cache hit.
[2023-03-08 06:27:09] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 06:27:09] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-08 06:27:09] [INFO ] Invariant cache hit.
[2023-03-08 06:27:09] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 128/128 places, 178/178 transitions.
Built C files in :
/tmp/ltsmin17734738019680860655
[2023-03-08 06:27:09] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17734738019680860655
Running compilation step : cd /tmp/ltsmin17734738019680860655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 270 ms.
Running link step : cd /tmp/ltsmin17734738019680860655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17734738019680860655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16312260053433218733.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 06:27:24] [INFO ] Flatten gal took : 6 ms
[2023-03-08 06:27:24] [INFO ] Flatten gal took : 7 ms
[2023-03-08 06:27:24] [INFO ] Time to serialize gal into /tmp/LTL3712989548793301246.gal : 2 ms
[2023-03-08 06:27:24] [INFO ] Time to serialize properties into /tmp/LTL16797077809043007043.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3712989548793301246.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4575216043498374890.hoa' '-atoms' '/tmp/LTL16797077809043007043.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16797077809043007043.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4575216043498374890.hoa
Detected timeout of ITS tools.
[2023-03-08 06:27:39] [INFO ] Flatten gal took : 7 ms
[2023-03-08 06:27:40] [INFO ] Flatten gal took : 5 ms
[2023-03-08 06:27:40] [INFO ] Time to serialize gal into /tmp/LTL1619328988006234396.gal : 1 ms
[2023-03-08 06:27:40] [INFO ] Time to serialize properties into /tmp/LTL7451030351687510618.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1619328988006234396.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7451030351687510618.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((s1>=1)&&(l3659>=1))"))U((X(("((s1>=1)&&(l3659>=1))")||(G(!("((p362>=1)&&(l2273>=1))")))))||(G(!("((s1>=1)&&(l3659>=1))...191
Formula 0 simplified : FG(!"((s1<1)||(l3659<1))" | X("((s1>=1)&&(l3659>=1))" M X(!"((s1>=1)&&(l3659>=1))" & F"((p362>=1)&&(l2273>=1))")))
Detected timeout of ITS tools.
[2023-03-08 06:27:55] [INFO ] Flatten gal took : 12 ms
[2023-03-08 06:27:55] [INFO ] Applying decomposition
[2023-03-08 06:27:55] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15726192632813018266.txt' '-o' '/tmp/graph15726192632813018266.bin' '-w' '/tmp/graph15726192632813018266.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15726192632813018266.bin' '-l' '-1' '-v' '-w' '/tmp/graph15726192632813018266.weights' '-q' '0' '-e' '0.001'
[2023-03-08 06:27:55] [INFO ] Decomposing Gal with order
[2023-03-08 06:27:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 06:27:55] [INFO ] Removed a total of 197 redundant transitions.
[2023-03-08 06:27:55] [INFO ] Flatten gal took : 29 ms
[2023-03-08 06:27:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 4 ms.
[2023-03-08 06:27:55] [INFO ] Time to serialize gal into /tmp/LTL10506380065717921125.gal : 2 ms
[2023-03-08 06:27:55] [INFO ] Time to serialize properties into /tmp/LTL2782938436020340645.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10506380065717921125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2782938436020340645.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((i3.u2.s1>=1)&&(i5.u17.l3659>=1))"))U((X(("((i3.u2.s1>=1)&&(i5.u17.l3659>=1))")||(G(!("((i5.u17.p362>=1)&&(i6.u19.l2273...257
Formula 0 simplified : FG(!"((i3.u2.s1<1)||(i5.u17.l3659<1))" | X("((i3.u2.s1>=1)&&(i5.u17.l3659>=1))" M X(!"((i3.u2.s1>=1)&&(i5.u17.l3659>=1))" & F"((i5.u...190
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14532114752185034580
[2023-03-08 06:28:10] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14532114752185034580
Running compilation step : cd /tmp/ltsmin14532114752185034580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 267 ms.
Running link step : cd /tmp/ltsmin14532114752185034580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin14532114752185034580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((!(LTLAPp0==true) U (X(((LTLAPp0==true)||[](!(LTLAPp1==true))))||[](!(LTLAPp0==true)))))&&!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-13 finished in 96774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)||X(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m10-LTLFireability-15
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 201 transition count 352
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 201 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 201 transition count 348
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 88 place count 177 transition count 315
Iterating global reduction 1 with 24 rules applied. Total rules applied 112 place count 177 transition count 315
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 120 place count 177 transition count 307
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 141 place count 156 transition count 272
Iterating global reduction 2 with 21 rules applied. Total rules applied 162 place count 156 transition count 272
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 171 place count 156 transition count 263
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 185 place count 142 transition count 237
Iterating global reduction 3 with 14 rules applied. Total rules applied 199 place count 142 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 203 place count 142 transition count 233
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 212 place count 133 transition count 224
Iterating global reduction 4 with 9 rules applied. Total rules applied 221 place count 133 transition count 224
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 228 place count 133 transition count 217
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 233 place count 128 transition count 199
Iterating global reduction 5 with 5 rules applied. Total rules applied 238 place count 128 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 241 place count 128 transition count 196
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 244 place count 125 transition count 176
Iterating global reduction 6 with 3 rules applied. Total rules applied 247 place count 125 transition count 176
Applied a total of 247 rules in 24 ms. Remains 125 /231 variables (removed 106) and now considering 176/489 (removed 313) transitions.
// Phase 1: matrix 176 rows 125 cols
[2023-03-08 06:28:25] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 06:28:25] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 06:28:25] [INFO ] Invariant cache hit.
[2023-03-08 06:28:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 06:28:25] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-08 06:28:25] [INFO ] Invariant cache hit.
[2023-03-08 06:28:26] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 125/231 places, 176/489 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 406 ms. Remains : 125/231 places, 176/489 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23107 reset in 117 ms.
Product exploration explored 100000 steps with 22999 reset in 118 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 450 edges and 125 vertex of which 124 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 445 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 45002 steps, run visited all 1 properties in 72 ms. (steps per millisecond=625 )
Probabilistic random walk after 45002 steps, saw 21034 distinct states, run finished after 72 ms. (steps per millisecond=625 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 176/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 06:28:27] [INFO ] Invariant cache hit.
[2023-03-08 06:28:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 06:28:27] [INFO ] Invariant cache hit.
[2023-03-08 06:28:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 06:28:27] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-08 06:28:27] [INFO ] Invariant cache hit.
[2023-03-08 06:28:27] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 125/125 places, 176/176 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 450 edges and 125 vertex of which 124 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 45002 steps, run visited all 1 properties in 70 ms. (steps per millisecond=642 )
Probabilistic random walk after 45002 steps, saw 21034 distinct states, run finished after 70 ms. (steps per millisecond=642 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22941 reset in 122 ms.
Product exploration explored 100000 steps with 23003 reset in 120 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 125 /125 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 06:28:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 06:28:28] [INFO ] Invariant cache hit.
[2023-03-08 06:28:28] [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 97 ms. Remains : 125/125 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin13039076783942122779
[2023-03-08 06:28:28] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13039076783942122779
Running compilation step : cd /tmp/ltsmin13039076783942122779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 268 ms.
Running link step : cd /tmp/ltsmin13039076783942122779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13039076783942122779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11838995193701776153.hoa' '--buchi-type=spotba'
LTSmin run took 8505 ms.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-15 finished in 12189 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-08 06:28:37] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18050530362086939456
[2023-03-08 06:28:37] [INFO ] Computing symmetric may disable matrix : 489 transitions.
[2023-03-08 06:28:37] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 06:28:37] [INFO ] Applying decomposition
[2023-03-08 06:28:37] [INFO ] Computing symmetric may enable matrix : 489 transitions.
[2023-03-08 06:28:37] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 06:28:37] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8000827199261447171.txt' '-o' '/tmp/graph8000827199261447171.bin' '-w' '/tmp/graph8000827199261447171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8000827199261447171.bin' '-l' '-1' '-v' '-w' '/tmp/graph8000827199261447171.weights' '-q' '0' '-e' '0.001'
[2023-03-08 06:28:37] [INFO ] Decomposing Gal with order
[2023-03-08 06:28:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 06:28:37] [INFO ] Computing Do-Not-Accords matrix : 489 transitions.
[2023-03-08 06:28:37] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 06:28:37] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18050530362086939456
Running compilation step : cd /tmp/ltsmin18050530362086939456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-08 06:28:37] [INFO ] Removed a total of 426 redundant transitions.
[2023-03-08 06:28:37] [INFO ] Flatten gal took : 37 ms
[2023-03-08 06:28:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 488 labels/synchronizations in 12 ms.
[2023-03-08 06:28:37] [INFO ] Time to serialize gal into /tmp/LTLFireability9083222975656209426.gal : 4 ms
[2023-03-08 06:28:37] [INFO ] Time to serialize properties into /tmp/LTLFireability1928001650010369938.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9083222975656209426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1928001650010369938.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(F((!("((i0.u0.s1>=1)&&(i7.u20.l3659>=1))"))&&(X((!("((i0.u0.s1>=1)&&(i7.u20.l3659>=1))"))U((X(("((i0.u0.s1>=1)&&(i7.u20.l3659>=1)...262
Formula 0 simplified : FG("((i0.u0.s1>=1)&&(i7.u20.l3659>=1))" | X("((i0.u0.s1>=1)&&(i7.u20.l3659>=1))" M X(!"((i0.u0.s1>=1)&&(i7.u20.l3659>=1))" & F"((i7....191
Compilation finished in 1231 ms.
Running link step : cd /tmp/ltsmin18050530362086939456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18050530362086939456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (X(((LTLAPp0==true)||[](!(LTLAPp1==true))))||[](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.048: LTL layer: formula: [](<>((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (X(((LTLAPp0==true)||[](!(LTLAPp1==true))))||[](!(LTLAPp0==true))))))))
pins2lts-mc-linux64( 4/ 8), 0.048: "[](<>((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (X(((LTLAPp0==true)||[](!(LTLAPp1==true))))||[](!(LTLAPp0==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.048: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.066: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.147: There are 495 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.147: State length is 232, there are 501 groups
pins2lts-mc-linux64( 0/ 8), 0.147: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.147: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.147: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.147: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.173: [Blue] ~17 levels ~960 states ~2056 transitions
pins2lts-mc-linux64( 5/ 8), 0.202: [Blue] ~49 levels ~1920 states ~5856 transitions
pins2lts-mc-linux64( 5/ 8), 0.229: [Blue] ~70 levels ~3840 states ~10080 transitions
pins2lts-mc-linux64( 3/ 8), 0.304: [Blue] ~46 levels ~7680 states ~18544 transitions
pins2lts-mc-linux64( 3/ 8), 0.404: [Blue] ~53 levels ~15360 states ~34960 transitions
pins2lts-mc-linux64( 2/ 8), 0.616: [Blue] ~59 levels ~30720 states ~68400 transitions
pins2lts-mc-linux64( 4/ 8), 1.027: [Blue] ~398 levels ~61440 states ~156624 transitions
pins2lts-mc-linux64( 2/ 8), 1.812: [Blue] ~92 levels ~122880 states ~262656 transitions
pins2lts-mc-linux64( 2/ 8), 3.299: [Blue] ~220 levels ~245760 states ~525392 transitions
pins2lts-mc-linux64( 6/ 8), 7.307: [Blue] ~44 levels ~491520 states ~1010120 transitions
pins2lts-mc-linux64( 3/ 8), 11.656: [Blue] ~492 levels ~983040 states ~2152584 transitions
pins2lts-mc-linux64( 7/ 8), 20.054: [Blue] ~290 levels ~1966080 states ~4140024 transitions
pins2lts-mc-linux64( 7/ 8), 36.779: [Blue] ~290 levels ~3932160 states ~8314152 transitions
pins2lts-mc-linux64( 7/ 8), 70.208: [Blue] ~290 levels ~7864320 states ~17302424 transitions
pins2lts-mc-linux64( 7/ 8), 137.055: [Blue] ~290 levels ~15728640 states ~33886696 transitions
pins2lts-mc-linux64( 7/ 8), 271.612: [Blue] ~290 levels ~31457280 states ~69636680 transitions
pins2lts-mc-linux64( 7/ 8), 543.494: [Blue] ~290 levels ~62914560 states ~141878120 transitions
pins2lts-mc-linux64( 7/ 8), 1091.221: [Blue] ~290 levels ~125829120 states ~294550912 transitions
pins2lts-mc-linux64( 3/ 8), 1163.354: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1163.377:
pins2lts-mc-linux64( 0/ 8), 1163.377: Explored 129067714 states 348106683 transitions, fanout: 2.697
pins2lts-mc-linux64( 0/ 8), 1163.377: Total exploration time 1163.220 sec (1163.180 sec minimum, 1163.196 sec on average)
pins2lts-mc-linux64( 0/ 8), 1163.377: States per second: 110957, Transitions per second: 299261
pins2lts-mc-linux64( 0/ 8), 1163.377:
pins2lts-mc-linux64( 0/ 8), 1163.377: State space has 134213030 states, 62698969 are accepting
pins2lts-mc-linux64( 0/ 8), 1163.377: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1163.377: blue states: 129067714 (96.17%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1163.377: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1163.377: all-red states: 72389308 (53.94%), bogus 3224 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1163.377:
pins2lts-mc-linux64( 0/ 8), 1163.377: Total memory used for local state coloring: 15.5MB
pins2lts-mc-linux64( 0/ 8), 1163.377:
pins2lts-mc-linux64( 0/ 8), 1163.377: Queue width: 8B, total height: 1016768, memory: 7.76MB
pins2lts-mc-linux64( 0/ 8), 1163.377: Tree memory: 1115.0MB, 8.7 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 1163.377: Tree fill ratio (roots/leafs): 99.0%/35.0%
pins2lts-mc-linux64( 0/ 8), 1163.377: Stored 492 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1163.377: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1163.377: Est. total memory use: 1122.8MB (~1031.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18050530362086939456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (X(((LTLAPp0==true)||[](!(LTLAPp1==true))))||[](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18050530362086939456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (X(((LTLAPp0==true)||[](!(LTLAPp1==true))))||[](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-08 06:51:02] [INFO ] Flatten gal took : 14 ms
[2023-03-08 06:51:02] [INFO ] Time to serialize gal into /tmp/LTLFireability14179840379484412025.gal : 2 ms
[2023-03-08 06:51:02] [INFO ] Time to serialize properties into /tmp/LTLFireability392784094917675333.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14179840379484412025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability392784094917675333.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((G(F((!("((s1>=1)&&(l3659>=1))"))&&(X((!("((s1>=1)&&(l3659>=1))"))U((X(("((s1>=1)&&(l3659>=1))")||(G(!("((p362>=1)&&(l2273>=1))"))))...196
Formula 0 simplified : FG("((s1>=1)&&(l3659>=1))" | X("((s1>=1)&&(l3659>=1))" M X(!"((s1>=1)&&(l3659>=1))" & F"((p362>=1)&&(l2273>=1))")))
Detected timeout of ITS tools.
[2023-03-08 07:13:29] [INFO ] Flatten gal took : 128 ms
[2023-03-08 07:13:30] [INFO ] Input system was already deterministic with 489 transitions.
[2023-03-08 07:13:30] [INFO ] Transformed 231 places.
[2023-03-08 07:13:30] [INFO ] Transformed 489 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
[2023-03-08 07:13:30] [INFO ] Time to serialize gal into /tmp/LTLFireability12987217784586055413.gal : 10 ms
[2023-03-08 07:13:30] [INFO ] Time to serialize properties into /tmp/LTLFireability5546935730915641577.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12987217784586055413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5546935730915641577.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F((!("((s1>=1)&&(l3659>=1))"))&&(X((!("((s1>=1)&&(l3659>=1))"))U((X(("((s1>=1)&&(l3659>=1))")||(G(!("((p362>=1)&&(l2273>=1))"))))...196
Formula 0 simplified : FG("((s1>=1)&&(l3659>=1))" | X("((s1>=1)&&(l3659>=1))" M X(!"((s1>=1)&&(l3659>=1))" & F"((p362>=1)&&(l2273>=1))")))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9622196 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15911872 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-d2m10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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