fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r101-tall-167814475100268
Last Updated
May 14, 2023

About the Execution of ITS-Tools for DBSingleClientW-PT-d1m08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16221.359 3600000.00 5703719.00 102030.60 FF?FFFFFFFFFTFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:36 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 432K 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-d1m08-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678242387863

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-d1m08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 02:26:35] [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 02:26:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 02:26:35] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-08 02:26:35] [INFO ] Transformed 1440 places.
[2023-03-08 02:26:35] [INFO ] Transformed 672 transitions.
[2023-03-08 02:26:35] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 178 place count 249 transition count 438
Iterating global reduction 1 with 77 rules applied. Total rules applied 255 place count 249 transition count 438
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 283 place count 249 transition count 410
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 339 place count 193 transition count 354
Iterating global reduction 2 with 56 rules applied. Total rules applied 395 place count 193 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 397 place count 193 transition count 352
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 425 place count 165 transition count 311
Iterating global reduction 3 with 28 rules applied. Total rules applied 453 place count 165 transition count 311
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 479 place count 165 transition count 285
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 485 place count 159 transition count 276
Iterating global reduction 4 with 6 rules applied. Total rules applied 491 place count 159 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 498 place count 159 transition count 269
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 501 place count 156 transition count 266
Iterating global reduction 5 with 3 rules applied. Total rules applied 504 place count 156 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 505 place count 156 transition count 265
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 506 place count 155 transition count 264
Iterating global reduction 6 with 1 rules applied. Total rules applied 507 place count 155 transition count 264
Applied a total of 507 rules in 79 ms. Remains 155 /347 variables (removed 192) and now considering 264/672 (removed 408) transitions.
// Phase 1: matrix 264 rows 155 cols
[2023-03-08 02:26:35] [INFO ] Computed 2 place invariants in 24 ms
[2023-03-08 02:26:35] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-08 02:26:35] [INFO ] Invariant cache hit.
[2023-03-08 02:26:36] [INFO ] State equation strengthened by 122 read => feed constraints.
[2023-03-08 02:26:36] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2023-03-08 02:26:36] [INFO ] Invariant cache hit.
[2023-03-08 02:26:36] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/347 places, 264/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 802 ms. Remains : 155/347 places, 264/672 transitions.
Support contains 33 out of 155 places after structural reductions.
[2023-03-08 02:26:36] [INFO ] Flatten gal took : 48 ms
[2023-03-08 02:26:36] [INFO ] Flatten gal took : 22 ms
[2023-03-08 02:26:36] [INFO ] Input system was already deterministic with 264 transitions.
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 27) seen :4
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 64 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-08 02:26:37] [INFO ] Invariant cache hit.
[2023-03-08 02:26:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:26:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-08 02:26:38] [INFO ] After 1042ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:20
[2023-03-08 02:26:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:26:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 02:26:39] [INFO ] After 686ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :20
[2023-03-08 02:26:39] [INFO ] State equation strengthened by 122 read => feed constraints.
[2023-03-08 02:26:40] [INFO ] After 1056ms SMT Verify possible using 122 Read/Feed constraints in natural domain returned unsat :3 sat :20
[2023-03-08 02:26:42] [INFO ] After 2254ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :20
Attempting to minimize the solution found.
Minimization took 985 ms.
[2023-03-08 02:26:43] [INFO ] After 4101ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :20
Fused 23 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 192 ms.
Support contains 22 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 264/264 transitions.
Graph (complete) has 524 edges and 155 vertex of which 154 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 154 transition count 261
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 148 transition count 251
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 148 transition count 251
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 19 place count 148 transition count 248
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 146 transition count 246
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 146 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 146 transition count 244
Applied a total of 25 rules in 34 ms. Remains 146 /155 variables (removed 9) and now considering 244/264 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 146/155 places, 244/264 transitions.
Incomplete random walk after 10000 steps, including 2270 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Finished probabilistic random walk after 328191 steps, run visited all 20 properties in 647 ms. (steps per millisecond=507 )
Probabilistic random walk after 328191 steps, saw 131604 distinct states, run finished after 647 ms. (steps per millisecond=507 ) properties seen :20
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 22 stable transitions
Graph (complete) has 573 edges and 155 vertex of which 154 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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)&&F(!p0))))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 132 transition count 201
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 132 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 132 transition count 199
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 114 transition count 178
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 114 transition count 178
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 114 transition count 172
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 103 place count 101 transition count 148
Iterating global reduction 2 with 13 rules applied. Total rules applied 116 place count 101 transition count 148
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 124 place count 101 transition count 140
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 132 place count 93 transition count 122
Iterating global reduction 3 with 8 rules applied. Total rules applied 140 place count 93 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 93 transition count 121
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 147 place count 87 transition count 115
Iterating global reduction 4 with 6 rules applied. Total rules applied 153 place count 87 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 156 place count 87 transition count 112
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 159 place count 84 transition count 108
Iterating global reduction 5 with 3 rules applied. Total rules applied 162 place count 84 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 163 place count 84 transition count 107
Applied a total of 163 rules in 13 ms. Remains 84 /155 variables (removed 71) and now considering 107/264 (removed 157) transitions.
// Phase 1: matrix 107 rows 84 cols
[2023-03-08 02:26:44] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 02:26:44] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 02:26:44] [INFO ] Invariant cache hit.
[2023-03-08 02:26:44] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 02:26:44] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-08 02:26:44] [INFO ] Invariant cache hit.
[2023-03-08 02:26:45] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/155 places, 107/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 84/155 places, 107/264 transitions.
Stuttering acceptance computed with spot in 230 ms :[p0, (NOT p0), true, true]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s60 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 6 steps with 0 reset in 4 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-00 finished in 776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 132 transition count 201
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 132 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 132 transition count 199
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 114 transition count 178
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 114 transition count 178
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 114 transition count 172
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 103 place count 101 transition count 148
Iterating global reduction 2 with 13 rules applied. Total rules applied 116 place count 101 transition count 148
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 124 place count 101 transition count 140
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 132 place count 93 transition count 122
Iterating global reduction 3 with 8 rules applied. Total rules applied 140 place count 93 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 93 transition count 121
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 147 place count 87 transition count 115
Iterating global reduction 4 with 6 rules applied. Total rules applied 153 place count 87 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 156 place count 87 transition count 112
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 159 place count 84 transition count 108
Iterating global reduction 5 with 3 rules applied. Total rules applied 162 place count 84 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 163 place count 84 transition count 107
Applied a total of 163 rules in 36 ms. Remains 84 /155 variables (removed 71) and now considering 107/264 (removed 157) transitions.
[2023-03-08 02:26:45] [INFO ] Invariant cache hit.
[2023-03-08 02:26:45] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 02:26:45] [INFO ] Invariant cache hit.
[2023-03-08 02:26:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 02:26:45] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-08 02:26:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 02:26:45] [INFO ] Invariant cache hit.
[2023-03-08 02:26:45] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/155 places, 107/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 549 ms. Remains : 84/155 places, 107/264 transitions.
Stuttering acceptance computed with spot in 38 ms :[p0]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22916 reset in 268 ms.
Product exploration explored 100000 steps with 22967 reset in 160 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p0]
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 467 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16958 steps, run visited all 1 properties in 78 ms. (steps per millisecond=217 )
Probabilistic random walk after 16958 steps, saw 8081 distinct states, run finished after 79 ms. (steps per millisecond=214 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-08 02:26:46] [INFO ] Invariant cache hit.
[2023-03-08 02:26:46] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 02:26:46] [INFO ] Invariant cache hit.
[2023-03-08 02:26:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 02:26:46] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-08 02:26:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:26:47] [INFO ] Invariant cache hit.
[2023-03-08 02:26:47] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 84/84 places, 107/107 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 662 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[p0]
Incomplete random walk after 10000 steps, including 2304 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 479 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16958 steps, run visited all 1 properties in 26 ms. (steps per millisecond=652 )
Probabilistic random walk after 16958 steps, saw 8081 distinct states, run finished after 27 ms. (steps per millisecond=628 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
Stuttering acceptance computed with spot in 36 ms :[p0]
Product exploration explored 100000 steps with 22948 reset in 105 ms.
Product exploration explored 100000 steps with 22965 reset in 108 ms.
Built C files in :
/tmp/ltsmin875650618743869601
[2023-03-08 02:26:49] [INFO ] Computing symmetric may disable matrix : 107 transitions.
[2023-03-08 02:26:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 02:26:49] [INFO ] Computing symmetric may enable matrix : 107 transitions.
[2023-03-08 02:26:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 02:26:49] [INFO ] Computing Do-Not-Accords matrix : 107 transitions.
[2023-03-08 02:26:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 02:26:49] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin875650618743869601
Running compilation step : cd /tmp/ltsmin875650618743869601;'/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 335 ms.
Running link step : cd /tmp/ltsmin875650618743869601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin875650618743869601;'/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/stateBased17040753252749185251.hoa' '--buchi-type=spotba'
LTSmin run took 178 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-01 finished in 4296 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 X(G(p1))) U X(G((F(!p1)||X(X(!p0)))))))'
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 131 transition count 194
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 131 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 131 transition count 192
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 113 transition count 171
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 113 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 92 place count 113 transition count 165
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 105 place count 100 transition count 141
Iterating global reduction 2 with 13 rules applied. Total rules applied 118 place count 100 transition count 141
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 125 place count 100 transition count 134
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 132 place count 93 transition count 117
Iterating global reduction 3 with 7 rules applied. Total rules applied 139 place count 93 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 93 transition count 116
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 145 place count 88 transition count 111
Iterating global reduction 4 with 5 rules applied. Total rules applied 150 place count 88 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 152 place count 88 transition count 109
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 155 place count 85 transition count 105
Iterating global reduction 5 with 3 rules applied. Total rules applied 158 place count 85 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 85 transition count 104
Applied a total of 159 rules in 12 ms. Remains 85 /155 variables (removed 70) and now considering 104/264 (removed 160) transitions.
// Phase 1: matrix 104 rows 85 cols
[2023-03-08 02:26:49] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 02:26:49] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 02:26:49] [INFO ] Invariant cache hit.
[2023-03-08 02:26:49] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 02:26:49] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-08 02:26:49] [INFO ] Invariant cache hit.
[2023-03-08 02:26:49] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/155 places, 104/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 85/155 places, 104/264 transitions.
Stuttering acceptance computed with spot in 355 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=true, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 6}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p1), acceptance={0} source=7 dest: 4}, { cond=(AND p0 p1), acceptance={} source=7 dest: 9}], [{ cond=p1, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 9}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s73 1)), p1:(AND (GEQ s1 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22954 reset in 205 ms.
Product exploration explored 100000 steps with 22945 reset in 117 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 289 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 02:26:51] [INFO ] Invariant cache hit.
[2023-03-08 02:26:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:26:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 02:26:51] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 02:26:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:26:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 02:26:51] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 02:26:51] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 02:26:51] [INFO ] After 20ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 02:26:51] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 02:26:51] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Graph (complete) has 264 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 84 transition count 102
Applied a total of 3 rules in 4 ms. Remains 84 /85 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 84/85 places, 102/104 transitions.
Finished random walk after 9637 steps, including 2176 resets, run visited all 1 properties in 13 ms. (steps per millisecond=741 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1)), (F p0), (F p1)]
Knowledge based reduction with 6 factoid took 339 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 1495 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2023-03-08 02:26:53] [INFO ] Invariant cache hit.
[2023-03-08 02:26:53] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 02:26:53] [INFO ] Invariant cache hit.
[2023-03-08 02:26:53] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 02:26:53] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-08 02:26:53] [INFO ] Invariant cache hit.
[2023-03-08 02:26:53] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 85/85 places, 104/104 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 311 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 508 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 02:26:54] [INFO ] Invariant cache hit.
[2023-03-08 02:26:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:26:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 02:26:54] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 02:26:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 02:26:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 02:26:54] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 02:26:54] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 02:26:54] [INFO ] After 12ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 02:26:54] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 02:26:54] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Graph (complete) has 264 edges and 85 vertex of which 84 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 84 transition count 102
Applied a total of 3 rules in 5 ms. Remains 84 /85 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 84/85 places, 102/104 transitions.
Incomplete random walk after 10000 steps, including 2308 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 466 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4296 steps, run visited all 1 properties in 8 ms. (steps per millisecond=537 )
Probabilistic random walk after 4296 steps, saw 1997 distinct states, run finished after 8 ms. (steps per millisecond=537 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1)), (F p0), (F p1)]
Knowledge based reduction with 6 factoid took 379 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 335 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 351 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Product exploration explored 100000 steps with 23079 reset in 107 ms.
Product exploration explored 100000 steps with 22928 reset in 120 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 341 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2023-03-08 02:26:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:26:56] [INFO ] Invariant cache hit.
[2023-03-08 02:26:56] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 85/85 places, 104/104 transitions.
Built C files in :
/tmp/ltsmin14496314321080103517
[2023-03-08 02:26:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14496314321080103517
Running compilation step : cd /tmp/ltsmin14496314321080103517;'/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 282 ms.
Running link step : cd /tmp/ltsmin14496314321080103517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14496314321080103517;'/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/stateBased9807215859136408117.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2023-03-08 02:27:12] [INFO ] Invariant cache hit.
[2023-03-08 02:27:12] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 02:27:12] [INFO ] Invariant cache hit.
[2023-03-08 02:27:12] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 02:27:12] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-08 02:27:12] [INFO ] Invariant cache hit.
[2023-03-08 02:27:12] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 85/85 places, 104/104 transitions.
Built C files in :
/tmp/ltsmin1290947267268562890
[2023-03-08 02:27:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1290947267268562890
Running compilation step : cd /tmp/ltsmin1290947267268562890;'/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 193 ms.
Running link step : cd /tmp/ltsmin1290947267268562890;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1290947267268562890;'/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/stateBased10919402991139285034.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 02:27:27] [INFO ] Flatten gal took : 7 ms
[2023-03-08 02:27:27] [INFO ] Flatten gal took : 6 ms
[2023-03-08 02:27:27] [INFO ] Time to serialize gal into /tmp/LTL7648812383054420997.gal : 2 ms
[2023-03-08 02:27:27] [INFO ] Time to serialize properties into /tmp/LTL16099162241747674183.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/LTL7648812383054420997.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1725535199763629230.hoa' '-atoms' '/tmp/LTL16099162241747674183.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/LTL16099162241747674183.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1725535199763629230.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t52, t59, t69, t70, t123, t176, t205, t206, t208, t209, t210, t211, t21...407
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
[2023-03-08 02:27:42] [INFO ] Flatten gal took : 6 ms
[2023-03-08 02:27:42] [INFO ] Flatten gal took : 6 ms
[2023-03-08 02:27:42] [INFO ] Time to serialize gal into /tmp/LTL14352298778112990825.gal : 2 ms
[2023-03-08 02:27:42] [INFO ] Time to serialize properties into /tmp/LTL4498118398695711181.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/LTL14352298778112990825.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4498118398695711181.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 : !(((("((s1>=1)&&(l954>=1))")U(X(G("((s1>=1)&&(l955>=1))"))))U(X(G((F(!("((s1>=1)&&(l955>=1))")))||(X(X(!("((s1>=1)&&(l954>=1))")))))))...157
Formula 0 simplified : (!"((s1>=1)&&(l954>=1))" R XF!"((s1>=1)&&(l955>=1))") R XF(G"((s1>=1)&&(l955>=1))" & XX"((s1>=1)&&(l954>=1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t52, t59, t69, t70, t123, t176, t205, t206, t208, t209, t210, t211, t21...407
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
[2023-03-08 02:27:57] [INFO ] Flatten gal took : 5 ms
[2023-03-08 02:27:57] [INFO ] Applying decomposition
[2023-03-08 02:27:57] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4914888092675076168.txt' '-o' '/tmp/graph4914888092675076168.bin' '-w' '/tmp/graph4914888092675076168.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4914888092675076168.bin' '-l' '-1' '-v' '-w' '/tmp/graph4914888092675076168.weights' '-q' '0' '-e' '0.001'
[2023-03-08 02:27:59] [INFO ] Decomposing Gal with order
[2023-03-08 02:27:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 02:27:59] [INFO ] Removed a total of 109 redundant transitions.
[2023-03-08 02:27:59] [INFO ] Flatten gal took : 35 ms
[2023-03-08 02:27:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 8 ms.
[2023-03-08 02:27:59] [INFO ] Time to serialize gal into /tmp/LTL12394176542738840470.gal : 3 ms
[2023-03-08 02:27:59] [INFO ] Time to serialize properties into /tmp/LTL3188132423479086284.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/LTL12394176542738840470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3188132423479086284.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 : !(((("((i5.u1.s1>=1)&&(i0.u0.l954>=1))")U(X(G("((i5.u1.s1>=1)&&(i5.u18.l955>=1))"))))U(X(G((F(!("((i5.u1.s1>=1)&&(i5.u18.l955>=1))")))...207
Formula 0 simplified : (!"((i5.u1.s1>=1)&&(i0.u0.l954>=1))" R XF!"((i5.u1.s1>=1)&&(i5.u18.l955>=1))") R XF(G"((i5.u1.s1>=1)&&(i5.u18.l955>=1))" & XX"((i5.u...183
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11509744211242499935
[2023-03-08 02:28:14] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11509744211242499935
Running compilation step : cd /tmp/ltsmin11509744211242499935;'/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 218 ms.
Running link step : cd /tmp/ltsmin11509744211242499935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11509744211242499935;'/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) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-02 finished in 99711 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(p1))&&p0)))'
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 133 transition count 198
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 133 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 133 transition count 196
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 61 place count 118 transition count 178
Iterating global reduction 1 with 15 rules applied. Total rules applied 76 place count 118 transition count 178
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 118 transition count 172
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 93 place count 107 transition count 154
Iterating global reduction 2 with 11 rules applied. Total rules applied 104 place count 107 transition count 154
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 110 place count 107 transition count 148
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 116 place count 101 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 122 place count 101 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 101 transition count 130
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 128 place count 97 transition count 126
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 97 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 97 transition count 124
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 137 place count 94 transition count 120
Iterating global reduction 5 with 3 rules applied. Total rules applied 140 place count 94 transition count 120
Applied a total of 140 rules in 17 ms. Remains 94 /155 variables (removed 61) and now considering 120/264 (removed 144) transitions.
// Phase 1: matrix 120 rows 94 cols
[2023-03-08 02:28:29] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 02:28:29] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 02:28:29] [INFO ] Invariant cache hit.
[2023-03-08 02:28:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 02:28:29] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-08 02:28:29] [INFO ] Invariant cache hit.
[2023-03-08 02:28:29] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/155 places, 120/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 94/155 places, 120/264 transitions.
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s89 1) (OR (LT s1 1) (LT s87 1))), p1:(OR (LT s1 1) (LT s87 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-04 finished in 724 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((X(p0)||G(p1))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 132 transition count 197
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 132 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 132 transition count 195
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 115 transition count 175
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 115 transition count 175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 88 place count 115 transition count 169
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 103 transition count 147
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 103 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 103 transition count 141
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 124 place count 97 transition count 126
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 97 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 97 transition count 124
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 136 place count 93 transition count 120
Iterating global reduction 4 with 4 rules applied. Total rules applied 140 place count 93 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 93 transition count 119
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 143 place count 91 transition count 116
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 91 transition count 116
Applied a total of 145 rules in 16 ms. Remains 91 /155 variables (removed 64) and now considering 116/264 (removed 148) transitions.
// Phase 1: matrix 116 rows 91 cols
[2023-03-08 02:28:30] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 02:28:30] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 02:28:30] [INFO ] Invariant cache hit.
[2023-03-08 02:28:30] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 02:28:30] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-08 02:28:30] [INFO ] Invariant cache hit.
[2023-03-08 02:28:30] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/155 places, 116/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 91/155 places, 116/264 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s73 1) (LT s1 1) (LT s86 1)), p0:(AND (GEQ s1 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 22994 reset in 135 ms.
Product exploration explored 100000 steps with 23038 reset in 138 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 309 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 485 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 02:28:31] [INFO ] Invariant cache hit.
[2023-03-08 02:28:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:28:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 02:28:31] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 02:28:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:28:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 02:28:31] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 02:28:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 02:28:31] [INFO ] After 22ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 02:28:31] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 02:28:31] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 116/116 transitions.
Graph (complete) has 285 edges and 91 vertex of which 90 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 114
Applied a total of 3 rules in 16 ms. Remains 90 /91 variables (removed 1) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 90/91 places, 114/116 transitions.
Incomplete random walk after 10000 steps, including 2317 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 437 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 33590 steps, run visited all 1 properties in 51 ms. (steps per millisecond=658 )
Probabilistic random walk after 33590 steps, saw 15133 distinct states, run finished after 51 ms. (steps per millisecond=658 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 1186 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-08 02:28:32] [INFO ] Invariant cache hit.
[2023-03-08 02:28:32] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 02:28:32] [INFO ] Invariant cache hit.
[2023-03-08 02:28:32] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 02:28:32] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-08 02:28:32] [INFO ] Invariant cache hit.
[2023-03-08 02:28:32] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 91/91 places, 116/116 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 309 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 02:28:33] [INFO ] Invariant cache hit.
[2023-03-08 02:28:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:28:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 02:28:33] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 02:28:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:28:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 02:28:33] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 02:28:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 02:28:33] [INFO ] After 21ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 02:28:33] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 02:28:33] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 116/116 transitions.
Graph (complete) has 285 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 114
Applied a total of 3 rules in 23 ms. Remains 90 /91 variables (removed 1) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 90/91 places, 114/116 transitions.
Incomplete random walk after 10000 steps, including 2283 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished probabilistic random walk after 33590 steps, run visited all 1 properties in 81 ms. (steps per millisecond=414 )
Probabilistic random walk after 33590 steps, saw 15133 distinct states, run finished after 82 ms. (steps per millisecond=409 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 1178 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22950 reset in 130 ms.
Product exploration explored 100000 steps with 22964 reset in 136 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 91 /91 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-08 02:28:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:28:35] [INFO ] Invariant cache hit.
[2023-03-08 02:28:35] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 91/91 places, 116/116 transitions.
Built C files in :
/tmp/ltsmin12978635954532668996
[2023-03-08 02:28:35] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12978635954532668996
Running compilation step : cd /tmp/ltsmin12978635954532668996;'/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 204 ms.
Running link step : cd /tmp/ltsmin12978635954532668996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12978635954532668996;'/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/stateBased850715963522300409.hoa' '--buchi-type=spotba'
LTSmin run took 349 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-05 finished in 6101 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((p0 U (X(p1) U p2))))'
Support contains 5 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 134 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 134 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 134 transition count 201
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 59 place count 119 transition count 185
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 119 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 119 transition count 181
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 109 transition count 162
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 109 transition count 162
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 105 place count 109 transition count 155
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 110 place count 104 transition count 141
Iterating global reduction 3 with 5 rules applied. Total rules applied 115 place count 104 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 100 transition count 137
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 100 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 100 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 126 place count 98 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 128 place count 98 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 98 transition count 133
Applied a total of 129 rules in 9 ms. Remains 98 /155 variables (removed 57) and now considering 133/264 (removed 131) transitions.
// Phase 1: matrix 133 rows 98 cols
[2023-03-08 02:28:36] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 02:28:36] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 02:28:36] [INFO ] Invariant cache hit.
[2023-03-08 02:28:36] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 02:28:36] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-08 02:28:36] [INFO ] Invariant cache hit.
[2023-03-08 02:28:36] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/155 places, 133/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 98/155 places, 133/264 transitions.
Stuttering acceptance computed with spot in 1207 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s92 1)), p0:(AND (GEQ s1 1) (GEQ s89 1)), p1:(OR (AND (GEQ s1 1) (GEQ s89 1)) (AND (GEQ s17 1) (GEQ s76 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-06 finished in 1505 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(p1)&&p0) U (p2 U X(p3))))'
Support contains 6 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 135 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 135 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 135 transition count 208
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 120 transition count 191
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 120 transition count 191
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 77 place count 120 transition count 186
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 109 transition count 165
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 109 transition count 165
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 106 place count 109 transition count 158
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 112 place count 103 transition count 145
Iterating global reduction 3 with 6 rules applied. Total rules applied 118 place count 103 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 103 transition count 143
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 124 place count 99 transition count 139
Iterating global reduction 4 with 4 rules applied. Total rules applied 128 place count 99 transition count 139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 131 place count 99 transition count 136
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 133 place count 97 transition count 133
Iterating global reduction 5 with 2 rules applied. Total rules applied 135 place count 97 transition count 133
Applied a total of 135 rules in 12 ms. Remains 97 /155 variables (removed 58) and now considering 133/264 (removed 131) transitions.
// Phase 1: matrix 133 rows 97 cols
[2023-03-08 02:28:37] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 02:28:37] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 02:28:37] [INFO ] Invariant cache hit.
[2023-03-08 02:28:37] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 02:28:37] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-08 02:28:37] [INFO ] Invariant cache hit.
[2023-03-08 02:28:37] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/155 places, 133/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 97/155 places, 133/264 transitions.
Stuttering acceptance computed with spot in 734 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p2 (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s65 1)), p0:(AND (GEQ s1 1) (GEQ s92 1)), p1:(AND (GEQ s1 1) (GEQ s89 1)), p3:(AND (GEQ s25 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-07 finished in 1054 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(p1))&&p0) U (p1||X(X(F(p2))))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 134 transition count 205
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 134 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 134 transition count 203
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 118 transition count 184
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 118 transition count 184
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 118 transition count 178
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 93 place count 107 transition count 156
Iterating global reduction 2 with 11 rules applied. Total rules applied 104 place count 107 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 111 place count 107 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 116 place count 102 transition count 143
Iterating global reduction 3 with 5 rules applied. Total rules applied 121 place count 102 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 102 transition count 142
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 126 place count 98 transition count 138
Iterating global reduction 4 with 4 rules applied. Total rules applied 130 place count 98 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 133 place count 98 transition count 135
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 134 place count 97 transition count 133
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 97 transition count 133
Applied a total of 135 rules in 12 ms. Remains 97 /155 variables (removed 58) and now considering 133/264 (removed 131) transitions.
// Phase 1: matrix 133 rows 97 cols
[2023-03-08 02:28:38] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 02:28:38] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 02:28:38] [INFO ] Invariant cache hit.
[2023-03-08 02:28:38] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 02:28:38] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-08 02:28:38] [INFO ] Invariant cache hit.
[2023-03-08 02:28:39] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/155 places, 133/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 97/155 places, 133/264 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s94 1)), p0:(AND (GEQ s1 1) (GEQ s57 1)), p2:(AND (GEQ s1 1) (GEQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-08 finished in 495 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((X(X(G((F(p2)&&p1))))&&p0)))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 134 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 134 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 134 transition count 201
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 59 place count 119 transition count 183
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 119 transition count 183
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 119 transition count 179
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 109 transition count 161
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 109 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 103 place count 109 transition count 156
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 104 transition count 147
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 104 transition count 147
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 99 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 99 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 99 transition count 141
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 127 place count 96 transition count 137
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 96 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 131 place count 96 transition count 136
Applied a total of 131 rules in 13 ms. Remains 96 /155 variables (removed 59) and now considering 136/264 (removed 128) transitions.
// Phase 1: matrix 136 rows 96 cols
[2023-03-08 02:28:39] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 02:28:39] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 02:28:39] [INFO ] Invariant cache hit.
[2023-03-08 02:28:39] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-08 02:28:39] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-08 02:28:39] [INFO ] Invariant cache hit.
[2023-03-08 02:28:39] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/155 places, 136/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 96/155 places, 136/264 transitions.
Stuttering acceptance computed with spot in 568 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1)), p1:(AND (GEQ s1 1) (GEQ s60 1)), p2:(OR (LT s1 1) (LT s90 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 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-10 finished in 865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 132 transition count 199
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 132 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 132 transition count 197
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 115 transition count 177
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 115 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 86 place count 115 transition count 173
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 98 place count 103 transition count 151
Iterating global reduction 2 with 12 rules applied. Total rules applied 110 place count 103 transition count 151
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 117 place count 103 transition count 144
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 124 place count 96 transition count 128
Iterating global reduction 3 with 7 rules applied. Total rules applied 131 place count 96 transition count 128
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 137 place count 90 transition count 122
Iterating global reduction 3 with 6 rules applied. Total rules applied 143 place count 90 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 146 place count 90 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 149 place count 87 transition count 115
Iterating global reduction 4 with 3 rules applied. Total rules applied 152 place count 87 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 153 place count 87 transition count 114
Applied a total of 153 rules in 15 ms. Remains 87 /155 variables (removed 68) and now considering 114/264 (removed 150) transitions.
// Phase 1: matrix 114 rows 87 cols
[2023-03-08 02:28:40] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 02:28:40] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 02:28:40] [INFO ] Invariant cache hit.
[2023-03-08 02:28:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 02:28:40] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-08 02:28:40] [INFO ] Invariant cache hit.
[2023-03-08 02:28:40] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/155 places, 114/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 87/155 places, 114/264 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (GEQ s1 1) (GEQ s78 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-11 finished in 464 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(p0))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 132 transition count 203
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 132 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 132 transition count 200
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 114 transition count 179
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 114 transition count 179
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 92 place count 114 transition count 172
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 105 place count 101 transition count 148
Iterating global reduction 2 with 13 rules applied. Total rules applied 118 place count 101 transition count 148
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 126 place count 101 transition count 140
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 134 place count 93 transition count 122
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 93 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 93 transition count 121
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 149 place count 87 transition count 115
Iterating global reduction 4 with 6 rules applied. Total rules applied 155 place count 87 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 158 place count 87 transition count 112
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 161 place count 84 transition count 108
Iterating global reduction 5 with 3 rules applied. Total rules applied 164 place count 84 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 165 place count 84 transition count 107
Applied a total of 165 rules in 25 ms. Remains 84 /155 variables (removed 71) and now considering 107/264 (removed 157) transitions.
// Phase 1: matrix 107 rows 84 cols
[2023-03-08 02:28:40] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 02:28:40] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 02:28:40] [INFO ] Invariant cache hit.
[2023-03-08 02:28:40] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 02:28:40] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-08 02:28:40] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:28:40] [INFO ] Invariant cache hit.
[2023-03-08 02:28:40] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/155 places, 107/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 84/155 places, 107/264 transitions.
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-13 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}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23051 reset in 115 ms.
Product exploration explored 100000 steps with 22960 reset in 117 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 15499 steps, run visited all 1 properties in 21 ms. (steps per millisecond=738 )
Probabilistic random walk after 15499 steps, saw 7368 distinct states, run finished after 22 ms. (steps per millisecond=704 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-13 finished in 867 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 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 132 transition count 203
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 132 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 132 transition count 200
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 114 transition count 179
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 114 transition count 179
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 92 place count 114 transition count 172
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 105 place count 101 transition count 148
Iterating global reduction 2 with 13 rules applied. Total rules applied 118 place count 101 transition count 148
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 126 place count 101 transition count 140
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 134 place count 93 transition count 122
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 93 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 93 transition count 121
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 149 place count 87 transition count 115
Iterating global reduction 4 with 6 rules applied. Total rules applied 155 place count 87 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 158 place count 87 transition count 112
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 161 place count 84 transition count 108
Iterating global reduction 5 with 3 rules applied. Total rules applied 164 place count 84 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 165 place count 84 transition count 107
Applied a total of 165 rules in 22 ms. Remains 84 /155 variables (removed 71) and now considering 107/264 (removed 157) transitions.
[2023-03-08 02:28:41] [INFO ] Invariant cache hit.
[2023-03-08 02:28:41] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 02:28:41] [INFO ] Invariant cache hit.
[2023-03-08 02:28:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 02:28:41] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-08 02:28:41] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 02:28:41] [INFO ] Invariant cache hit.
[2023-03-08 02:28:41] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/155 places, 107/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 84/155 places, 107/264 transitions.
Stuttering acceptance computed with spot in 116 ms :[p0]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s60 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 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-14 finished in 382 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(p0)||p1) U p1)))'
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 133 transition count 202
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 133 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 133 transition count 200
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 63 place count 116 transition count 180
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 116 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 86 place count 116 transition count 174
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 98 place count 104 transition count 151
Iterating global reduction 2 with 12 rules applied. Total rules applied 110 place count 104 transition count 151
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 116 place count 104 transition count 145
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 123 place count 97 transition count 133
Iterating global reduction 3 with 7 rules applied. Total rules applied 130 place count 97 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 97 transition count 132
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 137 place count 91 transition count 126
Iterating global reduction 4 with 6 rules applied. Total rules applied 143 place count 91 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 146 place count 91 transition count 123
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 149 place count 88 transition count 119
Iterating global reduction 5 with 3 rules applied. Total rules applied 152 place count 88 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 153 place count 88 transition count 118
Applied a total of 153 rules in 15 ms. Remains 88 /155 variables (removed 67) and now considering 118/264 (removed 146) transitions.
// Phase 1: matrix 118 rows 88 cols
[2023-03-08 02:28:41] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 02:28:41] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 02:28:41] [INFO ] Invariant cache hit.
[2023-03-08 02:28:41] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 02:28:42] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-08 02:28:42] [INFO ] Invariant cache hit.
[2023-03-08 02:28:42] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/155 places, 118/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 88/155 places, 118/264 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s64 1)), p0:(AND (GEQ s1 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-15 finished in 392 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 X(G(p1))) U X(G((F(!p1)||X(X(!p0)))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m08-LTLFireability-02
Stuttering acceptance computed with spot in 381 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 155/155 places, 264/264 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 131 transition count 194
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 131 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 131 transition count 192
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 113 transition count 171
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 113 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 92 place count 113 transition count 165
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 105 place count 100 transition count 141
Iterating global reduction 2 with 13 rules applied. Total rules applied 118 place count 100 transition count 141
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 125 place count 100 transition count 134
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 132 place count 93 transition count 117
Iterating global reduction 3 with 7 rules applied. Total rules applied 139 place count 93 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 93 transition count 116
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 145 place count 88 transition count 111
Iterating global reduction 4 with 5 rules applied. Total rules applied 150 place count 88 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 152 place count 88 transition count 109
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 155 place count 85 transition count 105
Iterating global reduction 5 with 3 rules applied. Total rules applied 158 place count 85 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 85 transition count 104
Applied a total of 159 rules in 20 ms. Remains 85 /155 variables (removed 70) and now considering 104/264 (removed 160) transitions.
// Phase 1: matrix 104 rows 85 cols
[2023-03-08 02:28:42] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 02:28:42] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 02:28:42] [INFO ] Invariant cache hit.
[2023-03-08 02:28:42] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 02:28:42] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-08 02:28:42] [INFO ] Invariant cache hit.
[2023-03-08 02:28:42] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 85/155 places, 104/264 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 241 ms. Remains : 85/155 places, 104/264 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=true, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 6}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p1), acceptance={0} source=7 dest: 4}, { cond=(AND p0 p1), acceptance={} source=7 dest: 9}], [{ cond=p1, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 9}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s73 1)), p1:(AND (GEQ s1 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22939 reset in 111 ms.
Product exploration explored 100000 steps with 22948 reset in 122 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 308 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 02:28:43] [INFO ] Invariant cache hit.
[2023-03-08 02:28:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:28:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 02:28:43] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 02:28:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:28:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 02:28:44] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 02:28:44] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 02:28:44] [INFO ] After 11ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 02:28:44] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 02:28:44] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Graph (complete) has 264 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 84 transition count 102
Applied a total of 3 rules in 7 ms. Remains 84 /85 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 84/85 places, 102/104 transitions.
Finished random walk after 4478 steps, including 1000 resets, run visited all 1 properties in 6 ms. (steps per millisecond=746 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1)), (F p0), (F p1)]
Knowledge based reduction with 6 factoid took 378 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 301 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2023-03-08 02:28:45] [INFO ] Invariant cache hit.
[2023-03-08 02:28:45] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 02:28:45] [INFO ] Invariant cache hit.
[2023-03-08 02:28:45] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 02:28:45] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-08 02:28:45] [INFO ] Invariant cache hit.
[2023-03-08 02:28:45] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 85/85 places, 104/104 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 475 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 02:28:46] [INFO ] Invariant cache hit.
[2023-03-08 02:28:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:28:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 02:28:46] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 02:28:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-08 02:28:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 02:28:46] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 02:28:46] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 02:28:46] [INFO ] After 10ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 02:28:46] [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 24 ms.
[2023-03-08 02:28:46] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Graph (complete) has 264 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 84 transition count 102
Applied a total of 3 rules in 2 ms. Remains 84 /85 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/85 places, 102/104 transitions.
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4296 steps, run visited all 1 properties in 8 ms. (steps per millisecond=537 )
Probabilistic random walk after 4296 steps, saw 1997 distinct states, run finished after 8 ms. (steps per millisecond=537 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1)), (F p0), (F p1)]
Knowledge based reduction with 6 factoid took 1198 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 314 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 626 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Product exploration explored 100000 steps with 22858 reset in 112 ms.
Product exploration explored 100000 steps with 22940 reset in 127 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 310 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2023-03-08 02:28:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:28:49] [INFO ] Invariant cache hit.
[2023-03-08 02:28:49] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 85/85 places, 104/104 transitions.
Built C files in :
/tmp/ltsmin11321984138290994840
[2023-03-08 02:28:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11321984138290994840
Running compilation step : cd /tmp/ltsmin11321984138290994840;'/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 168 ms.
Running link step : cd /tmp/ltsmin11321984138290994840;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11321984138290994840;'/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/stateBased12576878592490713770.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2023-03-08 02:29:04] [INFO ] Invariant cache hit.
[2023-03-08 02:29:04] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 02:29:04] [INFO ] Invariant cache hit.
[2023-03-08 02:29:04] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 02:29:04] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-08 02:29:04] [INFO ] Invariant cache hit.
[2023-03-08 02:29:04] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 85/85 places, 104/104 transitions.
Built C files in :
/tmp/ltsmin4826026286837959439
[2023-03-08 02:29:04] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4826026286837959439
Running compilation step : cd /tmp/ltsmin4826026286837959439;'/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 200 ms.
Running link step : cd /tmp/ltsmin4826026286837959439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4826026286837959439;'/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/stateBased11922438725465576256.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 02:29:20] [INFO ] Flatten gal took : 6 ms
[2023-03-08 02:29:20] [INFO ] Flatten gal took : 6 ms
[2023-03-08 02:29:20] [INFO ] Time to serialize gal into /tmp/LTL11942334239330116624.gal : 1 ms
[2023-03-08 02:29:20] [INFO ] Time to serialize properties into /tmp/LTL14185138726999728817.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/LTL11942334239330116624.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6439973675127152345.hoa' '-atoms' '/tmp/LTL14185138726999728817.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/LTL14185138726999728817.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6439973675127152345.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t52, t59, t69, t70, t123, t176, t205, t206, t208, t209, t210, t211, t21...407
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
[2023-03-08 02:29:35] [INFO ] Flatten gal took : 6 ms
[2023-03-08 02:29:35] [INFO ] Flatten gal took : 5 ms
[2023-03-08 02:29:35] [INFO ] Time to serialize gal into /tmp/LTL11339382939431425530.gal : 2 ms
[2023-03-08 02:29:35] [INFO ] Time to serialize properties into /tmp/LTL12780595894530562588.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/LTL11339382939431425530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12780595894530562588.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...277
Read 1 LTL properties
Checking formula 0 : !(((("((s1>=1)&&(l954>=1))")U(X(G("((s1>=1)&&(l955>=1))"))))U(X(G((F(!("((s1>=1)&&(l955>=1))")))||(X(X(!("((s1>=1)&&(l954>=1))")))))))...157
Formula 0 simplified : (!"((s1>=1)&&(l954>=1))" R XF!"((s1>=1)&&(l955>=1))") R XF(G"((s1>=1)&&(l955>=1))" & XX"((s1>=1)&&(l954>=1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t52, t59, t69, t70, t123, t176, t205, t206, t208, t209, t210, t211, t21...407
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
[2023-03-08 02:29:50] [INFO ] Flatten gal took : 5 ms
[2023-03-08 02:29:50] [INFO ] Applying decomposition
[2023-03-08 02:29:50] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10094147319511938082.txt' '-o' '/tmp/graph10094147319511938082.bin' '-w' '/tmp/graph10094147319511938082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10094147319511938082.bin' '-l' '-1' '-v' '-w' '/tmp/graph10094147319511938082.weights' '-q' '0' '-e' '0.001'
[2023-03-08 02:29:50] [INFO ] Decomposing Gal with order
[2023-03-08 02:29:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 02:29:50] [INFO ] Removed a total of 96 redundant transitions.
[2023-03-08 02:29:50] [INFO ] Flatten gal took : 12 ms
[2023-03-08 02:29:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 3 ms.
[2023-03-08 02:29:50] [INFO ] Time to serialize gal into /tmp/LTL14670392915527985069.gal : 2 ms
[2023-03-08 02:29:50] [INFO ] Time to serialize properties into /tmp/LTL9219117785365123224.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/LTL14670392915527985069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9219117785365123224.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 : !(((("((u0.s1>=1)&&(i5.u12.l954>=1))")U(X(G("((u0.s1>=1)&&(i2.u17.l955>=1))"))))U(X(G((F(!("((u0.s1>=1)&&(i2.u17.l955>=1))")))||(X(X(!...197
Formula 0 simplified : (!"((u0.s1>=1)&&(i5.u12.l954>=1))" R XF!"((u0.s1>=1)&&(i2.u17.l955>=1))") R XF(G"((u0.s1>=1)&&(i2.u17.l955>=1))" & XX"((u0.s1>=1)&&(...173
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t11, t52, t59, t70, t123, t176, t205, t206, t208, t210, t211, t215, t216, t217, t218,...405
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4739363484521546671
[2023-03-08 02:30:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4739363484521546671
Running compilation step : cd /tmp/ltsmin4739363484521546671;'/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 181 ms.
Running link step : cd /tmp/ltsmin4739363484521546671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4739363484521546671;'/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) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-02 finished in 98153 ms.
[2023-03-08 02:30:20] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8728708078556398270
[2023-03-08 02:30:20] [INFO ] Computing symmetric may disable matrix : 264 transitions.
[2023-03-08 02:30:20] [INFO ] Applying decomposition
[2023-03-08 02:30:20] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 02:30:20] [INFO ] Computing symmetric may enable matrix : 264 transitions.
[2023-03-08 02:30:20] [INFO ] Flatten gal took : 12 ms
[2023-03-08 02:30:20] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12112229343307759301.txt' '-o' '/tmp/graph12112229343307759301.bin' '-w' '/tmp/graph12112229343307759301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12112229343307759301.bin' '-l' '-1' '-v' '-w' '/tmp/graph12112229343307759301.weights' '-q' '0' '-e' '0.001'
[2023-03-08 02:30:20] [INFO ] Decomposing Gal with order
[2023-03-08 02:30:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 02:30:20] [INFO ] Computing Do-Not-Accords matrix : 264 transitions.
[2023-03-08 02:30:20] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 02:30:20] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8728708078556398270
Running compilation step : cd /tmp/ltsmin8728708078556398270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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 02:30:20] [INFO ] Removed a total of 219 redundant transitions.
[2023-03-08 02:30:20] [INFO ] Flatten gal took : 29 ms
[2023-03-08 02:30:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 201 labels/synchronizations in 6 ms.
[2023-03-08 02:30:20] [INFO ] Time to serialize gal into /tmp/LTLFireability4198884625165918732.gal : 2 ms
[2023-03-08 02:30:20] [INFO ] Time to serialize properties into /tmp/LTLFireability3017440310551644024.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/LTLFireability4198884625165918732.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3017440310551644024.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 1 LTL properties
Checking formula 0 : !(((("((i7.u3.s1>=1)&&(u0.l954>=1))")U(X(G("((i7.u3.s1>=1)&&(i7.u3.l955>=1))"))))U(X(G((F(!("((i7.u3.s1>=1)&&(i7.u3.l955>=1))")))||(X(...199
Formula 0 simplified : (!"((i7.u3.s1>=1)&&(u0.l954>=1))" R XF!"((i7.u3.s1>=1)&&(i7.u3.l955>=1))") R XF(G"((i7.u3.s1>=1)&&(i7.u3.l955>=1))" & XX"((i7.u3.s1>...175
Compilation finished in 578 ms.
Running link step : cd /tmp/ltsmin8728708078556398270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8728708078556398270;'/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) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
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.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: LTL layer: formula: (((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))
pins2lts-mc-linux64( 2/ 8), 0.008: "(((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.058: There are 267 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.058: State length is 156, there are 282 groups
pins2lts-mc-linux64( 0/ 8), 0.058: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.058: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.058: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.058: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.081: [Blue] ~40 levels ~960 states ~2472 transitions
pins2lts-mc-linux64( 3/ 8), 0.086: [Blue] ~47 levels ~1920 states ~4256 transitions
pins2lts-mc-linux64( 3/ 8), 0.111: [Blue] ~98 levels ~3840 states ~8672 transitions
pins2lts-mc-linux64( 3/ 8), 0.159: [Blue] ~194 levels ~7680 states ~17272 transitions
pins2lts-mc-linux64( 3/ 8), 0.228: [Blue] ~226 levels ~15360 states ~32976 transitions
pins2lts-mc-linux64( 3/ 8), 0.386: [Blue] ~226 levels ~30720 states ~65408 transitions
pins2lts-mc-linux64( 6/ 8), 0.655: [Blue] ~37 levels ~61440 states ~132448 transitions
pins2lts-mc-linux64( 6/ 8), 1.152: [Blue] ~38 levels ~122880 states ~262816 transitions
pins2lts-mc-linux64( 0/ 8), 2.050: [Blue] ~263 levels ~245760 states ~546280 transitions
pins2lts-mc-linux64( 0/ 8), 3.501: [Blue] ~263 levels ~491520 states ~1112472 transitions
pins2lts-mc-linux64( 6/ 8), 5.853: [Blue] ~51 levels ~983040 states ~2109760 transitions
pins2lts-mc-linux64( 4/ 8), 9.906: [Blue] ~1317 levels ~1966080 states ~4647872 transitions
pins2lts-mc-linux64( 2/ 8), 18.114: [Blue] ~3652 levels ~3932160 states ~9460952 transitions
pins2lts-mc-linux64( 4/ 8), 34.776: [Blue] ~6242 levels ~7864320 states ~21316472 transitions
pins2lts-mc-linux64( 4/ 8), 67.492: [Blue] ~6872 levels ~15728640 states ~41310720 transitions
pins2lts-mc-linux64( 0/ 8), 135.795: [Blue] ~22089 levels ~31457280 states ~87175408 transitions
pins2lts-mc-linux64( 0/ 8), 271.174: [Blue] ~33410 levels ~62914560 states ~180472928 transitions
pins2lts-mc-linux64( 4/ 8), 542.385: [Blue] ~59373 levels ~125829120 states ~368653808 transitions
pins2lts-mc-linux64( 1/ 8), 622.230: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 622.337:
pins2lts-mc-linux64( 0/ 8), 622.337: Explored 137887915 states 412148895 transitions, fanout: 2.989
pins2lts-mc-linux64( 0/ 8), 622.337: Total exploration time 622.260 sec (622.160 sec minimum, 622.203 sec on average)
pins2lts-mc-linux64( 0/ 8), 622.337: States per second: 221592, Transitions per second: 662342
pins2lts-mc-linux64( 0/ 8), 622.337:
pins2lts-mc-linux64( 0/ 8), 622.337: State space has 134217484 states, 1227550 are accepting
pins2lts-mc-linux64( 0/ 8), 622.337: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 622.337: blue states: 137887915 (102.73%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 622.337: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 622.337: all-red states: 16189511 (12.06%), bogus 1182 (0.00%)
pins2lts-mc-linux64( 0/ 8), 622.337:
pins2lts-mc-linux64( 0/ 8), 622.337: Total memory used for local state coloring: 95.4MB
pins2lts-mc-linux64( 0/ 8), 622.337:
pins2lts-mc-linux64( 0/ 8), 622.337: Queue width: 8B, total height: 6253451, memory: 47.71MB
pins2lts-mc-linux64( 0/ 8), 622.337: Tree memory: 1145.0MB, 8.9 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 622.337: Tree fill ratio (roots/leafs): 99.0%/47.0%
pins2lts-mc-linux64( 0/ 8), 622.337: Stored 306 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 622.337: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 622.337: Est. total memory use: 1192.7MB (~1071.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8728708078556398270;'/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) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8728708078556398270;'/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) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(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 02:51:37] [INFO ] Flatten gal took : 179 ms
[2023-03-08 02:51:37] [INFO ] Time to serialize gal into /tmp/LTLFireability7157213200308548477.gal : 42 ms
[2023-03-08 02:51:37] [INFO ] Time to serialize properties into /tmp/LTLFireability1473057564455075097.ltl : 7 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/LTLFireability7157213200308548477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1473057564455075097.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 1 LTL properties
Checking formula 0 : !(((("((s1>=1)&&(l954>=1))")U(X(G("((s1>=1)&&(l955>=1))"))))U(X(G((F(!("((s1>=1)&&(l955>=1))")))||(X(X(!("((s1>=1)&&(l954>=1))")))))))...157
Formula 0 simplified : (!"((s1>=1)&&(l954>=1))" R XF!"((s1>=1)&&(l955>=1))") R XF(G"((s1>=1)&&(l955>=1))" & XX"((s1>=1)&&(l954>=1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t20, t32, t37, t38, t40, t42, t50, t52, t53, t54, t55, t56, t57, t58, t...1122
Computing Next relation with stutter on 8.23785e+08 deadlock states
Detected timeout of ITS tools.
[2023-03-08 03:12:54] [INFO ] Flatten gal took : 41 ms
[2023-03-08 03:12:54] [INFO ] Input system was already deterministic with 264 transitions.
[2023-03-08 03:12:54] [INFO ] Transformed 155 places.
[2023-03-08 03:12:54] [INFO ] Transformed 264 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 03:12:55] [INFO ] Time to serialize gal into /tmp/LTLFireability16022010228446626767.gal : 7 ms
[2023-03-08 03:12:55] [INFO ] Time to serialize properties into /tmp/LTLFireability6888379161256253579.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/LTLFireability16022010228446626767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6888379161256253579.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 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((("((s1>=1)&&(l954>=1))")U(X(G("((s1>=1)&&(l955>=1))"))))U(X(G((F(!("((s1>=1)&&(l955>=1))")))||(X(X(!("((s1>=1)&&(l954>=1))")))))))...157
Formula 0 simplified : (!"((s1>=1)&&(l954>=1))" R XF!"((s1>=1)&&(l955>=1))") R XF(G"((s1>=1)&&(l955>=1))" & XX"((s1>=1)&&(l954>=1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9840840 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15811476 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-d1m08"
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-d1m08, 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-167814475100268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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